dblp.uni-trier.dewww.uni-trier.de

Richard Cole Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
Home Page

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

Coauthor Index

1Amihood Amir [74] [86] [91]
2Mikhail J. Atallah [20] [29]
3Yonatan Aumann [91]
4Mihai Badoiu [108]
5Zeeniya Bari [102]
6Peter Becker [99] [101]
7Michael A. Bender [80] [81] [82]
8Peter Bruza (Peter D. Bruza) [102]
9Kenneth L. Clarkson [39] [41] [42]
10Maxime Crochemore [49]
11Erik D. Demaine [81] [82] [108]
12Shahar Dobzinski [113]
13Yevgeniy Dodis [87] [92] [103] [105]
14Jon Ducrou [106]
15Peter W. Eklund [101] [106]
16Martin Farach-Colton (Martin Farach) [66] [81] [82]
17Lisa Fleischer [112] [113]
18Alan M. Frieze [63]
19Zvi Galil [49] [93]
20Leszek Gasieniec [49]
21Davi Geiger [100]
22Michael T. Goodrich [20] [25] [29] [36] [43] [55]
23Lee-Ad Gottlieb [94] [104]
24Ramesh Hariharan [44] [48] [49] [52] [58] [59] [60] [62] [64] [65] [66] [69] [74] [75] [78] [79] [83] [84] [86] [88] [93] [96]
25Friedhelm Meyer auf der Heide [61]
26John E. Hopcroft [1]
27John Iacono [108]
28Costas S. Iliopoulos [85] [97]
29Piotr Indyk [64]
30Hiroshi Ishikawa [100]
31David C. Kandathil [95]
32Klara Kedem [13]
33Philip N. Klein [56]
34Tsvi Kopelowitz [107]
35Lukasz Kowalik [109] [111]
36Thierry Lecroq [85]
37Daniel Leven [13]
38Moshe Lewenstein [74] [75] [86] [89] [91] [94] [107]
39Bruce M. Maggs [47] [54] [57] [61] [63] [72]
40Bud Mishra (Bhubaneswar Mishra) [68]
41Michael Mitzenmacher [61] [63]
42Manal Mohamed [97]
43S. Muthukrishnan (S. Muthu Muthukrishnan) [49] [93]
44Colm Ó'Dúnlaing [36] [55]
45Kirstin Ost [73]
46Kunsoo Park [49] [93]
47Mike Paterson [48] [52]
48Wojciech Plandowski [85]
49Richard Pollack [13]
50Ely Porat [74] [75] [86] [91]
51Teresa M. Przytycka [66]
52Arvind Raghunathan [37]
53Naila Rahman [76]
54Rajeev Raman [76] [80]
55Ashish Rastogi [110]
56Andréa W. Richa [61] [63]
57Tim Roughgarden [87] [92] [103] [105]
58Wojciech Rytter [49] [85]
59Jeffrey S. Salowe [26] [28]
60Stefan Schirra [73]
61Jeanette P. Schmidt [68]
62Klaus Schröder [61]
63Micha Sharir [4] [13] [17] [30]
64Dennis Shasha [98]
65Alan Siegel [5] [9] [23] [68]
66Shmuel Sifrony [13]
67Ramesh K. Sitaraman [47] [54] [57] [61] [63] [72]
68Riste Skrekovski [109]
69William F. Smyth (Bill Smyth) [97]
70Dawei Song [102]
71William L. Steiger [26] [28]
72Gerd Stumme [70]
73Endre Szemerédi [26] [28]
74Robert Endre Tarjan [39] [41] [42] [56]
75Mikkel Thorup [66]
76Thomas Tilley [90] [101]
77Eli Upfal [63]
78Uzi Vishkin [11] [12] [15] [22] [24] [27] [31] [38] [51]
79Berthold Vöcking [61]
80L. Yang [97]
81Chee-Keng Yap (Chee Yap) [2] [3] [4] [7] [17] [18]
82Ofer Zajicek [32] [33] [35] [53]
83Xiaojian Zhao [98]
84Jack Zito [81]
85Uri Zwick [48] [52]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)