The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Masafumi Yamashita: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Toshio Nakata, Hiroshi Imahayashi, Masafumi Yamashita
    Probabilistic Local Majority Voting for the Agreement Problem on Finite Graphs. [Citation Graph (0, 0)][DBLP]
    COCOON, 1999, pp:330-338 [Conf]
  2. Masafumi Yamashita, Hideki Umemoto, Ichiro Suzuki, Tsunehiko Kameda
    Searching for Mobile Intruders in a Polygonal Region by a Group of Mobile Searchers (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1997, pp:448-450 [Conf]
  3. Yuichi Asahiro, Hajime Asama, Satoshi Fujita, Ichiro Suzuki, Masafumi Yamashita
    Distributed Algorithms for Carrying a Ladder by Omnidirectional Robots in Near Optimal Time. [Citation Graph (0, 0)][DBLP]
    Sensor Based Intelligent Robots, 1998, pp:240-254 [Conf]
  4. Ichiro Suzuki, Masafumi Yamashita
    Agreement on a Common X - Y Coordinate System by a Group of Mobile Robots. [Citation Graph (0, 0)][DBLP]
    Intelligent Robots, 1996, pp:305-321 [Conf]
  5. Yuichi Asahiro, Eric Chung-Hui Chang, Amol Dattatraya Mali, Syunsuke Nagafuji, Ichiro Suzuki, Masafumi Yamashita
    Distributed Motion Generation for Two Omni-Directional Robots Carrying Ladder. [Citation Graph (0, 0)][DBLP]
    DARS, 2000, pp:427-436 [Conf]
  6. Suguru Kawashimo, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita
    DNA Sequence Design by Dynamic Neighborhood Searches. [Citation Graph (0, 0)][DBLP]
    DNA, 2006, pp:157-171 [Conf]
  7. Masashi Shiozaki, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita
    A Probabilistic Model of the DNA Conformational Change. [Citation Graph (0, 0)][DBLP]
    DNA, 2006, pp:274-285 [Conf]
  8. Tsutomu Takeda, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita
    A Local Search Based Barrier Height Estimation Algorithm for DNA Molecular Transitions. [Citation Graph (0, 0)][DBLP]
    DNA, 2005, pp:359-370 [Conf]
  9. Hajime Miura, Masaharu Imai, Masafumi Yamashita, Toshihide Ibaraki
    Implementation of Parallel Prolog on Tree Machines. [Citation Graph (0, 0)][DBLP]
    FJCC, 1986, pp:287-296 [Conf]
  10. Satoshi Ikeda, Izumi Kubo, Norihiro Okumoto, Masafumi Yamashita
    Impact of Local Topological Information on Random Walks on Finite Graphs. [Citation Graph (0, 0)][DBLP]
    ICALP, 2003, pp:1054-1067 [Conf]
  11. Yuichi Asahiro, Eric Chung-Hui Chang, Amol Dattatraya Mali, Ichiro Suzuki, Masafumi Yamashita
    A Distributed Ladder Transportation Algorithm for Two Robots in a Corridor. [Citation Graph (0, 0)][DBLP]
    ICRA, 2001, pp:3016-3021 [Conf]
  12. Adrian Dumitrescu, Ichiro Suzuki, Masafumi Yamashita
    High Speed Formations of Reconfigurable Modular Robotic Systems. [Citation Graph (0, 0)][DBLP]
    ICRA, 2002, pp:123-128 [Conf]
  13. Satoshi Fujita, Masafumi Yamashita, Tadashi Ae
    Distributed k-Mutual Exclusion Problem and k-Coteries. [Citation Graph (0, 0)][DBLP]
    ISA, 1991, pp:22-31 [Conf]
  14. Satoshi Fujita, Tiko Kameda, Masafumi Yamashita
    A Resource Assignment Problem on Graphs. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1995, pp:418-427 [Conf]
  15. Satoshi Fujita, Masafumi Yamashita, Tadashi Ae
    Optimal Group Gossiping in Hypercubes Under Wormhole Routing Model. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1993, pp:277-286 [Conf]
  16. Satoshi Fujita, Reiji Aibara, Masafumi Yamashita, Tadashi Ae
    A Template Matching Algorithm Using Optically-Connected 3-D VLSI Architecture. [Citation Graph (0, 0)][DBLP]
    ISCA, 1987, pp:64-70 [Conf]
  17. Yuichi Kurumida, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita
    Forest Search: A Paradigm for Faster Exploration of Scale-Free Networks. [Citation Graph (0, 0)][DBLP]
    ISPA, 2006, pp:39-50 [Conf]
  18. Yoshiyuki Hayakawa, Satoshi Fujita, Masafumi Yamashita
    A Decentralized Scheme for Multi-Node Broadcasting on Hypercubes. [Citation Graph (0, 0)][DBLP]
    ISPAN, 1997, pp:487-493 [Conf]
  19. Satoshi Fujita, Reiji Aibara, Masafumi Yamashita, Tadashi Ae
    A Parallel Processing Architecture for Real-Time Production Systems with Truth Maintenance. [Citation Graph (0, 0)][DBLP]
    IWDM, 1989, pp:331-344 [Conf]
  20. Hirotsugu Kakugawa, Masafumi Yamashita
    A Dynamic Reconfiguration Tolerant Self-stabilizing Token Circulation Algorithm in Ad-Hoc Networks. [Citation Graph (0, 0)][DBLP]
    OPODIS, 2004, pp:256-266 [Conf]
  21. Samia Souissi, Xavier Défago, Masafumi Yamashita
    Gathering Asynchronous Mobile Robots with Inaccurate Compasses. [Citation Graph (0, 0)][DBLP]
    OPODIS, 2006, pp:333-349 [Conf]
  22. Satoshi Fujita, Masafumi Yamashita, Tadashi Ae
    Search Level Parallel Processing of Production Systems. [Citation Graph (0, 0)][DBLP]
    PARLE (2), 1991, pp:471-488 [Conf]
  23. Takashi Harada, Masafumi Yamashita
    A Coterie Join Operation and Tree Structured k-Coteries. [Citation Graph (0, 0)][DBLP]
    PDPTA, 1999, pp:327-333 [Conf]
  24. Sung-Hoon Park, Masafumi Yamashita
    Leader Election in Asynchronous Distributed Systems with Unreliable Failure Detectors. [Citation Graph (0, 0)][DBLP]
    PDPTA, 2004, pp:687-693 [Conf]
  25. Masafumi Yamashita, Tiko Kameda
    Computing on an Anonymous Network. [Citation Graph (0, 0)][DBLP]
    PODC, 1988, pp:117-130 [Conf]
  26. Yuichi Handa, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita
    Neighborhood Composition: A Parallelization of Local Search Algorithms. [Citation Graph (0, 0)][DBLP]
    PVM/MPI, 2004, pp:155-163 [Conf]
  27. Tadashi Ae, Masafumi Yamashita, Hiroshi Matsumoto
    A Response Time Estimation of Real-Time Networks. [Citation Graph (0, 0)][DBLP]
    IEEE Real-Time Systems Symposium, 1987, pp:198-207 [Conf]
  28. Toshio Nakata, Masafumi Yamashita
    Some Upper Bounds on Expected Agreement Time of a Probabilistic Local Majority Polling Game. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2001, pp:293-304 [Conf]
  29. Ichiro Suzuki, Masafumi Yamashita
    Distributed Anonymous Mobile Robots. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 1996, pp:313-330 [Conf]
  30. Hirotsugu Kakugawa, Masafumi Yamashita
    Self-Stabilizing Local Mutual Exclusion on Networks in which Process Identifiers are not Distinct. [Citation Graph (0, 0)][DBLP]
    SRDS, 2002, pp:202-211 [Conf]
  31. Kazuhisa Makino, Masafumi Yamashita, Tiko Kameda
    Max- and Min-Neighborhood Monopolies. [Citation Graph (0, 0)][DBLP]
    SWAT, 2000, pp:513-526 [Conf]
  32. Ei Ando, Masafumi Yamashita, Toshio Nakata, Yusuke Matsunaga
    The statistical longest path problem and its application to delay analysis of logical circuits. [Citation Graph (0, 0)][DBLP]
    Timing Issues in the Specification and Synthesis of Digital Systems, 2002, pp:134-139 [Conf]
  33. Satoshi Ikeda, Izumi Kubo, Masafumi Yamashita
    Reducing the Hitting and the Cover Times of Random Walks on Finite Graphs by Local Topological Information. [Citation Graph (0, 0)][DBLP]
    VLSI, 2003, pp:203-207 [Conf]
  34. Satoshi Fujita, Masafumi Yamashita
    Maintaining a Dynamic Set of Processors in a Distributed System. [Citation Graph (0, 0)][DBLP]
    WDAG, 1996, pp:220-233 [Conf]
  35. Masafumi Yamashita, Tiko Kameda
    Electing a Leader when Processor Identity Numbers are not Distinct (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WDAG, 1989, pp:303-314 [Conf]
  36. Shay Kutten, Hirotaka Ono, David Peleg, Kunihiko Sadakane, Masafumi Yamashita
    Energy-Optimal Online Algorithms for Broadcasting in Wireless Networks. [Citation Graph (0, 0)][DBLP]
    WONS, 2005, pp:125-130 [Conf]
  37. Kazuhisa Makino, Masafumi Yamashita, Tiko Kameda
    Max- and Min-Neighborhood Monopolies. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2002, v:34, n:3, pp:240-260 [Journal]
  38. Masafumi Yamashita, Hideki Umemoto, Ichiro Suzuki, Tsunehiko Kameda
    Searching for Mobile Intruders in a Polygonal Region by a Group of Mobile Searchers. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2001, v:31, n:2, pp:208-236 [Journal]
  39. Yuichi Asahiro, Takashi Horiyama, Kazuhisa Makino, Hirotaka Ono, Toshinori Sakuma, Masafumi Yamashita
    How to collect balls moving in the Euclidean plane. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2006, v:154, n:16, pp:2247-2262 [Journal]
  40. Yuichi Asahiro, Takashi Horiyama, Kazuhisa Makino, Hirotaka Ono, Toshinori Sakuma, Masafumi Yamashita
    How to Collect Balls Moving in the Euclidean Plane. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2004, v:91, n:, pp:229-245 [Journal]
  41. D. Crass, Ichiro Suzuki, Masafumi Yamashita
    Searching for a mobile intruder in a corridor: the open edge variant of the polygon search problem. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1995, v:5, n:4, pp:397-412 [Journal]
  42. Ichiro Suzuki, Yuichi Tazoe, Masafumi Yamashita, Tiko Kameda
    Searching a Polygonal Region from the Boundary. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2001, v:11, n:5, pp:529-553 [Journal]
  43. Ichiro Suzuki, Masafumi Yamashita
    Designing multi-link robot arms in a convex polygon. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1996, v:6, n:4, pp:461-486 [Journal]
  44. Hirotatsu Sakomoto, Yoshihiro Okada, Eisuke Itoh, Masafumi Yamashita
    Component-Based Audio-Video Communication Tool for Network 3D Games. [Citation Graph (0, 0)][DBLP]
    Int. J. Intell. Games & Simulation, 2002, v:1, n:1, pp:33-40 [Journal]
  45. Adrian Dumitrescu, Ichiro Suzuki, Masafumi Yamashita
    Formations for Fast Locomotion of Metamorphic Robotic Systems. [Citation Graph (0, 0)][DBLP]
    I. J. Robotic Res., 2004, v:23, n:6, pp:583-593 [Journal]
  46. Satoshi Fujita, Masafumi Yamashita
    Fast Gossiping on Square Mesh Computers. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1993, v:48, n:3, pp:127-130 [Journal]
  47. Hirotsugu Kakugawa, Satoshi Fujita, Masafumi Yamashita, Tadashi Ae
    A Distributed k-Mutual Exclusion Algorithm Using k-Coterie. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1994, v:49, n:4, pp:213-218 [Journal]
  48. Ichiro Suzuki, Masafumi Yamashita, Hideki Umemoto, Tsunehiko Kameda
    Bushiness and a Tight Worst-Case Upper Bound on the Search Number of a Simple Polygon. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1998, v:66, n:1, pp:49-52 [Journal]
  49. Masafumi Yamashita, Ichiro Suzuki, Tiko Kameda
    Searching a polygonal region by a group of stationary k-searchers. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2004, v:92, n:1, pp:1-8 [Journal]
  50. Satoshi Fujita, Masafumi Yamashita
    A Nonoblivious Bus Access Scheme Yields an Optimal Partial Sorting Algorithm. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1996, v:34, n:1, pp:111-116 [Journal]
  51. Hirotsugu Kakugawa, Masafumi Yamashita
    Uniform and Self-Stabilizing Fair Mutual Exclusion on Unidirectional Rings under Unfair Distributed Daemon. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2002, v:62, n:5, pp:885-898 [Journal]
  52. Masafumi Yamashita, Tiko Kameda
    Computing Functions on Asynchronous Anonymous Networks. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1996, v:29, n:4, pp:331-356 [Journal]
  53. Toshio Nakata, Hiroshi Imahayashi, Masafumi Yamashita
    A probabilistic local majority polling game on weighted directed graphs with an application to the distributed agreement problem. [Citation Graph (0, 0)][DBLP]
    Networks, 2000, v:35, n:4, pp:266-273 [Journal]
  54. Masafumi Yamashita, Tsunehiko Kameda
    Modeling K-coteries by well-covered graphs. [Citation Graph (0, 0)][DBLP]
    Networks, 1999, v:34, n:3, pp:221-228 [Journal]
  55. Satoshi Fujita, Masafumi Yamashita
    Optimal Gossiping in Mesh-Bus Computers. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1993, v:3, n:, pp:357-361 [Journal]
  56. Jun Kiniwa, Masafumi Yamashita
    A Randomized 1-latent, Time-adaptive and Safe Self-stabilizing Mutual Exclusion Protocol. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 2006, v:16, n:1, pp:53-62 [Journal]
  57. Masafumi Yamashita
    Parallel and sequential transformations on digital images. [Citation Graph (0, 0)][DBLP]
    Pattern Recognition, 1985, v:18, n:1, pp:31-41 [Journal]
  58. Masafumi Yamashita, Namio Honda
    Distance functions defined by variable neighborhood sequences. [Citation Graph (0, 0)][DBLP]
    Pattern Recognition, 1984, v:17, n:5, pp:509-513 [Journal]
  59. Masafumi Yamashita, Toshihide Ibaraki
    Distances defined by neighborhood sequences. [Citation Graph (0, 0)][DBLP]
    Pattern Recognition, 1986, v:19, n:3, pp:237-246 [Journal]
  60. Satoshi Fujita, Masafumi Yamashita
    Optimal Group Gossiping in Hypercubes under a Circuit-Switching Model. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1996, v:25, n:5, pp:1045-1060 [Journal]
  61. Kazuo Sugihara, Ichiro Suzuki, Masafumi Yamashita
    The Searchlight Scheduling Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1990, v:19, n:6, pp:1024-1040 [Journal]
  62. Ichiro Suzuki, Masafumi Yamashita
    Searching for a Mobile Intruder in a Polygonal Region. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1992, v:21, n:5, pp:863-888 [Journal]
  63. Ichiro Suzuki, Masafumi Yamashita
    Distributed Anonymous Mobile Robots: Formation of Geometric Patterns. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:28, n:4, pp:1347-1363 [Journal]
  64. Satoshi Fujita, Masafumi Yamashita, Tiko Kameda
    A Study on r-Configurations - A Resource Assignment Problem on Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2000, v:13, n:2, pp:227-254 [Journal]
  65. Satoshi Fujita, Masafumi Yamashita
    Fast Gossiping on Mesh-Bus Computers. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1996, v:45, n:11, pp:1326-1330 [Journal]
  66. Takashi Harada, Masafumi Yamashita
    Improving the Availability of Mutual Exclusion Systems on Incomplete Networks. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1999, v:48, n:7, pp:744-747 [Journal]
  67. Hirotsugu Kakugawa, Satoshi Fujita, Masafumi Yamashita, Tadashi Ae
    Availability of k-Coterie. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1993, v:42, n:5, pp:553-558 [Journal]
  68. Jianan Li, Ichiro Suzuki, Masafumi Yamashita
    Fair Petri Nets and Structural Induction for Rings of Processes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:135, n:2, pp:377-404 [Journal]
  69. Takashi Harada, Masafumi Yamashita
    Coterie Join Operation and Tree Structured k-Coteries. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 2001, v:12, n:9, pp:865-874 [Journal]
  70. Takashi Harada, Masafumi Yamashita
    k-Coteries for Tolerating Network 2-Partition. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 2004, v:15, n:7, pp:666-672 [Journal]
  71. Takashi Harada, Masafumi Yamashita
    Transversal Merge Operation: A Nondominated Coterie Construction Method for Distributed Mutual Exclusion. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 2005, v:16, n:2, pp:183-192 [Journal]
  72. Takashi Harada, Masafumi Yamashita
    Nondominated Coteries on Graphs. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1997, v:8, n:6, pp:667-672 [Journal]
  73. Satoshi Ikeda, Izumi Kubo, Norihiro Okumoto, Masafumi Yamashita
    Fair Circulation of a Token. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 2002, v:13, n:4, pp:367-372 [Journal]
  74. Hirotsugu Kakugawa, Masafumi Yamashita
    Uniform and Self-Stabilizing Token Rings Allowing Unfair Daemon. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1997, v:8, n:2, pp:154-163 [Journal]
  75. Narutoshi Umemoto, Hirotsugu Kakugawa, Masafumi Yamashita
    A Self-Stabilizing Ring Orientation Algorithm With a Smaller Number of Processor States. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1998, v:9, n:6, pp:579-584 [Journal]
  76. Masafumi Yamashita, Tsunehiko Kameda
    Computing on Anonymous Networks: Part I-Characterizing the Solvable Cases. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1996, v:7, n:1, pp:69-89 [Journal]
  77. Masafumi Yamashita, Tsunehiko Kameda
    Computing on Anonymous Networks: Part II-Decision and Membership Problems. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1996, v:7, n:1, pp:90-96 [Journal]
  78. Masafumi Yamashita, Tsunehiko Kameda
    Leader Election Problem on Networks in which Processor Identity Numbers Are Not Distinct. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1999, v:10, n:9, pp:878-887 [Journal]
  79. Jianan Li, Ichiro Suzuki, Masafumi Yamashita
    A New Structural Induction Theorem for Rings of Temporal Petri Nets. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Software Eng., 1994, v:20, n:2, pp:115-126 [Journal]
  80. Tsunehiko Kameda, John Z. Zhang, Masafumi Yamashita
    Characterization of Polygons Searchable by a Boundary 1-Searcher. [Citation Graph (0, 0)][DBLP]
    CCCG, 2006, pp:- [Conf]
  81. Shantanu Das, Paola Flocchini, Nicola Santoro, Masafumi Yamashita
    Fault-Tolerant Simulation of Message-Passing Algorithms by Mobile Agents. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2007, pp:289-303 [Conf]
  82. Samia Souissi, Xavier Défago, Masafumi Yamashita
    Using Eventually Consistent Compasses to Gather Oblivious Mobile Robots with Limited Visibility. [Citation Graph (0, 0)][DBLP]
    SSS, 2006, pp:484-500 [Conf]
  83. Masafumi Yamashita
    Robots and Molecules. [Citation Graph (0, 0)][DBLP]
    SSS, 2007, pp:3- [Conf]
  84. Ichiro Suzuki, Masafumi Yamashita
    Erratum: Distributed Anonymous Mobile Robots: Formation of Geometric Patterns. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2006, v:36, n:1, pp:279-280 [Journal]

  85. Speeding Up Local-Search Type Algorithms for Designing DNA Sequences under Thermodynamical Constraints. [Citation Graph (, )][DBLP]


  86. Dynamic Neighborhood Searches for Thermodynamically Designing DNA Sequence. [Citation Graph (, )][DBLP]


  87. Weak vs. Self vs. Probabilistic Stabilization. [Citation Graph (, )][DBLP]


  88. The space complexity of the leader election in anonymous networks. [Citation Graph (, )][DBLP]


  89. The Balanced Edge Cover Problem. [Citation Graph (, )][DBLP]


  90. A Self-stabilizing Marching Algorithm for a Group of Oblivious Robots. [Citation Graph (, )][DBLP]


  91. On the computational power of oblivious robots: forming a series of geometric patterns. [Citation Graph (, )][DBLP]


  92. A Generic Algorithm for Approximately Solving Stochastic Graph Optimization Problems. [Citation Graph (, )][DBLP]


  93. How to Design a Linear Cover Time Random Walk on a Finite Graph. [Citation Graph (, )][DBLP]


  94. Computing the Exact Distribution Function of the Stochastic Longest Path Length in a DAG. [Citation Graph (, )][DBLP]


  95. A generic search strategy for large-scale real-world networks. [Citation Graph (, )][DBLP]


  96. Gathering two stateless mobile robots using very inaccurate compasses in finite time. [Citation Graph (, )][DBLP]


  97. Weak vs. Self vs. Probabilistic Stabilization [Citation Graph (, )][DBLP]


Search in 0.012secs, Finished in 0.015secs
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