| 2008 |
|---|
| 55 | EE | Koji Noguchi,
Michael B. Dillencourt,
Lubomir Bic:
Efficient Global Pointers With Spontaneous Process Migration.
PDP 2008: 87-94 |
| 2007 |
|---|
| 54 | EE | Lei Pan,
Jingling Xue,
Ming Kin Lai,
Michael B. Dillencourt,
Lubomir F. Bic:
Toward Automatic Data Distribution for Migrating Computations.
ICPP 2007: 27 |
| 2006 |
|---|
| 53 | EE | Michael B. Dillencourt,
David Eppstein,
Michael T. Goodrich:
Choosing Colors for Geometric Graphs Via Color Space Embeddings.
Graph Drawing 2006: 294-305 |
| 52 | EE | Michael B. Dillencourt,
David Eppstein,
Michael T. Goodrich:
Choosing Colors for Geometric Graphs via Color Space Embeddings
CoRR abs/cs/0609033: (2006) |
| 51 | EE | Lei Pan,
Wenhui Zhang,
Arthur Asuncion,
Ming Kin Lai,
Michael B. Dillencourt,
Lubomir F. Bic,
Laurence Tianruo Yang:
Toward Incremental Parallelization Using Navigational Programming.
IEICE Transactions 89-D(2): 390-398 (2006) |
| 2005 |
|---|
| 50 | EE | Lei Pan,
Ming Kin Lai,
Michael B. Dillencourt,
Lubomir F. Bic:
Mobile Pipelines: Parallelizing Left-Looking Algorithms Using Navigational Programming.
HiPC 2005: 201-212 |
| 49 | EE | Lei Pan,
Wenhui Zhang,
Arthur Asuncion,
Ming Kin Lai,
Michael B. Dillencourt,
Lubomir Bic:
Incremental Parallelization Using Navigational Programming: A Case Study.
ICPP 2005: 611-620 |
| 48 | EE | Hairong Kuang,
Lubomir F. Bic,
Michael B. Dillencourt:
PODC: Paradigm-oriented distributed computing.
J. Parallel Distrib. Comput. 65(4): 506-518 (2005) |
| 2004 |
|---|
| 47 | EE | Lei Pan,
Ming Kin Lai,
Koji Noguchi,
Javid J. Huseynov,
Lubomir Bic,
Michael B. Dillencourt:
Distributed Parallel Computing Using Navigational Programming.
International Journal of Parallel Programming 32(1): 1-37 (2004) |
| 2003 |
|---|
| 46 | EE | Hairong Kuang,
Lubomir Bic,
Michael B. Dillencourt:
GIDM: Globally-Indexed Distributed Memory.
FTDCS 2003: 108-114 |
| 45 | EE | Lei Pan,
Lubomir Bic,
Michael B. Dillencourt,
Ming Kin Lai:
From Distributed Sequential Computing to Distributed Parallel Computing.
ICPP Workshops 2003: 255-262 |
| 2002 |
|---|
| 44 | EE | Lei Pan,
Lubomir Bic,
Michael B. Dillencourt,
Ming Kin Lai:
Mobile Agents - The Right Vehicle for Distributed Sequential Computing.
HiPC 2002: 575-586 |
| 43 | | Lei Pan,
Lubomir Bic,
Michael B. Dillencourt,
Javid J. Huseynov,
Ming Kin Lai:
Distributed Parallel Computing using Navigational Programming: Orchestrating Computations Around Data.
IASTED PDCS 2002: 453-458 |
| 42 | EE | Hairong Kuang,
Lubomir Bic,
Michael B. Dillencourt:
Iterative Grid-Based Computing Using Mobile Agents.
ICPP 2002: 109- |
| 2001 |
|---|
| 41 | EE | Lei Pan,
Lubomir Bic,
Michael B. Dillencourt:
Distributed Sequential Numerical Computing Using Mobile Agents: Moving Code to Data.
ICPP 2001: 77-86 |
| 40 | EE | Eugene Gendelman,
Lubomir Bic,
Michael B. Dillencourt:
Fast File Access for Fast Agents.
Mobile Agents 2001: 88-102 |
| 2000 |
|---|
| 39 | EE | Eugene Gendelman,
Lubomir Bic,
Michael B. Dillencourt:
Process Interconnection Structures in Dynamically Changing Topologies.
HiPC 2000: 405-414 |
| 38 | EE | Hairong Kuang,
Lubomir Bic,
Michael B. Dillencourt:
Paradigm-Oriented Distributed Computing using Mobile Agents.
ICDCS 2000: 11-19 |
| 37 | EE | Eugene Gendelman,
Lubomir Bic,
Michael B. Dillencourt:
An Application-Transparent, Platform-Independent Approach to Rollback-Recovery for Mobile Agent Systems.
ICDCS 2000: 564-571 |
| 36 | EE | Michael B. Dillencourt,
David Eppstein,
Daniel S. Hirschberg:
Geometric Thickness of Complete Graphs.
J. Graph Algorithms Appl. 4(3): 5-17 (2000) |
| 35 | | Katherine L. Morse,
Lubomir Bic,
Michael B. Dillencourt:
Interest Management in Large-Scale Virtual Environments.
Presence 9(1): 52-68 (2000) |
| 1999 |
|---|
| 34 | EE | Hairong Kuang,
Lubomir Bic,
Michael B. Dillencourt,
Adam C. Chang:
PODC: Paradigm-Oriented Distributed Computing.
FTDCS 1999: 169-175 |
| 33 | EE | Eugene Gendelman,
Lubomir Bic,
Michael B. Dillencourt:
An Efficient Checkpointing Algorithm for Distributed Systems Implementing Reliable Communication Channels.
SRDS 1999: 290-291 |
| 32 | EE | Michael B. Dillencourt,
David Eppstein,
Daniel S. Hirschberg:
Geometric Thickness of Complete Graphs
CoRR math.CO/9910185: (1999) |
| 31 | | Munehiro Fukuda,
Lubomir Bic,
Michael B. Dillencourt,
Jason M. Cahill:
Messages versus Messengers in Distributed Programming.
J. Parallel Distrib. Comput. 57(2): 188-211 (1999) |
| 1998 |
|---|
| 30 | EE | Michael B. Dillencourt,
David Eppstein,
Daniel S. Hirschberg:
Geometric Thickness of Complete Graphs.
Graph Drawing 1998: 101-110 |
| 29 | EE | Fehmina Merchant,
Lubomir Bic,
Michael B. Dillencourt:
Load Balancing in Individual-Based Spatial Applications.
IEEE PACT 1998: 350-357 |
| 28 | EE | Christian Wicke,
Lubomir Bic,
Michael B. Dillencourt,
Munehiro Fukuda:
Automatic State Capture of Self-Migrating Computations in MESSENGERS.
Mobile Agents 1998: 68-79 |
| 27 | | Munehiro Fukuda,
Lubomir Bic,
Michael B. Dillencourt,
Fehmina Merchant:
Distributed Coordination with MESSENGERS.
Sci. Comput. Program. 31(2-3): 291-311 (1998) |
| 1997 |
|---|
| 26 | EE | Munehiro Fukuda,
Lubomir Bic,
Michael B. Dillencourt,
Fehmina Merchant:
A Hierarchical Mapping Scheme for Mobile Agent Systems.
FTDCS 1997: 66-71 |
| 25 | | Munehiro Fukuda,
Lubomir Bic,
Michael B. Dillencourt,
Fehmina Merchant:
Messages versus Messengers in Distributed Programming.
ICDCS 1997: 0- |
| 24 | | Munehiro Fukuda,
Lubomir Bic,
Michael B. Dillencourt:
Performance of the MESSENGERS Autonomous-Objects-Based System.
WWCA 1997: 43-57 |
| 23 | | Tamal K. Dey,
Michael B. Dillencourt,
Subir Kumar Ghosh,
Jason M. Cahill:
Triangulating with High Connectivity.
Comput. Geom. 8: 39-56 (1997) |
| 1996 |
|---|
| 22 | | Munehiro Fukuda,
Lubomir Bic,
Michael B. Dillencourt,
Fehmina Merchant:
Intra- and Inter-Object Coordination with MESSENGERS.
COORDINATION 1996: 179-196 |
| 21 | | Michael B. Dillencourt,
Hanan Samet:
Using Topological Sweep to Extract the Boundaries of Regions in Maps Represented by Region Quadtrees.
Algorithmica 15(1): 82-102 (1996) |
| 20 | EE | Michael B. Dillencourt:
Finding Hamiltonian Cycles in Delaunay Triangulations Is NP-complete.
Discrete Applied Mathematics 64(3): 207-217 (1996) |
| 19 | EE | Michael B. Dillencourt,
Warren D. Smith:
Graph-theoretical conditions for inscribability and Delaunay realizability.
Discrete Mathematics 161(1-3): 63-77 (1996) |
| 18 | | Lubomir Bic,
Munehiro Fukuda,
Michael B. Dillencourt:
Distributed Computing Using Autonomous Objects.
IEEE Computer 29(8): 55-61 (1996) |
| 17 | EE | Michael B. Dillencourt:
Polyhedra of Small Order and Their Hamiltonian Properties.
J. Comb. Theory, Ser. B 66(1): 87-122 (1996) |
| 1995 |
|---|
| 16 | | Michael B. Dillencourt,
Warren D. Smith:
A linear-time algorithm for testing the inscribability of trivalent polyhedra.
Int. J. Comput. Geometry Appl. 5: 21-36 (1995) |
| 1994 |
|---|
| 15 | | Michael B. Dillencourt,
Warren D. Smith:
Graph-Theoretical Conditions for Inscribability and Delaunay Realizability.
CCCG 1994: 287-292 |
| 14 | | Tamal K. Dey,
Michael B. Dillencourt,
Subir Kumar Ghosh:
Triangulating with High Connectivity.
CCCG 1994: 339-343 |
| 1993 |
|---|
| 13 | | Michael B. Dillencourt,
David M. Mount,
Alan Saalfeld:
On the Maximum Number of Intersections of Two Polyhedra in 2 and 3 Dimensions.
CCCG 1993: 49-54 |
| 12 | | Michael B. Dillencourt,
Warren D. Smith:
A Simple Method for Resolving Degeneracies in Delaunay Triangulations.
ICALP 1993: 177-188 |
| 1992 |
|---|
| 11 | EE | Michael B. Dillencourt,
Warren D. Smith:
A Linear-Time Algorithm for Testing the Inscribability of Trivalent Polyhedra.
Symposium on Computational Geometry 1992: 177-185 |
| 10 | | Michael B. Dillencourt,
David M. Mount,
Nathan S. Netanyahu:
A randomized algorithm for slope selection.
Int. J. Comput. Geometry Appl. 2(1): 1-27 (1992) |
| 9 | EE | Michael B. Dillencourt,
Hanan Samet,
Markku Tamminen:
A General Approach to Connected-Component Labelling for Arbitrary Image Representations.
J. ACM 39(2): 253-280 (1992) |
| 8 | | Michael B. Dillencourt,
Hanan Samet,
Markku Tamminen:
Corrigenda: 'A General Approach to Connected-Component Labelling for Arbitrary Image Representations'.
J. ACM 39(4): 985-986 (1992) |
| 1991 |
|---|
| 7 | EE | Michael B. Dillencourt:
An upper bound on the shortness exponent of 1-tough, maximal planar graphs.
Discrete Mathematics 90(1): 93-97 (1991) |
| 1990 |
|---|
| 6 | | Michael B. Dillencourt:
Toughness and Delaunary Triangulations.
Discrete & Computational Geometry 5: 575-601 (1990) |
| 5 | | Michael B. Dillencourt:
Realizability of Delaunay Triangulations.
Inf. Process. Lett. 33(6): 283-287 (1990) |
| 1989 |
|---|
| 4 | EE | Michael B. Dillencourt:
An upper bound on the shortness exponent of inscribable polytopes.
J. Comb. Theory, Ser. B 46(1): 66-83 (1989) |
| 1987 |
|---|
| 3 | EE | Michael B. Dillencourt:
Toughness and Delaunay Triangulations.
Symposium on Computational Geometry 1987: 186-194 |
| 2 | | Michael B. Dillencourt:
Traveling Salesman Cycles are not Always Subgraphs of Delaunay Triangulations or of Minimum Weight Triangulations.
Inf. Process. Lett. 24(5): 339-342 (1987) |
| 1 | | Michael B. Dillencourt:
A Non-Hamiltonian, Nondegenerate Delaunay Triangulation.
Inf. Process. Lett. 25(3): 149-151 (1987) |
