Michael B. Dillencourt

76 papers A* 1A 6B 6C 6Misc 3Journal 34Unranked 20

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