Michael B. Dillencourt

According to our database1, Michael B. Dillencourt authored at least 66 papers between 1987 and 2016.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

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

2015
Distributed power flow loss minimization control for future grid.
Int. J. Circuit Theory Appl., 2015

2014
Distributed flow optimization control for energy-harvesting wireless sensor networks.
Proceedings of the IEEE International Conference on Communications, 2014

2013
Distributed Real-Time Power Flow control with renewable integration.
Proceedings of the IEEE Fourth International Conference on Smart Grid Communications, 2013

Tie-set Based Fault Tolerance for autonomous recovery of double-link failures.
Proceedings of the 2013 IEEE Symposium on Computers and Communications, 2013

Improving numerical accuracy for non-negative matrix multiplication on GPUs using recursive algorithms.
Proceedings of the International Conference on Supercomputing, 2013

2012
Complete automation of future grid for optimal real-time distribution of renewables.
Proceedings of the IEEE Third International Conference on Smart Grid Communications, 2012

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

2011
Improving accuracy for matrix multiplications on GPUs.
Sci. Program., 2011

Improving the Accuracy of High Performance BLAS Implementations Using Adaptive Blocked Algorithms.
Proceedings of the 23rd International Symposium on Computer Architecture and High Performance Computing, 2011

2010
Pretty Good Accuracy in Matrix Multiplication with GPUs.
Proceedings of the Ninth International Symposium on Parallel and Distributed Computing, 2010

2009
Distributed Individual-Based Simulation.
Proceedings of the Euro-Par 2009 Parallel Processing, 2009

2008
Efficient Global Pointers With Spontaneous Process Migration.
Proceedings of the 16th Euromicro International Conference on Parallel, 2008

2007
Toward Automatic Data Distribution for Migrating Computations.
Proceedings of the 2007 International Conference on Parallel Processing (ICPP 2007), 2007

2006
Toward Incremental Parallelization Using Navigational Programming.
IEICE Trans. Inf. Syst., 2006

Choosing Colors for Geometric Graphs Via Color Space Embeddings.
Proceedings of the Graph Drawing, 14th International Symposium, GD 2006, Karlsruhe, 2006

2005
PODC: Paradigm-oriented distributed computing.
J. Parallel Distributed Comput., 2005

Incremental Parallelization Using Navigational Programming: A Case Study.
Proceedings of the 34th International Conference on Parallel Processing (ICPP 2005), 2005

Mobile Pipelines: Parallelizing Left-Looking Algorithms Using Navigational Programming.
Proceedings of the High Performance Computing, 2005

2004
Distributed Parallel Computing Using Navigational Programming.
Int. J. Parallel Program., 2004

2003
From Distributed Sequential Computing to Distributed Parallel Computing.
Proceedings of the 32nd International Conference on Parallel Processing Workshops (ICPP 2003 Workshops), 2003

GIDM: Globally-Indexed Distributed Memory.
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.
Proceedings of the International Conference on Parallel and Distributed Computing Systems, 2002

Iterative Grid-Based Computing Using Mobile Agents.
Proceedings of the 31st International Conference on Parallel Processing (ICPP 2002), 2002

Mobile Agents - The Right Vehicle for Distributed Sequential Computing.
Proceedings of the High Performance Computing, 2002

2001
Messengers: Distributed Programming using Mobile Agents.
Trans. SDPS, 2001

Fast File Access for Fast Agents.
Proceedings of the Mobile Agents, 5th International Conference, 2001

Distributed Sequential Numerical Computing Using Mobile Agents: Moving Code to Data.
Proceedings of the 2001 International Conference on Parallel Processing, 2001

2000
Interest Management in Large-Scale Virtual Environments.
Presence Teleoperators Virtual Environ., 2000

Geometric Thickness of Complete Graphs.
J. Graph Algorithms Appl., 2000

Paradigm-Oriented Distributed Computing using Mobile Agents.
Proceedings of the 20th International Conference on Distributed Computing Systems, 2000

An Application-Transparent, Platform-Independent Approach to Rollback-Recovery for Mobile Agent Systems.
Proceedings of the 20th International Conference on Distributed Computing Systems, 2000

Process Interconnection Structures in Dynamically Changing Topologies.
Proceedings of the High Performance Computing, 2000

1999
Messages versus Messengers in Distributed Programming.
J. Parallel Distributed Comput., 1999

An Efficient Checkpointing Algorithm for Distributed Systems Implementing Reliable Communication Channels.
Proceedings of the Eighteenth Symposium on Reliable Distributed Systems, 1999

Compiling for fast state capture of mobile agents.
Proceedings of the Parallel Computing: Fundamentals & Applications, 1999

PODC: Paradigm-Oriented Distributed Computing.
Proceedings of the 7th IEEE Workshop on Future Trends of Distributed Computer Systems (FTDCS '99), 1999

1998
Distributed Coordination with MESSENGERS.
Sci. Comput. Program., 1998

Automatic State Capture of Self-Migrating Computations in MESSENGERS.
Proceedings of the Mobile Agents, Second International Workshop, 1998

Load Balancing in Individual-Based Spatial Applications.
Proceedings of the 1998 International Conference on Parallel Architectures and Compilation Techniques, 1998

1997
Triangulating with High Connectivity.
Comput. Geom., 1997

Performance of the MESSENGERS Autonomous-Objects-Based System.
Proceedings of the Worldwide Computing and Its Applications, International Conference, 1997

Messages versus Messengers in Distributed Programming.
Proceedings of the 17th International Conference on Distributed Computing Systems, 1997

A Hierarchical Mapping Scheme for Mobile Agent Systems.
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.
J. Comb. Theory, Ser. B, 1996

Graph-theoretical conditions for inscribability and Delaunay realizability.
Discret. Math., 1996

Finding Hamiltonian Cycles in Delaunay Triangulations Is NP-complete.
Discret. Appl. Math., 1996

Distributed Computing Using Autonomous Objects.
Computer, 1996

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

Intra- and Inter-Object Coordination with MESSENGERS.
Proceedings of the Coordination Languages and Models, First International Conference, 1996

1995
A linear-time algorithm for testing the inscribability of trivalent polyhedra.
Int. J. Comput. Geom. Appl., 1995

1994
Triangulating with High Connectivity.
Proceedings of the 6th Canadian Conference on Computational Geometry, 1994

1993
A Simple Method for Resolving Degeneracies in Delaunay Triangulations.
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.
Proceedings of the 5th Canadian Conference on Computational Geometry, 1993

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

A General Approach to Connected-Component Labelling for Arbitrary Image Representations.
J. ACM, 1992

A randomized algorithm for slope selection.
Int. J. Comput. Geom. Appl., 1992

Graph Tool - A Tool for Interactive Design and Manipulation of Graphs and Graph Algorithms.
Proceedings of the Computational Support for Discrete Mathematics, 1992

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

1990
Hamiltonian cycles in planar triangulations with no separating triangles.
J. Graph Theory, 1990

Realizability of Delaunay Triangulations.
Inf. Process. Lett., 1990

Toughness and Delaunay Triangulations.
Discret. Comput. Geom., 1990

1989
Compressing quadtrees via common subtree merging.
Pattern Recognit. Lett., 1989

An upper bound on the shortness exponent of inscribable polytopes.
J. Comb. Theory, Ser. B, 1989

1987
A Non-Hamiltonian, Nondegenerate Delaunay Triangulation.
Inf. Process. Lett., 1987

Traveling Salesman Cycles are not Always Subgraphs of Delaunay Triangulations or of Minimum Weight Triangulations.
Inf. Process. Lett., 1987


  Loading...