Michael B. Dillencourt

Wenhui Zhang, Lei Pan, Qinghong Shang, Lubomir F. Bic, Michael B. Dillencourt: Incremental Parallelization with Migration. ISPA 2012: 223-230

Matthew Badin, Lubomir Bic, Michael B. Dillencourt, Alexandru Nicolau: Improving accuracy for matrix multiplications on GPUs. Scientific Programming 19(1): 3-11 (2011)

Matthew Badin, Paolo D'Alberto, Lubomir Bic, Michael B. Dillencourt, Alexandru Nicolau: Improving the Accuracy of High Performance BLAS Implementations Using Adaptive Blocked Algorithms. SBAC-PAD 2011: 120-127

Matthew Badin, Lubomir Bic, Michael B. Dillencourt, Alexandru Nicolau: Pretty Good Accuracy in Matrix Multiplication with GPUs. ISPDC 2010: 49-55

Jiming Liu, Michael B. Dillencourt, Lubomir F. Bic, Daniel Gillen, Arthur D. Lander: Distributed Individual-Based Simulation. Euro-Par 2009: 590-601

Koji Noguchi, Michael B. Dillencourt, Lubomir Bic: Efficient Global Pointers With Spontaneous Process Migration. PDP 2008: 87-94

Lei Pan, Jingling Xue, Ming Kin Lai, Michael B. Dillencourt, Lubomir F. Bic: Toward Automatic Data Distribution for Migrating Computations. ICPP 2007: 27

Lei Pan, Wenhui Zhang, Arthur U. 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)

Michael B. Dillencourt, David Eppstein, Michael T. Goodrich: Choosing Colors for Geometric Graphs Via Color Space Embeddings. Graph Drawing 2006: 294-305

Michael B. Dillencourt, David Eppstein, Michael T. Goodrich: Choosing Colors for Geometric Graphs via Color Space Embeddings. CoRR abs/cs/0609033 (2006)

Hairong Kuang, Lubomir F. Bic, Michael B. Dillencourt: PODC: Paradigm-oriented distributed computing. J. Parallel Distrib. Comput. 65(4): 506-518 (2005)

Lei Pan, Ming Kin Lai, Michael B. Dillencourt, Lubomir F. Bic: Mobile Pipelines: Parallelizing Left-Looking Algorithms Using Navigational Programming. HiPC 2005: 201-212

Lei Pan, Wenhui Zhang, Arthur U. Asuncion, Ming Kin Lai, Michael B. Dillencourt, Lubomir Bic: Incremental Parallelization Using Navigational Programming: A Case Study. ICPP 2005: 611-620

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)

Hairong Kuang, Lubomir Bic, Michael B. Dillencourt: GIDM: Globally-Indexed Distributed Memory. FTDCS 2003: 108-114

Lei Pan, Lubomir Bic, Michael B. Dillencourt, Ming Kin Lai: From Distributed Sequential Computing to Distributed Parallel Computing. ICPP Workshops 2003: 255-262

Lei Pan, Lubomir Bic, Michael B. Dillencourt, Ming Kin Lai: Mobile Agents - The Right Vehicle for Distributed Sequential Computing. HiPC 2002: 575-586

Hairong Kuang, Lubomir Bic, Michael B. Dillencourt: Iterative Grid-Based Computing Using Mobile Agents. ICPP 2002: 109-

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

Lei Pan, Lubomir Bic, Michael B. Dillencourt: Distributed Sequential Numerical Computing Using Mobile Agents: Moving Code to Data. ICPP 2001: 77-86

Eugene Gendelman, Lubomir Bic, Michael B. Dillencourt: Fast File Access for Fast Agents. Mobile Agents 2001: 88-102

Michael B. Dillencourt, David Eppstein, Daniel S. Hirschberg: Geometric Thickness of Complete Graphs. J. Graph Algorithms Appl. 4(3): 5-17 (2000)

Katherine L. Morse, Lubomir Bic, Michael B. Dillencourt: Interest Management in Large-Scale Virtual Environments. Presence 9(1): 52-68 (2000)

Eugene Gendelman, Lubomir Bic, Michael B. Dillencourt: Process Interconnection Structures in Dynamically Changing Topologies. HiPC 2000: 405-414

Hairong Kuang, Lubomir Bic, Michael B. Dillencourt: Paradigm-Oriented Distributed Computing using Mobile Agents. ICDCS 2000: 11-19

Eugene Gendelman, Lubomir Bic, Michael B. Dillencourt: An Application-Transparent, Platform-Independent Approach to Rollback-Recovery for Mobile Agent Systems. ICDCS 2000: 564-571

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)

Hairong Kuang, Lubomir Bic, Michael B. Dillencourt, Adam C. Chang: PODC: Paradigm-Oriented Distributed Computing. FTDCS 1999: 169-175

Eugene Gendelman, Lubomir Bic, Michael B. Dillencourt: An Efficient Checkpointing Algorithm for Distributed Systems Implementing Reliable Communication Channels. SRDS 1999: 290-291

Michael B. Dillencourt, David Eppstein, Daniel S. Hirschberg: Geometric Thickness of Complete Graphs. CoRR math.CO/9910185 (1999)

Munehiro Fukuda, Lubomir Bic, Michael B. Dillencourt, Fehmina Merchant: Distributed Coordination with MESSENGERS. Sci. Comput. Program. 31(2-3): 291-311 (1998)

Fehmina Merchant, Lubomir Bic, Michael B. Dillencourt: Load Balancing in Individual-Based Spatial Applications. IEEE PACT 1998: 350-357

Michael B. Dillencourt, David Eppstein, Daniel S. Hirschberg: Geometric Thickness of Complete Graphs. Graph Drawing 1998: 101-110

Christian Wicke, Lubomir Bic, Michael B. Dillencourt, Munehiro Fukuda: Automatic State Capture of Self-Migrating Computations in MESSENGERS. Mobile Agents 1998: 68-79

Tamal K. Dey, Michael B. Dillencourt, Subir Kumar Ghosh, Jason M. Cahill: Triangulating with High Connectivity. Comput. Geom. 8: 39-56 (1997)

Munehiro Fukuda, Lubomir Bic, Michael B. Dillencourt, Fehmina Merchant: A Hierarchical Mapping Scheme for Mobile Agent Systems. FTDCS 1997: 66-71

Munehiro Fukuda, Lubomir Bic, Michael B. Dillencourt, Fehmina Merchant: Messages versus Messengers in Distributed Programming. ICDCS 1997: 0-

Munehiro Fukuda, Lubomir Bic, Michael B. Dillencourt: Performance of the MESSENGERS Autonomous-Objects-Based System. WWCA 1997: 43-57

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)

Lubomir Bic, Munehiro Fukuda, Michael B. Dillencourt: Distributed Computing Using Autonomous Objects. IEEE Computer 29(8): 55-61 (1996)

Michael B. Dillencourt: Finding Hamiltonian Cycles in Delaunay Triangulations Is NP-complete. Discrete Applied Mathematics 64(3): 207-217 (1996)

Michael B. Dillencourt, Warren D. Smith: Graph-theoretical conditions for inscribability and Delaunay realizability. Discrete Mathematics 161(1-3): 63-77 (1996)

Michael B. Dillencourt: Polyhedra of Small Order and Their Hamiltonian Properties. J. Comb. Theory, Ser. B 66(1): 87-122 (1996)

Munehiro Fukuda, Lubomir Bic, Michael B. Dillencourt, Fehmina Merchant: Intra- and Inter-Object Coordination with MESSENGERS. COORDINATION 1996: 179-196

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)

Michael B. Dillencourt, Warren D. Smith: Graph-Theoretical Conditions for Inscribability and Delaunay Realizability. CCCG 1994: 287-292

Tamal K. Dey, Michael B. Dillencourt, Subir Kumar Ghosh: Triangulating with High Connectivity. CCCG 1994: 339-343

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

Michael B. Dillencourt, Warren D. Smith: A Simple Method for Resolving Degeneracies in Delaunay Triangulations. ICALP 1993: 177-188

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)

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)

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)

Michael B. Dillencourt, Warren D. Smith: A Linear-Time Algorithm for Testing the Inscribability of Trivalent Polyhedra. Symposium on Computational Geometry 1992: 177-185

Michael B. Dillencourt: An upper bound on the shortness exponent of 1-tough, maximal planar graphs. Discrete Mathematics 90(1): 93-97 (1991)

Michael B. Dillencourt: Toughness and Delaunay Triangulations. Discrete & Computational Geometry 5: 575-601 (1990)

Michael B. Dillencourt: Realizability of Delaunay Triangulations. Inf. Process. Lett. 33(6): 283-287 (1990)

Michael B. Dillencourt: Hamiltonian cycles in planar triangulations with no separating triangles. Journal of Graph Theory 14(1): 31-49 (1990)

Michael B. Dillencourt: An upper bound on the shortness exponent of inscribable polytopes. J. Comb. Theory, Ser. B 46(1): 66-83 (1989)

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)

Michael B. Dillencourt: A Non-Hamiltonian, Nondegenerate Delaunay Triangulation. Inf. Process. Lett. 25(3): 149-151 (1987)

Michael B. Dillencourt: Toughness and Delaunay Triangulations. Symposium on Computational Geometry 1987: 186-194