The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Richard Cole: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Richard Cole
    Searching and Storing Similar Lists. [Citation Graph (5, 0)][DBLP]
    J. Algorithms, 1986, v:7, n:2, pp:202-220 [Journal]
  2. Richard Cole, Chee-Keng Yap
    Geometric Retrieval Problems [Citation Graph (1, 0)][DBLP]
    FOCS, 1983, pp:112-121 [Conf]
  3. Richard Cole, Uzi Vishkin
    Deterministic coin tossing and accelerating cascades: micro and macro techniques for designing parallel algorithms [Citation Graph (1, 0)][DBLP]
    STOC, 1986, pp:206-219 [Conf]
  4. Richard Cole
    Automated Layout of Concept Lattices Using Force Directed Placement and Genetic Algorithms. [Citation Graph (0, 0)][DBLP]
    ACSC, 2000, pp:31-42 [Conf]
  5. Richard Cole
    Automated Layout of Concept Lattices Using Layered Diagrams and Additive Diagrams. [Citation Graph (0, 0)][DBLP]
    ACSC, 2001, pp:47-53 [Conf]
  6. Richard Cole, Uzi Vishkin
    Optimal Parallel Algorithms for Expression Tree Evaluation and List Ranking. [Citation Graph (0, 0)][DBLP]
    AWOC, 1988, pp:91-100 [Conf]
  7. Kenneth L. Clarkson, Richard Cole, Robert Endre Tarjan
    Randomized Parallel Algorithms for Trapezoidal Diagrams. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1991, pp:152-161 [Conf]
  8. Richard Cole, Michael T. Goodrich
    Optimal Parallel Algorithms for Polygon and Point-Set Problems. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1988, pp:201-210 [Conf]
  9. Michael A. Bender, Richard Cole, Erik D. Demaine, Martin Farach-Colton
    Scanning and Traversing: Maintaining Data for Traversals in a Memory Hierarchy. [Citation Graph (0, 0)][DBLP]
    ESA, 2002, pp:139-151 [Conf]
  10. Michael A. Bender, Richard Cole, Erik D. Demaine, Martin Farach-Colton, Jack Zito
    Two Simplified Algorithms for Maintaining Order in a List. [Citation Graph (0, 0)][DBLP]
    ESA, 2002, pp:152-164 [Conf]
  11. Richard Cole, David C. Kandathil
    The Average Case Analysis of Partition Sorts. [Citation Graph (0, 0)][DBLP]
    ESA, 2004, pp:240-251 [Conf]
  12. Thomas Tilley, Richard Cole, Peter Becker 0002, Peter W. Eklund
    A Survey of Formal Concept Analysis Support for Software Engineering Activities. [Citation Graph (0, 0)][DBLP]
    Formal Concept Analysis, 2005, pp:250-271 [Conf]
  13. Mikhail J. Atallah, Richard Cole, Michael T. Goodrich
    Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms [Citation Graph (0, 0)][DBLP]
    FOCS, 1987, pp:151-160 [Conf]
  14. Richard Cole
    Slowing Down Sorting Networks to Obtain Faster Sorting Algorithms [Citation Graph (0, 0)][DBLP]
    FOCS, 1984, pp:255-260 [Conf]
  15. Richard Cole
    Parallel Merge Sort [Citation Graph (0, 0)][DBLP]
    FOCS, 1986, pp:511-516 [Conf]
  16. Richard Cole, Maxime Crochemore, Zvi Galil, Leszek Gasieniec, Ramesh Hariharan, S. Muthukrishnan, Kunsoo Park, Wojciech Rytter
    Optimally fast parallel algorithms for preprocessing and pattern matching in one and two dimensions [Citation Graph (0, 0)][DBLP]
    FOCS, 1993, pp:248-258 [Conf]
  17. Richard Cole, Ramesh Hariharan
    Tighter Bounds on the Exact Complexity of String Matching (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1992, pp:600-609 [Conf]
  18. Richard Cole, Bruce M. Maggs, Ramesh K. Sitaraman
    Routing on Butterfly Networks with Random Faults. [Citation Graph (0, 0)][DBLP]
    FOCS, 1995, pp:558-570 [Conf]
  19. Richard Cole, Arvind Raghunathan
    Online Algorithms for Finger Searching (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:480-489 [Conf]
  20. Richard Cole, Alan Siegel
    River Routing Every Which Way, but Loose (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1984, pp:65-73 [Conf]
  21. Richard Cole, Alan Siegel
    On Information Flow and Sorting: New Upper and Lower Bounds for VLSI Circuits (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1985, pp:208-221 [Conf]
  22. Richard Cole, Uzi Vishkin
    Approximate and Exact Parallel Scheduling with Applications to List, Tree and Graph Problems [Citation Graph (0, 0)][DBLP]
    FOCS, 1986, pp:478-491 [Conf]
  23. Micha Sharir, Richard Cole, Klara Kedem, Daniel Leven, Richard Pollack, Shmuel Sifrony
    Geometric Applications of Davenport-Schinzel Sequences [Citation Graph (0, 0)][DBLP]
    FOCS, 1986, pp:77-86 [Conf]
  24. Amihood Amir, Yonatan Aumann, Richard Cole, Moshe Lewenstein, Ely Porat
    Function Matching: Algorithms, Applications, and a Lower Bound. [Citation Graph (0, 0)][DBLP]
    ICALP, 2003, pp:929-942 [Conf]
  25. Michael A. Bender, Richard Cole, Rajeev Raman
    Exponential Structures for Efficient Cache-Oblivious Algorithms. [Citation Graph (0, 0)][DBLP]
    ICALP, 2002, pp:195-207 [Conf]
  26. Richard Cole
    Partitioning Point Sets in 4 Dimensions. [Citation Graph (0, 0)][DBLP]
    ICALP, 1985, pp:111-119 [Conf]
  27. Richard Cole, Michael T. Goodrich, Colm Ó'Dúnlaing
    Merging Free Trees in Parallel for Efficient Voronoi Diagram Construction (Preliminary Version). [Citation Graph (0, 0)][DBLP]
    ICALP, 1990, pp:432-445 [Conf]
  28. Richard Cole, Tsvi Kopelowitz, Moshe Lewenstein
    Suffix Trays and Suffix Trists: Structures for Faster Text Indexing. [Citation Graph (0, 0)][DBLP]
    ICALP (1), 2006, pp:358-369 [Conf]
  29. Richard Cole, Jeffrey S. Salowe, William L. Steiger, Endre Szemerédi
    Optimal Slope Selection. [Citation Graph (0, 0)][DBLP]
    ICALP, 1988, pp:133-146 [Conf]
  30. Richard Cole, Gerd Stumme
    CEM - A Conceptual Email Manager. [Citation Graph (0, 0)][DBLP]
    ICCS, 2000, pp:438-452 [Conf]
  31. Hiroshi Ishikawa 0002, Davi Geiger, Richard Cole
    Finding Tree Structures by Grouping Symmetries. [Citation Graph (0, 0)][DBLP]
    ICCV, 2005, pp:1132-1139 [Conf]
  32. Richard Cole, Peter Becker 0002
    Navigation Spaces for the Conceptual Analysis of Software Structure. [Citation Graph (0, 0)][DBLP]
    ICFCA, 2005, pp:113-128 [Conf]
  33. Richard Cole, Jon Ducrou, Peter W. Eklund
    Automated Layout of Small Lattices Using Layer Diagrams. [Citation Graph (0, 0)][DBLP]
    ICFCA, 2006, pp:291-305 [Conf]
  34. Richard Cole, Ramesh Hariharan, Mike Paterson, Uri Zwick
    Which Patterns are Hard to Find? [Citation Graph (0, 0)][DBLP]
    ISTCS, 1993, pp:59-68 [Conf]
  35. Richard Cole, Dennis Shasha, Xiaojian Zhao
    Fast window correlations over uncooperative time series. [Citation Graph (0, 0)][DBLP]
    KDD, 2005, pp:743-749 [Conf]
  36. Richard Cole, Alan M. Frieze, Bruce M. Maggs, Michael Mitzenmacher, Andréa W. Richa, Ramesh K. Sitaraman, Eli Upfal
    On Balls and Bins with Deletions. [Citation Graph (0, 0)][DBLP]
    RANDOM, 1998, pp:145-158 [Conf]
  37. Richard Cole, Thomas Tilley
    Conceptual Analysis of Software Structure. [Citation Graph (0, 0)][DBLP]
    SEKE, 2003, pp:726-733 [Conf]
  38. Richard Cole, Yevgeniy Dodis, Tim Roughgarden
    How much can taxes help selfish routing? [Citation Graph (0, 0)][DBLP]
    ACM Conference on Electronic Commerce, 2003, pp:98-107 [Conf]
  39. Amihood Amir, Richard Cole, Ramesh Hariharan, Moshe Lewenstein, Ely Porat
    Overlap matching. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:279-288 [Conf]
  40. Richard Cole
    Tight Bounds on the Complexity of the Boyer-Moore String Matching Algorithm. [Citation Graph (0, 0)][DBLP]
    SODA, 1991, pp:224-233 [Conf]
  41. Richard Cole, Yevgeniy Dodis, Tim Roughgarden
    Bottleneck links, variable demand, and the tragedy of the commons. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:668-677 [Conf]
  42. Richard Cole, Ramesh Hariharan
    An O(n log n) Algorithm for the Maximum Agreement Subtree Problem for Binary Trees. [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:323-332 [Conf]
  43. Richard Cole, Ramesh Hariharan
    Approximate String Matching: A Simpler Faster Algorithm. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:463-472 [Conf]
  44. Richard Cole, Ramesh Hariharan
    Dynamic LCA Queries on Trees. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:235-244 [Conf]
  45. Richard Cole, Ramesh Hariharan, Piotr Indyk
    Tree Pattern Matching and Subset Matching in Deterministic O(n log3 n)-time. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:245-254 [Conf]
  46. Richard Cole, Ramesh Hariharan, Moshe Lewenstein, Ely Porat
    A faster implementation of the Goemans-Williamson clustering algorithm. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:17-25 [Conf]
  47. Richard Cole, Moshe Lewenstein
    Multidimensional matching and fast search in suffix trees. [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:851-852 [Conf]
  48. Richard Cole, Philip N. Klein, Robert Endre Tarjan
    Finding Minimum Spanning Forests in Logarithmic Time and Linear Work Using Random Sampling. [Citation Graph (0, 0)][DBLP]
    SPAA, 1996, pp:243-250 [Conf]
  49. Richard Cole, Bruce M. Maggs, Ramesh K. Sitaraman
    On the Benefit of Supporting Virtual Channels in Wormhole Routers. [Citation Graph (0, 0)][DBLP]
    SPAA, 1996, pp:131-141 [Conf]
  50. Richard Cole, Ofer Zajicek
    The APRAM: Incorporating Asynchrony into the PRAM Model. [Citation Graph (0, 0)][DBLP]
    SPAA, 1989, pp:169-178 [Conf]
  51. Richard Cole, Ofer Zajicek
    The Expected Advantage of Asynchrony. [Citation Graph (0, 0)][DBLP]
    SPAA, 1990, pp:85-94 [Conf]
  52. Richard Cole
    On the Dynamic Finger Conjecture for Splay Trees (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1990, pp:8-17 [Conf]
  53. Richard Cole, Yevgeniy Dodis, Tim Roughgarden
    Pricing network edges for heterogeneous selfish users. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:521-530 [Conf]
  54. Richard Cole, Lee-Ad Gottlieb
    Searching dynamic point sets in spaces with bounded doubling dimension. [Citation Graph (0, 0)][DBLP]
    STOC, 2006, pp:574-583 [Conf]
  55. Richard Cole, Lee-Ad Gottlieb, Moshe Lewenstein
    Dictionary matching and indexing with errors and don't cares. [Citation Graph (0, 0)][DBLP]
    STOC, 2004, pp:91-100 [Conf]
  56. Richard Cole, Ramesh Hariharan
    Faster suffix tree construction with missing suffix links. [Citation Graph (0, 0)][DBLP]
    STOC, 2000, pp:407-415 [Conf]
  57. Richard Cole, Ramesh Hariharan
    Verifying candidate matches in sparse and wildcard matching. [Citation Graph (0, 0)][DBLP]
    STOC, 2002, pp:592-601 [Conf]
  58. Richard Cole, Ramesh Hariharan
    A fast algorithm for computing steiner edge connectivity. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:167-176 [Conf]
  59. Richard Cole, Ramesh Hariharan
    Tree Pattern Matching and Subset Matching in Randomized O(n log3m) Time. [Citation Graph (0, 0)][DBLP]
    STOC, 1997, pp:66-75 [Conf]
  60. Richard Cole, Bruce M. Maggs, Friedhelm Meyer auf der Heide, Michael Mitzenmacher, Andréa W. Richa, Klaus Schröder, Ramesh K. Sitaraman, Berthold Vöcking
    Randomized Protocols for Low Congestion Circuit Routing in Multistage Interconnection Networks. [Citation Graph (0, 0)][DBLP]
    STOC, 1998, pp:378-388 [Conf]
  61. Richard Cole, Bruce M. Maggs, Ramesh K. Sitaraman
    Multi-scale self-simulation: a technique for reconfiguring arrays with faults. [Citation Graph (0, 0)][DBLP]
    STOC, 1993, pp:561-572 [Conf]
  62. Richard Cole, Micha Sharir, Chee-Keng Yap
    On k-hulls and Related Problems [Citation Graph (0, 0)][DBLP]
    STOC, 1984, pp:154-166 [Conf]
  63. Richard Cole
    Tolerating Faults in Meshes and Other Networks (Abstract). [Citation Graph (0, 0)][DBLP]
    WADS, 1993, pp:26- [Conf]
  64. Naila Rahman, Richard Cole, Rajeev Raman
    Optimised Predecessor Data Structures for Internal Memory. [Citation Graph (0, 0)][DBLP]
    Algorithm Engineering, 2001, pp:67-78 [Conf]
  65. Richard Cole, Michael T. Goodrich
    Optimal Parallel Algorithms for Point-Set and Polygon Problems. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1992, v:7, n:1, pp:3-23 [Journal]
  66. Richard Cole, Michael T. Goodrich, Colm Ó'Dúnlaing
    A Nearly Optimal Deterministic Parallel Voroni Diagram Algorithm. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1996, v:16, n:6, pp:569-617 [Journal]
  67. Richard Cole, Uzi Vishkin
    The Accelerated Centroid Decomposition Technique for Optimal Parallel Tree Evaluation in Logarithmic Time. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1988, v:3, n:, pp:329-346 [Journal]
  68. Richard Cole, Kirstin Ost, Stefan Schirra
    Edge-Coloring Bipartite Multigraphs in O(E log D) Time. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2001, v:21, n:1, pp:5-12 [Journal]
  69. Richard Cole, Uzi Vishkin
    On the Detection of Robust Curves. [Citation Graph (0, 0)][DBLP]
    CVGIP: Graphical Model and Image Processing, 1994, v:56, n:3, pp:189-204 [Journal]
  70. Amihood Amir, Richard Cole, Ramesh Hariharan, Moshe Lewenstein, Ely Porat
    Overlap matching. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2003, v:181, n:1, pp:57-74 [Journal]
  71. Richard Cole, Zvi Galil, Ramesh Hariharan, S. Muthukrishnan, Kunsoo Park
    Parallel two dimensional witness computation. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2004, v:188, n:1, pp:20-67 [Journal]
  72. Richard Cole, Uzi Vishkin
    Deterministic Coin Tossing with Applications to Optimal Parallel List Ranking [Citation Graph (0, 0)][DBLP]
    Information and Control, 1986, v:70, n:1, pp:32-53 [Journal]
  73. Richard Cole, Uzi Vishkin
    Faster Optimal Parallel Prefix Sums and List Ranking [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1989, v:81, n:3, pp:334-352 [Journal]
  74. Richard Cole, Uzi Vishkin
    Approximate Parallel Scheduling. II. Applications to Logarithmic-Time Optimal Parallel Graph Algorithms [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1991, v:92, n:1, pp:1-47 [Journal]
  75. Richard Cole, Chee-Keng Yap
    Geometric Retrieval Problems [Citation Graph (0, 0)][DBLP]
    Information and Control, 1984, v:63, n:1/2, pp:39-57 [Journal]
  76. Peter Bruza, Richard Cole, Dawei Song, Zeeniya Bari
    Towards Operational Abduction from a Cognitive Perspective. [Citation Graph (0, 0)][DBLP]
    Logic Journal of the IGPL, 2006, v:14, n:2, pp:161-177 [Journal]
  77. Kenneth L. Clarkson, Richard Cole, Robert Endre Tarjan
    Randomized parallel algorithms for trapezoidal diagrams. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1992, v:2, n:2, pp:117-133 [Journal]
  78. Kenneth L. Clarkson, Richard Cole, Robert Endre Tarjan
    Erratum: Randomized parallel algorithms for trapezoidal diagrams. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1992, v:2, n:3, pp:341-343 [Journal]
  79. Richard Cole, Costas S. Iliopoulos, Thierry Lecroq, Wojciech Plandowski, Wojciech Rytter
    On special families of morphisms related to [delta]-matching and don't care symbols. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2003, v:85, n:5, pp:227-233 [Journal]
  80. Richard Cole, Chee-Keng Yap
    A Parallel Median Algorithm. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1985, v:20, n:3, pp:137-139 [Journal]
  81. Richard Cole
    Slowing down sorting networks to obtain faster sorting algorithms. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1987, v:34, n:1, pp:200-208 [Journal]
  82. Richard Cole, Alan Siegel
    Optimal VLSI circuits for sorting. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1988, v:35, n:4, pp:777-809 [Journal]
  83. Richard Cole, Chee-Keng Yap
    Shape from Probing. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1987, v:8, n:1, pp:19-38 [Journal]
  84. Richard Cole, Ofer Zajicek
    An Asynchronous Parallel Algorithm for Undirected Graph Connectivity. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1995, v:18, n:1, pp:50-97 [Journal]
  85. Richard Cole, Yevgeniy Dodis, Tim Roughgarden
    How much can taxes help selfish routing? [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2006, v:72, n:3, pp:444-467 [Journal]
  86. Richard Cole, Bruce M. Maggs, Ramesh K. Sitaraman
    On the Benefit of Supporting Virtual Channels in Wormhole Routers. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2001, v:62, n:1, pp:152-177 [Journal]
  87. Richard Cole, Ofer Zajicek
    An Optimal Parallel Algorithm for Building a Data Structure for Planar Point Location. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1990, v:8, n:3, pp:280-285 [Journal]
  88. Richard Cole, Micha Sharir
    Visibility Problems for Polyhedral Terrains. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1989, v:7, n:1, pp:11-30 [Journal]
  89. Mikhail J. Atallah, Richard Cole, Michael T. Goodrich
    Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1989, v:18, n:3, pp:499-532 [Journal]
  90. Richard Cole
    On the Dynamic Finger Conjecture for Splay Trees. Part II: The Proof. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:30, n:1, pp:44-85 [Journal]
  91. Richard Cole
    Parallel Merge Sort. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1988, v:17, n:4, pp:770-785 [Journal]
  92. Richard Cole
    Correction: Parallel Merge Sort. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1993, v:22, n:6, pp:1349- [Journal]
  93. Richard Cole
    Tight Bounds on the Complexity of the Boyer-Moore String Matching Algorithm. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1994, v:23, n:5, pp:1075-1091 [Journal]
  94. Richard Cole, Martin Farach-Colton, Ramesh Hariharan, Teresa M. Przytycka, Mikkel Thorup
    An O(nlog n) Algorithm for the Maximum Agreement Subtree Problem for Binary Trees. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:30, n:5, pp:1385-1404 [Journal]
  95. Richard Cole, Ramesh Hariharan
    Approximate String Matching: A Simpler Faster Algorithm. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2002, v:31, n:6, pp:1761-1782 [Journal]
  96. Richard Cole, Ramesh Hariharan
    Tree Pattern Matching to Subset Matching in Linear Time. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2003, v:32, n:4, pp:1056-1066 [Journal]
  97. Richard Cole, Ramesh Hariharan
    Faster Suffix Tree Construction with Missing Suffix Links. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2003, v:33, n:1, pp:26-42 [Journal]
  98. Richard Cole, Ramesh Hariharan
    Dynamic LCA Queries on Trees. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:34, n:4, pp:894-923 [Journal]
  99. Richard Cole, John E. Hopcroft
    On Edge Coloring Bipartite Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1982, v:11, n:3, pp:540-546 [Journal]
  100. Richard Cole, Ramesh Hariharan
    Tighter Upper Bounds on the Exact Complexity of String Matching. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1997, v:26, n:3, pp:803-856 [Journal]
  101. Richard Cole, Ramesh Hariharan, Mike Paterson, Uri Zwick
    Tighter Lower Bounds on the Exact Complexity of String Matching. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1995, v:24, n:1, pp:30-45 [Journal]
  102. Richard Cole, Bud Mishra, Jeanette P. Schmidt, Alan Siegel
    On the Dynamic Finger Conjecture for Splay Trees. Part I: Splay Sorting log n-Block Sequences. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:30, n:1, pp:1-43 [Journal]
  103. Richard Cole, Jeffrey S. Salowe, William L. Steiger, Endre Szemerédi
    An Optimal-Time Algorithm for Slope Selection. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1989, v:18, n:4, pp:792-810 [Journal]
  104. Richard Cole, Micha Sharir, Chee-Keng Yap
    On k-Hulls and Related Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1987, v:16, n:1, pp:61-77 [Journal]
  105. Richard Cole, Uzi Vishkin
    Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1988, v:17, n:1, pp:128-142 [Journal]
  106. Richard Cole
    Partitioning Point Sets in Arbitrary Dimension. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1987, v:49, n:, pp:239-265 [Journal]
  107. Mihai Badoiu, Richard Cole, Erik D. Demaine, John Iacono
    A unified access bound on comparison-based dynamic dictionaries. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:382, n:2, pp:86-96 [Journal]

  108. Resource Oblivious Sorting on Multicores. [Citation Graph (, )][DBLP]


  109. Fast-converging tatonnement algorithms for one-time and ongoing market problems. [Citation Graph (, )][DBLP]


  110. Prompt Mechanisms for Online Auctions. [Citation Graph (, )][DBLP]


  111. New Linear-Time Algorithms for Edge-Coloring Planar Graphs. [Citation Graph (, )][DBLP]


  112. Indivisible Markets with Good Approximate EquilibriumPrices. [Citation Graph (, )][DBLP]


Search in 0.009secs, Finished in 0.017secs
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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002