default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael B. Dillencourt
Person information
- affiliation: University of California, Irvine, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j30]Michael B. Dillencourt, Michael T. Goodrich
, Michael Mitzenmacher:
Leveraging parameterized Chernoff bounds for simplified algorithm analyses. Inf. Process. Lett. 187: 106516 (2025)- 2023
- [j29]Michael B. Dillencourt, Michael T. Goodrich:
Simplified Chernoff bounds with powers-of-two probabilities. Inf. Process. Lett. 182: 106397 (2023) - [c42]Ramtin Afshar, Michael B. Dillencourt, Michael T. Goodrich, Evrim Ozel:
Noisy Sorting Without Searching: Data Oblivious Sorting with Comparison Errors. SEA 2023: 8:1-8:18
2010 – 2019
- 2016
- [i3]Md. Jawaherul Alam, Michael B. Dillencourt, Michael T. Goodrich:
Capturing Lombardi Flow in Orthogonal Drawings by Minimizing the Number of Segments. CoRR abs/1608.03943 (2016) - 2015
- [j28]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): 1209-1225 (2015) - 2014
- [c41]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: 4083-4088 - 2013
- [c40]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: 213-222 - [c39]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: 391-397 - [c38]Kiyoshi Nakayama, Changhong Zhao, Lubomir F. Bic, Michael B. Dillencourt, Jack Brouwer:
Distributed Real-Time Power Flow control with renewable integration. SmartGridComm 2013: 516-521 - 2012
- [c37]Wenhui Zhang, Lei Pan, Qinghong Shang, Lubomir F. Bic, Michael B. Dillencourt:
Incremental Parallelization with Migration. ISPA 2012: 223-230 - [c36]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: 418-423 - 2011
- [j27]Matthew Badin, Lubomir Bic, Michael B. Dillencourt, Alexandru Nicolau:
Improving accuracy for matrix multiplications on GPUs. Sci. Program. 19(1): 3-11 (2011) - [c35]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 - 2010
- [c34]Matthew Badin, Lubomir Bic, Michael B. Dillencourt, Alexandru Nicolau:
Pretty Good Accuracy in Matrix Multiplication with GPUs. ISPDC 2010: 49-55
2000 – 2009
- 2009
- [c33]Jiming Liu, Michael B. Dillencourt, Lubomir F. Bic, Daniel L. Gillen, Arthur D. Lander:
Distributed Individual-Based Simulation. Euro-Par 2009: 590-601 - 2008
- [c32]Koji Noguchi, Michael B. Dillencourt, Lubomir Bic:
Efficient Global Pointers With Spontaneous Process Migration. PDP 2008: 87-94 - 2007
- [c31]Lei Pan, Jingling Xue, Ming Kin Lai, Michael B. Dillencourt, Lubomir F. Bic:
Toward Automatic Data Distribution for Migrating Computations. ICPP 2007: 27 - 2006
- [j26]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. 89-D(2): 390-398 (2006) - [c30]Michael B. Dillencourt, David Eppstein, Michael T. Goodrich:
Choosing Colors for Geometric Graphs Via Color Space Embeddings. GD 2006: 294-305 - [i2]Michael B. Dillencourt, David Eppstein, Michael T. Goodrich:
Choosing Colors for Geometric Graphs via Color Space Embeddings. CoRR abs/cs/0609033 (2006) - 2005
- [j25]Hairong Kuang, Lubomir F. Bic, Michael B. Dillencourt:
PODC: Paradigm-oriented distributed computing. J. Parallel Distributed Comput. 65(4): 506-518 (2005) - [c29]Lei Pan, Ming Kin Lai, Michael B. Dillencourt, Lubomir F. Bic:
Mobile Pipelines: Parallelizing Left-Looking Algorithms Using Navigational Programming. HiPC 2005: 201-212 - [c28]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 - 2004
- [j24]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): 1-37 (2004) - 2003
- [c27]Hairong Kuang, Lubomir Bic, Michael B. Dillencourt:
GIDM: Globally-Indexed Distributed Memory. FTDCS 2003: 108-114 - [c26]Lei Pan, Lubomir Bic, Michael B. Dillencourt, Ming Kin Lai:
From Distributed Sequential Computing to Distributed Parallel Computing. ICPP Workshops 2003: 255-262 - 2002
- [c25]Lei Pan, Lubomir Bic, Michael B. Dillencourt, Ming Kin Lai:
Mobile Agents - The Right Vehicle for Distributed Sequential Computing. HiPC 2002: 575-586 - [c24]Hairong Kuang, Lubomir Bic, Michael B. Dillencourt:
Iterative Grid-Based Computing Using Mobile Agents. ICPP 2002: 109-120 - [c23]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 - 2001
- [j23]Munehiro Fukuda, Lubomir F. Bic, Michael B. Dillencourt, Fehmina Merchant:
Messengers: Distributed Programming using Mobile Agents. Trans. SDPS 5(4): 95-112 (2001) - [c22]Lei Pan, Lubomir Bic, Michael B. Dillencourt:
Distributed Sequential Numerical Computing Using Mobile Agents: Moving Code to Data. ICPP 2001: 77-86 - [c21]Eugene Gendelman, Lubomir Bic, Michael B. Dillencourt:
Fast File Access for Fast Agents. Mobile Agents 2001: 88-102 - 2000
- [j22]Michael B. Dillencourt, David Eppstein, Daniel S. Hirschberg:
Geometric Thickness of Complete Graphs. J. Graph Algorithms Appl. 4(3): 5-17 (2000) - [j21]Katherine L. Morse, Lubomir Bic, Michael B. Dillencourt:
Interest Management in Large-Scale Virtual Environments. Presence Teleoperators Virtual Environ. 9(1): 52-68 (2000) - [c20]Eugene Gendelman, Lubomir Bic, Michael B. Dillencourt:
Process Interconnection Structures in Dynamically Changing Topologies. HiPC 2000: 405-414 - [c19]Hairong Kuang, Lubomir Bic, Michael B. Dillencourt:
Paradigm-Oriented Distributed Computing using Mobile Agents. ICDCS 2000: 11-19 - [c18]Eugene Gendelman, Lubomir Bic, Michael B. Dillencourt:
An Application-Transparent, Platform-Independent Approach to Rollback-Recovery for Mobile Agent Systems. ICDCS 2000: 564-571
1990 – 1999
- 1999
- [j20]Munehiro Fukuda, Lubomir Bic, Michael B. Dillencourt, Jason M. Cahill:
Messages versus Messengers in Distributed Programming. J. Parallel Distributed Comput. 57(2): 188-211 (1999) - [c17]Hairong Kuang, Lubomir Bic, Michael B. Dillencourt, Adam C. Chang:
PODC: Paradigm-Oriented Distributed Computing. FTDCS 1999: 169-175 - [c16]Christian Wicke, Lubomir F. Bic, Michael B. Dillencourt:
Compiling for fast state capture of mobile agents. PARCO 1999: 714-721 - [c15]Eugene Gendelman, Lubomir Bic, Michael B. Dillencourt:
An Efficient Checkpointing Algorithm for Distributed Systems Implementing Reliable Communication Channels. SRDS 1999: 290-291 - [i1]Michael B. Dillencourt, David Eppstein, Daniel S. Hirschberg:
Geometric Thickness of Complete Graphs. CoRR math.CO/9910185 (1999) - 1998
- [j19]Munehiro Fukuda, Lubomir Bic, Michael B. Dillencourt, Fehmina Merchant:
Distributed Coordination with MESSENGERS. Sci. Comput. Program. 31(2-3): 291-311 (1998) - [c14]Fehmina Merchant, Lubomir Bic, Michael B. Dillencourt:
Load Balancing in Individual-Based Spatial Applications. IEEE PACT 1998: 350-357 - [c13]Michael B. Dillencourt, David Eppstein, Daniel S. Hirschberg:
Geometric Thickness of Complete Graphs. GD 1998: 101-110 - [c12]Christian Wicke, Lubomir Bic, Michael B. Dillencourt, Munehiro Fukuda:
Automatic State Capture of Self-Migrating Computations in MESSENGERS. Mobile Agents 1998: 68-79 - 1997
- [j18]Tamal K. Dey, Michael B. Dillencourt, Subir Kumar Ghosh, Jason M. Cahill:
Triangulating with High Connectivity. Comput. Geom. 8: 39-56 (1997) - [c11]Munehiro Fukuda, Lubomir Bic, Michael B. Dillencourt, Fehmina Merchant:
A Hierarchical Mapping Scheme for Mobile Agent Systems. FTDCS 1997: 66-71 - [c10]Munehiro Fukuda, Lubomir Bic, Michael B. Dillencourt, Fehmina Merchant:
Messages versus Messengers in Distributed Programming. ICDCS 1997: 347-354 - [c9]Munehiro Fukuda, Lubomir Bic, Michael B. Dillencourt:
Performance of the MESSENGERS Autonomous-Objects-Based System. WWCA 1997: 43-57 - 1996
- [j17]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) - [j16]Lubomir Bic, Munehiro Fukuda, Michael B. Dillencourt:
Distributed Computing Using Autonomous Objects. Computer 29(8): 55-61 (1996) - [j15]Michael B. Dillencourt:
Finding Hamiltonian Cycles in Delaunay Triangulations Is NP-complete. Discret. Appl. Math. 64(3): 207-217 (1996) - [j14]Michael B. Dillencourt, Warren D. Smith:
Graph-theoretical conditions for inscribability and Delaunay realizability. Discret. Math. 161(1-3): 63-77 (1996) - [j13]Michael B. Dillencourt:
Polyhedra of Small Order and Their Hamiltonian Properties. J. Comb. Theory B 66(1): 87-122 (1996) - [c8]Munehiro Fukuda, Lubomir Bic, Michael B. Dillencourt, Fehmina Merchant:
Intra- and Inter-Object Coordination with MESSENGERS. COORDINATION 1996: 179-196 - 1995
- [j12]Michael B. Dillencourt, Warren D. Smith:
A linear-time algorithm for testing the inscribability of trivalent polyhedra. Int. J. Comput. Geom. Appl. 5: 21-36 (1995) - 1994
- [c7]Michael B. Dillencourt, Warren D. Smith:
Graph-Theoretical Conditions for Inscribability and Delaunay Realizability. CCCG 1994: 287-292 - [c6]Tamal K. Dey, Michael B. Dillencourt, Subir Kumar Ghosh:
Triangulating with High Connectivity. CCCG 1994: 339-343 - 1993
- [c5]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 - [c4]Michael B. Dillencourt, Warren D. Smith:
A Simple Method for Resolving Degeneracies in Delaunay Triangulations. ICALP 1993: 177-188 - 1992
- [j11]Michael B. Dillencourt, David M. Mount, Nathan S. Netanyahu:
A randomized algorithm for slope selection. Int. J. Comput. Geom. Appl. 2(1): 1-27 (1992) - [j10]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) - [j9]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) - [c3]Michael B. Dillencourt, Warren D. Smith:
A Linear-Time Algorithm for Testing the Inscribability of Trivalent Polyhedra. SCG 1992: 177-185 - [c2]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: 269-278 - 1991
- [j8]Michael B. Dillencourt:
An upper bound on the shortness exponent of 1-tough, maximal planar graphs. Discret. Math. 90(1): 93-97 (1991) - 1990
- [j7]Michael B. Dillencourt:
Toughness and Delaunay Triangulations. Discret. Comput. Geom. 5: 575-601 (1990) - [j6]Michael B. Dillencourt:
Realizability of Delaunay Triangulations. Inf. Process. Lett. 33(6): 283-287 (1990) - [j5]Michael B. Dillencourt:
Hamiltonian cycles in planar triangulations with no separating triangles. J. Graph Theory 14(1): 31-49 (1990)
1980 – 1989
- 1989
- [j4]Michael B. Dillencourt:
An upper bound on the shortness exponent of inscribable polytopes. J. Comb. Theory B 46(1): 66-83 (1989) - [j3]Robert E. Webber, Michael B. Dillencourt:
Compressing quadtrees via common subtree merging. Pattern Recognit. Lett. 9(3): 193-200 (1989) - 1987
- [j2]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) - [j1]Michael B. Dillencourt:
A Non-Hamiltonian, Nondegenerate Delaunay Triangulation. Inf. Process. Lett. 25(3): 149-151 (1987) - [c1]Michael B. Dillencourt:
Toughness and Delaunay Triangulations. SCG 1987: 186-194
Coauthor Index
aka: Lubomir Bic
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-23 21:27 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
