The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Michael B. Dillencourt: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Fehmina Merchant, Lubomir Bic, Michael B. Dillencourt
    Load Balancing in Individual-Based Spatial Applications. [Citation Graph (0, 0)][DBLP]
    IEEE PACT, 1998, pp:350-357 [Conf]
  2. Tamal K. Dey, Michael B. Dillencourt, Subir Kumar Ghosh
    Triangulating with High Connectivity. [Citation Graph (0, 0)][DBLP]
    CCCG, 1994, pp:339-343 [Conf]
  3. Michael B. Dillencourt, David M. Mount, Alan Saalfeld
    On the Maximum Number of Intersections of Two Polyhedra in 2 and 3 Dimensions. [Citation Graph (0, 0)][DBLP]
    CCCG, 1993, pp:49-54 [Conf]
  4. Michael B. Dillencourt, Warren D. Smith
    Graph-Theoretical Conditions for Inscribability and Delaunay Realizability. [Citation Graph (0, 0)][DBLP]
    CCCG, 1994, pp:287-292 [Conf]
  5. Michael B. Dillencourt
    Toughness and Delaunay Triangulations. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1987, pp:186-194 [Conf]
  6. Michael B. Dillencourt, Warren D. Smith
    A Linear-Time Algorithm for Testing the Inscribability of Trivalent Polyhedra. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1992, pp:177-185 [Conf]
  7. Munehiro Fukuda, Lubomir Bic, Michael B. Dillencourt, Fehmina Merchant
    Intra- and Inter-Object Coordination with MESSENGERS. [Citation Graph (0, 0)][DBLP]
    COORDINATION, 1996, pp:179-196 [Conf]
  8. Munehiro Fukuda, Lubomir Bic, Michael B. Dillencourt, Fehmina Merchant
    A Hierarchical Mapping Scheme for Mobile Agent Systems. [Citation Graph (0, 0)][DBLP]
    FTDCS, 1997, pp:66-71 [Conf]
  9. Hairong Kuang, Lubomir Bic, Michael B. Dillencourt
    GIDM: Globally-Indexed Distributed Memory. [Citation Graph (0, 0)][DBLP]
    FTDCS, 2003, pp:108-114 [Conf]
  10. Hairong Kuang, Lubomir Bic, Michael B. Dillencourt, Adam C. Chang
    PODC: Paradigm-Oriented Distributed Computing. [Citation Graph (0, 0)][DBLP]
    FTDCS, 1999, pp:169-175 [Conf]
  11. Michael B. Dillencourt, David Eppstein, Daniel S. Hirschberg
    Geometric Thickness of Complete Graphs. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1998, pp:101-110 [Conf]
  12. Michael B. Dillencourt, David Eppstein, Michael T. Goodrich
    Choosing Colors for Geometric Graphs Via Color Space Embeddings. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2006, pp:294-305 [Conf]
  13. Eugene Gendelman, Lubomir Bic, Michael B. Dillencourt
    Process Interconnection Structures in Dynamically Changing Topologies. [Citation Graph (0, 0)][DBLP]
    HiPC, 2000, pp:405-414 [Conf]
  14. Lei Pan, Lubomir Bic, Michael B. Dillencourt, Ming Kin Lai
    Mobile Agents - The Right Vehicle for Distributed Sequential Computing. [Citation Graph (0, 0)][DBLP]
    HiPC, 2002, pp:575-586 [Conf]
  15. Lei Pan, Ming Kin Lai, Michael B. Dillencourt, Lubomir F. Bic
    Mobile Pipelines: Parallelizing Left-Looking Algorithms Using Navigational Programming. [Citation Graph (0, 0)][DBLP]
    HiPC, 2005, pp:201-212 [Conf]
  16. Michael B. Dillencourt, Warren D. Smith
    A Simple Method for Resolving Degeneracies in Delaunay Triangulations. [Citation Graph (0, 0)][DBLP]
    ICALP, 1993, pp:177-188 [Conf]
  17. Munehiro Fukuda, Lubomir Bic, Michael B. Dillencourt, Fehmina Merchant
    Messages versus Messengers in Distributed Programming. [Citation Graph (0, 0)][DBLP]
    ICDCS, 1997, pp:0-0 [Conf]
  18. Eugene Gendelman, Lubomir Bic, Michael B. Dillencourt
    An Application-Transparent, Platform-Independent Approach to Rollback-Recovery for Mobile Agent Systems. [Citation Graph (0, 0)][DBLP]
    ICDCS, 2000, pp:564-571 [Conf]
  19. Hairong Kuang, Lubomir Bic, Michael B. Dillencourt
    Paradigm-Oriented Distributed Computing using Mobile Agents. [Citation Graph (0, 0)][DBLP]
    ICDCS, 2000, pp:11-19 [Conf]
  20. Hairong Kuang, Lubomir Bic, Michael B. Dillencourt
    Iterative Grid-Based Computing Using Mobile Agents. [Citation Graph (0, 0)][DBLP]
    ICPP, 2002, pp:109-0 [Conf]
  21. Lei Pan, Lubomir Bic, Michael B. Dillencourt
    Distributed Sequential Numerical Computing Using Mobile Agents: Moving Code to Data. [Citation Graph (0, 0)][DBLP]
    ICPP, 2001, pp:77-86 [Conf]
  22. Lei Pan, Wenhui Zhang, Arthur Asuncion, Ming Kin Lai, Michael B. Dillencourt, Lubomir Bic
    Incremental Parallelization Using Navigational Programming: A Case Study. [Citation Graph (0, 0)][DBLP]
    ICPP, 2005, pp:611-620 [Conf]
  23. Lei Pan, Lubomir Bic, Michael B. Dillencourt, Ming Kin Lai
    From Distributed Sequential Computing to Distributed Parallel Computing. [Citation Graph (0, 0)][DBLP]
    ICPP Workshops, 2003, pp:255-262 [Conf]
  24. Eugene Gendelman, Lubomir Bic, Michael B. Dillencourt
    Fast File Access for Fast Agents. [Citation Graph (0, 0)][DBLP]
    Mobile Agents, 2001, pp:88-102 [Conf]
  25. Christian Wicke, Lubomir Bic, Michael B. Dillencourt, Munehiro Fukuda
    Automatic State Capture of Self-Migrating Computations in MESSENGERS. [Citation Graph (0, 0)][DBLP]
    Mobile Agents, 1998, pp:68-79 [Conf]
  26. Lei Pan, Lubomir Bic, Michael B. Dillencourt, Javid J. Huseynov, Ming Kin Lai
    Distributed Parallel Computing using Navigational Programming: Orchestrating Computations Around Data. [Citation Graph (0, 0)][DBLP]
    IASTED PDCS, 2002, pp:453-458 [Conf]
  27. Eugene Gendelman, Lubomir Bic, Michael B. Dillencourt
    An Efficient Checkpointing Algorithm for Distributed Systems Implementing Reliable Communication Channels. [Citation Graph (0, 0)][DBLP]
    Symposium on Reliable Distributed Systems, 1999, pp:290-291 [Conf]
  28. Munehiro Fukuda, Lubomir Bic, Michael B. Dillencourt
    Performance of the MESSENGERS Autonomous-Objects-Based System. [Citation Graph (0, 0)][DBLP]
    WWCA, 1997, pp:43-57 [Conf]
  29. Michael B. Dillencourt, Hanan Samet
    Using Topological Sweep to Extract the Boundaries of Regions in Maps Represented by Region Quadtrees. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1996, v:15, n:1, pp:82-102 [Journal]
  30. Tamal K. Dey, Michael B. Dillencourt, Subir Kumar Ghosh, Jason M. Cahill
    Triangulating with High Connectivity. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1997, v:8, n:, pp:39-56 [Journal]
  31. Lubomir Bic, Munehiro Fukuda, Michael B. Dillencourt
    Distributed Computing Using Autonomous Objects. [Citation Graph (0, 0)][DBLP]
    IEEE Computer, 1996, v:29, n:8, pp:55-61 [Journal]
  32. Michael B. Dillencourt, David Eppstein, Daniel S. Hirschberg
    Geometric Thickness of Complete Graphs [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  33. Michael B. Dillencourt
    Finding Hamiltonian Cycles in Delaunay Triangulations Is NP-complete. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1996, v:64, n:3, pp:207-217 [Journal]
  34. Michael B. Dillencourt
    Toughness and Delaunary Triangulations. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1990, v:5, n:, pp:575-601 [Journal]
  35. Michael B. Dillencourt, David M. Mount, Nathan S. Netanyahu
    A randomized algorithm for slope selection. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1992, v:2, n:1, pp:1-27 [Journal]
  36. Michael B. Dillencourt, Warren D. Smith
    A linear-time algorithm for testing the inscribability of trivalent polyhedra. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1995, v:5, n:, pp:21-36 [Journal]
  37. Lei Pan, Ming Kin Lai, Koji Noguchi, Javid J. Huseynov, Lubomir Bic, Michael B. Dillencourt
    Distributed Parallel Computing Using Navigational Programming. [Citation Graph (0, 0)][DBLP]
    International Journal of Parallel Programming, 2004, v:32, n:1, pp:1-37 [Journal]
  38. Michael B. Dillencourt
    Realizability of Delaunay Triangulations. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1990, v:33, n:6, pp:283-287 [Journal]
  39. Michael B. Dillencourt
    Traveling Salesman Cycles are not Always Subgraphs of Delaunay Triangulations or of Minimum Weight Triangulations. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1987, v:24, n:5, pp:339-342 [Journal]
  40. Michael B. Dillencourt
    A Non-Hamiltonian, Nondegenerate Delaunay Triangulation. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1987, v:25, n:3, pp:149-151 [Journal]
  41. Michael B. Dillencourt, Hanan Samet, Markku Tamminen
    A General Approach to Connected-Component Labelling for Arbitrary Image Representations. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1992, v:39, n:2, pp:253-280 [Journal]
  42. Michael B. Dillencourt, Hanan Samet, Markku Tamminen
    Corrigenda: 'A General Approach to Connected-Component Labelling for Arbitrary Image Representations'. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1992, v:39, n:4, pp:985-986 [Journal]
  43. Michael B. Dillencourt
    An upper bound on the shortness exponent of inscribable polytopes. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1989, v:46, n:1, pp:66-83 [Journal]
  44. Michael B. Dillencourt
    Polyhedra of Small Order and Their Hamiltonian Properties. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1996, v:66, n:1, pp:87-122 [Journal]
  45. Michael B. Dillencourt, David Eppstein, Daniel S. Hirschberg
    Geometric Thickness of Complete Graphs. [Citation Graph (0, 0)][DBLP]
    J. Graph Algorithms Appl., 2000, v:4, n:3, pp:5-17 [Journal]
  46. Munehiro Fukuda, Lubomir Bic, Michael B. Dillencourt, Jason M. Cahill
    Messages versus Messengers in Distributed Programming. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1999, v:57, n:2, pp:188-211 [Journal]
  47. Hairong Kuang, Lubomir F. Bic, Michael B. Dillencourt
    PODC: Paradigm-oriented distributed computing. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2005, v:65, n:4, pp:506-518 [Journal]
  48. Katherine L. Morse, Lubomir Bic, Michael B. Dillencourt
    Interest Management in Large-Scale Virtual Environments. [Citation Graph (0, 0)][DBLP]
    Presence, 2000, v:9, n:1, pp:52-68 [Journal]
  49. Munehiro Fukuda, Lubomir Bic, Michael B. Dillencourt, Fehmina Merchant
    Distributed Coordination with MESSENGERS. [Citation Graph (0, 0)][DBLP]
    Sci. Comput. Program., 1998, v:31, n:2-3, pp:291-311 [Journal]
  50. Lei Pan, Jingling Xue, Ming Kin Lai, Michael B. Dillencourt, Lubomir F. Bic
    Toward Automatic Data Distribution for Migrating Computations. [Citation Graph (0, 0)][DBLP]
    ICPP, 2007, pp:27- [Conf]
  51. Michael B. Dillencourt, David Eppstein, Michael T. Goodrich
    Choosing Colors for Geometric Graphs via Color Space Embeddings [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  52. Michael B. Dillencourt, Warren D. Smith
    Graph-theoretical conditions for inscribability and Delaunay realizability. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:161, n:1-3, pp:63-77 [Journal]
  53. Michael B. Dillencourt
    An upper bound on the shortness exponent of 1-tough, maximal planar graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:90, n:1, pp:93-97 [Journal]

  54. Distributed Individual-Based Simulation. [Citation Graph (, )][DBLP]


  55. Pretty Good Accuracy in Matrix Multiplication with GPUs. [Citation Graph (, )][DBLP]


  56. Efficient Global Pointers With Spontaneous Process Migration. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.005secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002