Michael B. Dillencourt

According to our database, Michael B. Dillencourt authored at least 69 papers between 1987 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Leveraging parameterized Chernoff bounds for simplified algorithm analyses.

Michael B. Dillencourt, Michael T. Goodrich, Michael Mitzenmacher

Inf. Process. Lett., 2025

2023

Simplified Chernoff bounds with powers-of-two probabilities.

Michael B. Dillencourt, Michael T. Goodrich

Inf. Process. Lett., August, 2023

Noisy Sorting Without Searching: Data Oblivious Sorting with Comparison Errors.

Ramtin Afshar, Michael B. Dillencourt, Michael T. Goodrich, Evrim Ozel

Proceedings of the 21st International Symposium on Experimental Algorithms, 2023

2016

Capturing Lombardi Flow in Orthogonal Drawings by Minimizing the Number of Segments.

Md. Jawaherul Alam, Michael B. Dillencourt, Michael T. Goodrich

CoRR, 2016

2015

Distributed power flow loss minimization control for future grid.

Kiyoshi Nakayama, Changhong Zhao, Lubomir F. Bic, Michael B. Dillencourt, Jack Brouwer

Int. J. Circuit Theory Appl., 2015

2014

Distributed flow optimization control for energy-harvesting wireless sensor networks.

Kiyoshi Nakayama, Nga Dang, Lubomir F. Bic, Michael B. Dillencourt, Elaheh Bozorgzadeh, Nalini Venkatasubramanian

Proceedings of the IEEE International Conference on Communications, 2014

2013

Distributed Real-Time Power Flow control with renewable integration.

Kiyoshi Nakayama, Changhong Zhao, Lubomir F. Bic, Michael B. Dillencourt, Jack Brouwer

Proceedings of the IEEE Fourth International Conference on Smart Grid Communications, 2013

Tie-set Based Fault Tolerance for autonomous recovery of double-link failures.

Kiyoshi Nakayama, Kyle E. Benson, Vahe Avagyan, Michael B. Dillencourt, Lubomir F. Bic, Nalini Venkatasubramanian

Proceedings of the 2013 IEEE Symposium on Computers and Communications, 2013

Improving numerical accuracy for non-negative matrix multiplication on GPUs using recursive algorithms.

Matthew Badin, Paolo D'Alberto, Lubomir Bic, Michael B. Dillencourt, Alexandru Nicolau

Proceedings of the International Conference on Supercomputing, 2013

2012

Complete automation of future grid for optimal real-time distribution of renewables.

Kiyoshi Nakayama, Kyle E. Benson, Lubomir F. Bic, Michael B. Dillencourt

Proceedings of the IEEE Third International Conference on Smart Grid Communications, 2012

Incremental Parallelization with Migration.

Wenhui Zhang, Lei Pan, Qinghong Shang, Lubomir F. Bic, Michael B. Dillencourt

Proceedings of the 10th IEEE International Symposium on Parallel and Distributed Processing with Applications, 2012

2011

Improving accuracy for matrix multiplications on GPUs.

Matthew Badin, Lubomir Bic, Michael B. Dillencourt, Alexandru Nicolau

Sci. Program., 2011

Improving the Accuracy of High Performance BLAS Implementations Using Adaptive Blocked Algorithms.

Matthew Badin, Paolo D'Alberto, Lubomir Bic, Michael B. Dillencourt, Alexandru Nicolau

Proceedings of the 23rd International Symposium on Computer Architecture and High Performance Computing, 2011

2010

Pretty Good Accuracy in Matrix Multiplication with GPUs.

Matthew Badin, Lubomir Bic, Michael B. Dillencourt, Alexandru Nicolau

Proceedings of the Ninth International Symposium on Parallel and Distributed Computing, 2010

2009

Distributed Individual-Based Simulation.

Jiming Liu, Michael B. Dillencourt, Lubomir F. Bic, Daniel L. Gillen, Arthur D. Lander

Proceedings of the Euro-Par 2009 Parallel Processing, 2009

2008

Efficient Global Pointers With Spontaneous Process Migration.

Koji Noguchi, Michael B. Dillencourt, Lubomir Bic

Proceedings of the 16th Euromicro International Conference on Parallel, 2008

2007

Toward Automatic Data Distribution for Migrating Computations.

Lei Pan, Jingling Xue, Ming Kin Lai, Michael B. Dillencourt, Lubomir F. Bic

Proceedings of the 2007 International Conference on Parallel Processing (ICPP 2007), 2007

2006

Toward Incremental Parallelization Using Navigational Programming.

Lei Pan, Wenhui Zhang, Arthur U. Asuncion, Ming Kin Lai, Michael B. Dillencourt, Lubomir F. Bic, Laurence Tianruo Yang

IEICE Trans. Inf. Syst., 2006

Choosing Colors for Geometric Graphs Via Color Space Embeddings.

Michael B. Dillencourt, David Eppstein, Michael T. Goodrich

Proceedings of the Graph Drawing, 14th International Symposium, 2006

2005

PODC: Paradigm-oriented distributed computing.

Hairong Kuang, Lubomir F. Bic, Michael B. Dillencourt

J. Parallel Distributed Comput., 2005

Incremental Parallelization Using Navigational Programming: A Case Study.

Lei Pan, Wenhui Zhang, Arthur U. Asuncion, Ming Kin Lai, Michael B. Dillencourt, Lubomir Bic

Proceedings of the 34th International Conference on Parallel Processing (ICPP 2005), 2005

Mobile Pipelines: Parallelizing Left-Looking Algorithms Using Navigational Programming.

Lei Pan, Ming Kin Lai, Michael B. Dillencourt, Lubomir F. Bic

Proceedings of the High Performance Computing, 2005

2004

Distributed Parallel Computing Using Navigational Programming.

Lei Pan, Ming Kin Lai, Koji Noguchi, Javid J. Huseynov, Lubomir Bic, Michael B. Dillencourt

Int. J. Parallel Program., 2004

2003

From Distributed Sequential Computing to Distributed Parallel Computing.

Lei Pan, Lubomir Bic, Michael B. Dillencourt, Ming Kin Lai

Proceedings of the 32nd International Conference on Parallel Processing Workshops (ICPP 2003 Workshops), 2003

GIDM: Globally-Indexed Distributed Memory.

Hairong Kuang, Lubomir Bic, Michael B. Dillencourt

Proceedings of the 9th IEEE International Workshop on Future Trends of Distributed Computing Systems (FTDCS 2003), 2003

2002

Distributed Parallel Computing using Navigational Programming: Orchestrating Computations Around Data.

Lei Pan, Lubomir Bic, Michael B. Dillencourt, Javid J. Huseynov, Ming Kin Lai

Proceedings of the International Conference on Parallel and Distributed Computing Systems, 2002

Iterative Grid-Based Computing Using Mobile Agents.

Hairong Kuang, Lubomir Bic, Michael B. Dillencourt

Proceedings of the 31st International Conference on Parallel Processing (ICPP 2002), 2002

Mobile Agents - The Right Vehicle for Distributed Sequential Computing.

Lei Pan, Lubomir Bic, Michael B. Dillencourt, Ming Kin Lai

Proceedings of the High Performance Computing, 2002

2001

Messengers: Distributed Programming using Mobile Agents.

Munehiro Fukuda, Lubomir F. Bic, Michael B. Dillencourt, Fehmina Merchant

Trans. SDPS, 2001

Fast File Access for Fast Agents.

Eugene Gendelman, Lubomir Bic, Michael B. Dillencourt

Proceedings of the Mobile Agents, 5th International Conference, 2001

Distributed Sequential Numerical Computing Using Mobile Agents: Moving Code to Data.

Lei Pan, Lubomir Bic, Michael B. Dillencourt

Proceedings of the 2001 International Conference on Parallel Processing, 2001

2000

Interest Management in Large-Scale Virtual Environments.

Katherine L. Morse, Lubomir Bic, Michael B. Dillencourt

Presence Teleoperators Virtual Environ., 2000

Geometric Thickness of Complete Graphs.

Michael B. Dillencourt, David Eppstein, Daniel S. Hirschberg

J. Graph Algorithms Appl., 2000

Paradigm-Oriented Distributed Computing using Mobile Agents.

Hairong Kuang, Lubomir Bic, Michael B. Dillencourt

Proceedings of the 20th International Conference on Distributed Computing Systems, 2000

An Application-Transparent, Platform-Independent Approach to Rollback-Recovery for Mobile Agent Systems.

Eugene Gendelman, Lubomir Bic, Michael B. Dillencourt

Proceedings of the 20th International Conference on Distributed Computing Systems, 2000

Process Interconnection Structures in Dynamically Changing Topologies.

Eugene Gendelman, Lubomir Bic, Michael B. Dillencourt

Proceedings of the High Performance Computing, 2000

1999

Messages versus Messengers in Distributed Programming.

Munehiro Fukuda, Lubomir Bic, Michael B. Dillencourt, Jason M. Cahill

J. Parallel Distributed Comput., 1999

An Efficient Checkpointing Algorithm for Distributed Systems Implementing Reliable Communication Channels.

Eugene Gendelman, Lubomir Bic, Michael B. Dillencourt

Proceedings of the Eighteenth Symposium on Reliable Distributed Systems, 1999

Compiling for fast state capture of mobile agents.

Christian Wicke, Lubomir F. Bic, Michael B. Dillencourt

Proceedings of the Parallel Computing: Fundamentals & Applications, 1999

PODC: Paradigm-Oriented Distributed Computing.

Hairong Kuang, Lubomir Bic, Michael B. Dillencourt, Adam C. Chang

Proceedings of the 7th IEEE Workshop on Future Trends of Distributed Computer Systems (FTDCS '99), 1999

1998

Distributed Coordination with MESSENGERS.

Munehiro Fukuda, Lubomir Bic, Michael B. Dillencourt, Fehmina Merchant

Sci. Comput. Program., 1998

Automatic State Capture of Self-Migrating Computations in MESSENGERS.

Christian Wicke, Lubomir Bic, Michael B. Dillencourt, Munehiro Fukuda

Proceedings of the Mobile Agents, Second International Workshop, 1998

Load Balancing in Individual-Based Spatial Applications.

Fehmina Merchant, Lubomir Bic, Michael B. Dillencourt

Proceedings of the 1998 International Conference on Parallel Architectures and Compilation Techniques, 1998

1997

Triangulating with High Connectivity.

Tamal K. Dey, Michael B. Dillencourt, Subir Kumar Ghosh, Jason M. Cahill

Comput. Geom., 1997

Performance of the MESSENGERS Autonomous-Objects-Based System.

Munehiro Fukuda, Lubomir Bic, Michael B. Dillencourt

Proceedings of the Worldwide Computing and Its Applications, International Conference, 1997

Messages versus Messengers in Distributed Programming.

Munehiro Fukuda, Lubomir Bic, Michael B. Dillencourt, Fehmina Merchant

Proceedings of the 17th International Conference on Distributed Computing Systems, 1997

A Hierarchical Mapping Scheme for Mobile Agent Systems.

Munehiro Fukuda, Lubomir Bic, Michael B. Dillencourt, Fehmina Merchant

Proceedings of the 6th IEEE Workshop on Future Trends of Distributed Computer Systems (FTDCS '97), 1997

1996

Polyhedra of Small Order and Their Hamiltonian Properties.

Michael B. Dillencourt

J. Comb. Theory B, 1996

Graph-theoretical conditions for inscribability and Delaunay realizability.

Michael B. Dillencourt, Warren D. Smith

Discret. Math., 1996

Finding Hamiltonian Cycles in Delaunay Triangulations Is NP-complete.

Michael B. Dillencourt

Discret. Appl. Math., 1996

Distributed Computing Using Autonomous Objects.

Lubomir Bic, Munehiro Fukuda, Michael B. Dillencourt

Computer, 1996

Using Topological Sweep to Extract the Boundaries of Regions in Maps Represented by Region Quadtrees.

Michael B. Dillencourt, Hanan Samet

Algorithmica, 1996

Intra- and Inter-Object Coordination with MESSENGERS.

Munehiro Fukuda, Lubomir Bic, Michael B. Dillencourt, Fehmina Merchant

Proceedings of the Coordination Languages and Models, First International Conference, 1996

1995

A linear-time algorithm for testing the inscribability of trivalent polyhedra.

Michael B. Dillencourt, Warren D. Smith

Int. J. Comput. Geom. Appl., 1995

1994

Triangulating with High Connectivity.

Tamal K. Dey, Michael B. Dillencourt, Subir Kumar Ghosh

Proceedings of the 6th Canadian Conference on Computational Geometry, 1994

1993

A Simple Method for Resolving Degeneracies in Delaunay Triangulations.

Michael B. Dillencourt, Warren D. Smith

Proceedings of the Automata, Languages and Programming, 20nd International Colloquium, 1993

On the Maximum Number of Intersections of Two Polyhedra in 2 and 3 Dimensions.

Michael B. Dillencourt, David M. Mount, Alan Saalfeld

Proceedings of the 5th Canadian Conference on Computational Geometry, 1993

1992

Corrigenda: 'A General Approach to Connected-Component Labelling for Arbitrary Image Representations'.

Michael B. Dillencourt, Hanan Samet, Markku Tamminen

J. ACM, 1992

A General Approach to Connected-Component Labelling for Arbitrary Image Representations.

Michael B. Dillencourt, Hanan Samet, Markku Tamminen

J. ACM, 1992

A randomized algorithm for slope selection.

Michael B. Dillencourt, David M. Mount, Nathan S. Netanyahu

Int. J. Comput. Geom. Appl., 1992

Graph Tool - A Tool for Interactive Design and Manipulation of Graphs and Graph Algorithms.

Vitus J. Leung, Michael B. Dillencourt, Andrew L. Bliss

Proceedings of the Computational Support for Discrete Mathematics, 1992

1991

An upper bound on the shortness exponent of 1-tough, maximal planar graphs.

Michael B. Dillencourt

Discret. Math., 1991

1990

Hamiltonian cycles in planar triangulations with no separating triangles.

Michael B. Dillencourt

J. Graph Theory, 1990

Realizability of Delaunay Triangulations.

Michael B. Dillencourt

Inf. Process. Lett., 1990

Toughness and Delaunay Triangulations.

Michael B. Dillencourt

Discret. Comput. Geom., 1990

1989

Compressing quadtrees via common subtree merging.

Robert E. Webber, Michael B. Dillencourt

Pattern Recognit. Lett., 1989

An upper bound on the shortness exponent of inscribable polytopes.

Michael B. Dillencourt

J. Comb. Theory B, 1989

1987

A Non-Hamiltonian, Nondegenerate Delaunay Triangulation.

Michael B. Dillencourt

Inf. Process. Lett., 1987

Traveling Salesman Cycles are not Always Subgraphs of Delaunay Triangulations or of Minimum Weight Triangulations.

Michael B. Dillencourt

Inf. Process. Lett., 1987