Michael B. Dillencourt

Publication Activity (10 Years)

Years Active: 1987-2023
Publications (10 Years): 3

Top Topics

Loss Minimization

Sensor Networks

Top Venues

Inf. Process. Lett.

Publications

Michael B. Dillencourt, Michael T. Goodrich
Simplified Chernoff bounds with powers-of-two probabilities. Inf. Process. Lett. 182 (2023)
Ramtin Afshar, Michael B. Dillencourt, Michael T. Goodrich, Evrim Ozel
Noisy Sorting Without Searching: Data Oblivious Sorting with Comparison Errors. SEA (2023)
Md. Jawaherul Alam, Michael B. Dillencourt, Michael T. Goodrich
Capturing Lombardi Flow in Orthogonal Drawings by Minimizing the Number of Segments. CoRR (2016)
Kiyoshi Nakayama, Changhong Zhao, Lubomir F. Bic, Michael B. Dillencourt, Jack Brouwer
Distributed power flow loss minimization control for future grid. Int. J. Circuit Theory Appl. 43 (9) (2015)
Kiyoshi Nakayama, Nga Dang, Lubomir F. Bic, Michael B. Dillencourt, Elaheh Bozorgzadeh, Nalini Venkatasubramanian
Distributed flow optimization control for energy-harvesting wireless sensor networks. ICC (2014)
Kiyoshi Nakayama, Changhong Zhao, Lubomir F. Bic, Michael B. Dillencourt, Jack Brouwer
Distributed Real-Time Power Flow control with renewable integration. SmartGridComm (2013)
Matthew Badin, Paolo D'Alberto, Lubomir Bic, Michael B. Dillencourt, Alexandru Nicolau
Improving numerical accuracy for non-negative matrix multiplication on GPUs using recursive algorithms. ICS (2013)
Kiyoshi Nakayama, Kyle E. Benson, Vahe Avagyan, Michael B. Dillencourt, Lubomir F. Bic, Nalini Venkatasubramanian
Tie-set Based Fault Tolerance for autonomous recovery of double-link failures. ISCC (2013)
Wenhui Zhang, Lei Pan, Qinghong Shang, Lubomir F. Bic, Michael B. Dillencourt
Incremental Parallelization with Migration. ISPA (2012)
Kiyoshi Nakayama, Kyle E. Benson, Lubomir F. Bic, Michael B. Dillencourt
Complete automation of future grid for optimal real-time distribution of renewables. SmartGridComm (2012)
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)
Matthew Badin, Lubomir Bic, Michael B. Dillencourt, Alexandru Nicolau
Improving accuracy for matrix multiplications on GPUs. Sci. Program. 19 (1) (2011)
Matthew Badin, Lubomir Bic, Michael B. Dillencourt, Alexandru Nicolau
Pretty Good Accuracy in Matrix Multiplication with GPUs. ISPDC (2010)
Jiming Liu, Michael B. Dillencourt, Lubomir F. Bic, Daniel L. Gillen, Arthur D. Lander
Distributed Individual-Based Simulation. Euro-Par (2009)
Koji Noguchi, Michael B. Dillencourt, Lubomir Bic
Efficient Global Pointers With Spontaneous Process Migration. PDP (2008)
Lei Pan, Jingling Xue, Ming Kin Lai, Michael B. Dillencourt, Lubomir F. Bic
Toward Automatic Data Distribution for Migrating Computations. ICPP (2007)
Michael B. Dillencourt, David Eppstein, Michael T. Goodrich
Choosing Colors for Geometric Graphs Via Color Space Embeddings. Graph Drawing (2006)
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 Trans. Inf. Syst. (2) (2006)
Michael B. Dillencourt, David Eppstein, Michael T. Goodrich
Choosing Colors for Geometric Graphs via Color Space Embeddings CoRR (2006)
Lei Pan, Ming Kin Lai, Michael B. Dillencourt, Lubomir F. Bic
Mobile Pipelines: Parallelizing Left-Looking Algorithms Using Navigational Programming. HiPC (2005)
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)
Hairong Kuang, Lubomir F. Bic, Michael B. Dillencourt
PODC: Paradigm-oriented distributed computing. J. Parallel Distributed Comput. 65 (4) (2005)
Lei Pan, Ming Kin Lai, Koji Noguchi, Javid J. Huseynov, Lubomir Bic, Michael B. Dillencourt
Distributed Parallel Computing Using Navigational Programming. Int. J. Parallel Program. 32 (1) (2004)
Hairong Kuang, Lubomir Bic, Michael B. Dillencourt
GIDM: Globally-Indexed Distributed Memory. FTDCS (2003)
Lei Pan, Lubomir Bic, Michael B. Dillencourt, Ming Kin Lai
From Distributed Sequential Computing to Distributed Parallel Computing. ICPP Workshops (2003)
Lei Pan, Lubomir Bic, Michael B. Dillencourt, Ming Kin Lai
Mobile Agents - The Right Vehicle for Distributed Sequential Computing. HiPC (2002)
Hairong Kuang, Lubomir Bic, Michael B. Dillencourt
Iterative Grid-Based Computing Using Mobile Agents. ICPP (2002)
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)
Munehiro Fukuda, Lubomir F. Bic, Michael B. Dillencourt, Fehmina Merchant
Messengers: Distributed Programming using Mobile Agents. Trans. SDPS 5 (4) (2001)
Eugene Gendelman, Lubomir Bic, Michael B. Dillencourt
Fast File Access for Fast Agents. Mobile Agents (2001)
Lei Pan, Lubomir Bic, Michael B. Dillencourt
Distributed Sequential Numerical Computing Using Mobile Agents: Moving Code to Data. ICPP (2001)
Eugene Gendelman, Lubomir Bic, Michael B. Dillencourt
Process Interconnection Structures in Dynamically Changing Topologies. HiPC (2000)
Hairong Kuang, Lubomir Bic, Michael B. Dillencourt
Paradigm-Oriented Distributed Computing using Mobile Agents. ICDCS (2000)
Michael B. Dillencourt, David Eppstein, Daniel S. Hirschberg
Geometric Thickness of Complete Graphs. J. Graph Algorithms Appl. 4 (3) (2000)
Katherine L. Morse, Lubomir Bic, Michael B. Dillencourt
Interest Management in Large-Scale Virtual Environments. Presence Teleoperators Virtual Environ. 9 (1) (2000)
Eugene Gendelman, Lubomir Bic, Michael B. Dillencourt
An Application-Transparent, Platform-Independent Approach to Rollback-Recovery for Mobile Agent Systems. ICDCS (2000)
Christian Wicke, Lubomir F. Bic, Michael B. Dillencourt
Compiling for fast state capture of mobile agents. PARCO (1999)
Hairong Kuang, Lubomir Bic, Michael B. Dillencourt, Adam C. Chang
PODC: Paradigm-Oriented Distributed Computing. FTDCS (1999)
Eugene Gendelman, Lubomir Bic, Michael B. Dillencourt
An Efficient Checkpointing Algorithm for Distributed Systems Implementing Reliable Communication Channels. SRDS (1999)
Munehiro Fukuda, Lubomir Bic, Michael B. Dillencourt, Jason M. Cahill
Messages versus Messengers in Distributed Programming. J. Parallel Distributed Comput. 57 (2) (1999)
Michael B. Dillencourt, David Eppstein, Daniel S. Hirschberg
Geometric Thickness of Complete Graphs CoRR (1999)
Fehmina Merchant, Lubomir Bic, Michael B. Dillencourt
Load Balancing in Individual-Based Spatial Applications. IEEE PACT (1998)
Christian Wicke, Lubomir Bic, Michael B. Dillencourt, Munehiro Fukuda
Automatic State Capture of Self-Migrating Computations in MESSENGERS. Mobile Agents (1998)
Michael B. Dillencourt, David Eppstein, Daniel S. Hirschberg
Geometric Thickness of Complete Graphs. Graph Drawing (1998)
Munehiro Fukuda, Lubomir Bic, Michael B. Dillencourt, Fehmina Merchant
Distributed Coordination with MESSENGERS. Sci. Comput. Program. 31 (2-3) (1998)
Munehiro Fukuda, Lubomir Bic, Michael B. Dillencourt
Performance of the MESSENGERS Autonomous-Objects-Based System. WWCA (1997)
Munehiro Fukuda, Lubomir Bic, Michael B. Dillencourt, Fehmina Merchant
A Hierarchical Mapping Scheme for Mobile Agent Systems. FTDCS (1997)
Tamal K. Dey, Michael B. Dillencourt, Subir Kumar Ghosh, Jason M. Cahill
Triangulating with High Connectivity. Comput. Geom. 8 (1997)
Munehiro Fukuda, Lubomir Bic, Michael B. Dillencourt, Fehmina Merchant
Messages versus Messengers in Distributed Programming. ICDCS (1997)
Lubomir Bic, Munehiro Fukuda, Michael B. Dillencourt
Distributed Computing Using Autonomous Objects. Computer 29 (8) (1996)
Michael B. Dillencourt
Finding Hamiltonian Cycles in Delaunay Triangulations Is NP-complete. Discret. Appl. Math. 64 (3) (1996)
Michael B. Dillencourt
Polyhedra of Small Order and Their Hamiltonian Properties. J. Comb. Theory, Ser. B 66 (1) (1996)
Munehiro Fukuda, Lubomir Bic, Michael B. Dillencourt, Fehmina Merchant
Intra- and Inter-Object Coordination with MESSENGERS. COORDINATION (1996)
Michael B. Dillencourt, Hanan Samet
Using Topological Sweep to Extract the Boundaries of Regions in Maps Represented by Region Quadtrees. Algorithmica 15 (1) (1996)
Michael B. Dillencourt, Warren D. Smith
Graph-theoretical conditions for inscribability and Delaunay realizability. Discret. Math. 161 (1-3) (1996)
Michael B. Dillencourt, Warren D. Smith
A linear-time algorithm for testing the inscribability of trivalent polyhedra. Int. J. Comput. Geom. Appl. 5 (1995)
Michael B. Dillencourt, Warren D. Smith
Graph-Theoretical Conditions for Inscribability and Delaunay Realizability. CCCG (1994)
Tamal K. Dey, Michael B. Dillencourt, Subir Kumar Ghosh
Triangulating with High Connectivity. CCCG (1994)
Michael B. Dillencourt, Warren D. Smith
A Simple Method for Resolving Degeneracies in Delaunay Triangulations. ICALP (1993)
Michael B. Dillencourt, David M. Mount, Alan Saalfeld
On the Maximum Number of Intersections of Two Polyhedra in 2 and 3 Dimensions. CCCG (1993)
Michael B. Dillencourt, David M. Mount, Nathan S. Netanyahu
A randomized algorithm for slope selection. Int. J. Comput. Geom. Appl. 2 (1) (1992)
Michael B. Dillencourt, Hanan Samet, Markku Tamminen
A General Approach to Connected-Component Labelling for Arbitrary Image Representations. J. ACM 39 (2) (1992)
Vitus J. Leung, Michael B. Dillencourt, Andrew L. Bliss
Graph Tool - A Tool for Interactive Design and Manipulation of Graphs and Graph Algorithms. Computational Support for Discrete Mathematics (1992)
Michael B. Dillencourt, Warren D. Smith
A Linear-Time Algorithm for Testing the Inscribability of Trivalent Polyhedra. SCG (1992)
Michael B. Dillencourt, Hanan Samet, Markku Tamminen
Corrigenda: 'A General Approach to Connected-Component Labelling for Arbitrary Image Representations'. J. ACM 39 (4) (1992)
Michael B. Dillencourt
An upper bound on the shortness exponent of 1-tough, maximal planar graphs. Discret. Math. 90 (1) (1991)
Michael B. Dillencourt
Realizability of Delaunay Triangulations. Inf. Process. Lett. 33 (6) (1990)
Michael B. Dillencourt
Hamiltonian cycles in planar triangulations with no separating triangles. J. Graph Theory 14 (1) (1990)
Michael B. Dillencourt
Toughness and Delaunay Triangulations. Discret. Comput. Geom. 5 (1990)
Robert E. Webber, Michael B. Dillencourt
Compressing quadtrees via common subtree merging. Pattern Recognit. Lett. 9 (3) (1989)
Michael B. Dillencourt
An upper bound on the shortness exponent of inscribable polytopes. J. Comb. Theory, Ser. B 46 (1) (1989)
Michael B. Dillencourt
Traveling Salesman Cycles are not Always Subgraphs of Delaunay Triangulations or of Minimum Weight Triangulations. Inf. Process. Lett. 24 (5) (1987)
Michael B. Dillencourt
Toughness and Delaunay Triangulations. SCG (1987)
Michael B. Dillencourt
A Non-Hamiltonian, Nondegenerate Delaunay Triangulation. Inf. Process. Lett. 25 (3) (1987)