|
Search the dblp DataBase
Robert Sedgewick:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Leonidas J. Guibas, Robert Sedgewick
A Dichromatic Framework for Balanced Trees [Citation Graph (23, 0)][DBLP] FOCS, 1978, pp:8-21 [Conf]
- Michael L. Fredman, Robert Sedgewick, Daniel Dominic Sleator, Robert Endre Tarjan
The Pairing Heap: A New Form of Self-Adjusting Heap. [Citation Graph (2, 0)][DBLP] Algorithmica, 1986, v:1, n:1, pp:111-129 [Journal]
- Robert Sedgewick, Jeffrey Scott Vitter
Shortest Paths in Euclidean Graphs (Extended Abstract) [Citation Graph (1, 0)][DBLP] FOCS, 1984, pp:417-424 [Conf]
- Richard J. Lipton, Robert Sedgewick, Jacobo Valdes
Programming Aspects of VLSI. [Citation Graph (1, 0)][DBLP] POPL, 1982, pp:57-65 [Conf]
- Jon Louis Bentley, Robert Sedgewick
Fast Algorithms for Sorting and Searching Strings. [Citation Graph (1, 0)][DBLP] SODA, 1997, pp:360-369 [Conf]
- Robert Sedgewick
The Analysis of Quicksort Programs [Citation Graph (1, 0)][DBLP] Acta Inf., 1977, v:7, n:, pp:327-355 [Journal]
- Russel Schaffer, Robert Sedgewick
The Analysis of Heapsort. [Citation Graph (1, 0)][DBLP] J. Algorithms, 1993, v:15, n:1, pp:76-100 [Journal]
- Philippe Flajolet, Robert Sedgewick
Digital Search Trees Revisited. [Citation Graph (1, 0)][DBLP] SIAM J. Comput., 1986, v:15, n:3, pp:748-767 [Journal]
- Jin-yi Cai, Richard J. Lipton, Robert Sedgewick, Andrew Chi-Chih Yao
Towards Uncheatable benchmarks. [Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1993, pp:2-11 [Conf]
- Mordecai J. Golin, Robert Sedgewick
Analysis of a Simple Yet Efficient Convex Hull Algorithm. [Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 1988, pp:153-163 [Conf]
- Susanne Albers, Robert Sedgewick, Dorothea Wagner
04091 Abstracts Collection - Data Structures. [Citation Graph (0, 0)][DBLP] Data Structures, 2004, pp:- [Conf]
- Robert Sedgewick
Analysis of Shellsort and Related Algorithms. [Citation Graph (0, 0)][DBLP] ESA, 1996, pp:1-11 [Conf]
- Janet Incerpi, Robert Sedgewick
Improved Upper Bounds on Shellsort [Citation Graph (0, 0)][DBLP] FOCS, 1983, pp:48-55 [Conf]
- J. Ian Munro, Thomas Papadakis, Robert Sedgewick
Deterministic Skip Lists. [Citation Graph (0, 0)][DBLP] SODA, 1992, pp:367-375 [Conf]
- Zhu Hong, Robert Sedgewick
Notes on Merging Networks (Preliminary Version) [Citation Graph (0, 0)][DBLP] STOC, 1982, pp:296-302 [Conf]
- Richard J. Lipton, Robert Sedgewick
Lower Bounds for VLSI [Citation Graph (0, 0)][DBLP] STOC, 1981, pp:300-307 [Conf]
- Robert Sedgewick, Thomas G. Szymanski
The Complexity of Finding Periods [Citation Graph (0, 0)][DBLP] STOC, 1979, pp:74-80 [Conf]
- Mark Allen Weiss, Robert Sedgewick
Tight Lower Bounds for Shellsort. [Citation Graph (0, 0)][DBLP] SWAT, 1988, pp:255-262 [Conf]
- Andrej Brodnik, Svante Carlsson, Erik D. Demaine, J. Ian Munro, Robert Sedgewick
Resizable Arrays in Optimal Time and Space. [Citation Graph (0, 0)][DBLP] WADS, 1999, pp:37-48 [Conf]
- Robert Sedgewick, Jeffrey Scott Vitter
Shortest Paths in Euclidean Graphs. [Citation Graph (0, 0)][DBLP] Algorithmica, 1986, v:1, n:1, pp:31-48 [Journal]
- Robert Sedgewick
Implementing Quicksort Programs. [Citation Graph (0, 0)][DBLP] Commun. ACM, 1978, v:21, n:10, pp:847-857 [Journal]
- Robert Sedgewick
Permutation Generation Methods. [Citation Graph (0, 0)][DBLP] ACM Comput. Surv., 1977, v:9, n:2, pp:137-164 [Journal]
- Robert Sedgewick
Corrigenda: ``Permutation Generation Methods''. [Citation Graph (0, 0)][DBLP] ACM Comput. Surv., 1977, v:9, n:4, pp:314- [Journal]
- Mordecai J. Golin, Robert Sedgewick
Queue-Mergesort. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1993, v:48, n:5, pp:253-259 [Journal]
- Janet Incerpi, Robert Sedgewick
Practical Variations of Shellsort. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1987, v:26, n:1, pp:37-43 [Journal]
- Mark Allen Weiss, Robert Sedgewick
Bad Cases for Shaker-Sort. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1988, v:28, n:3, pp:133-136 [Journal]
- Mark Allen Weiss, Robert Sedgewick
More on Shellsort Increment Sequences. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1990, v:34, n:5, pp:267-270 [Journal]
- Robert Sedgewick
A New Upper Bound for Shellsort. [Citation Graph (0, 0)][DBLP] J. Algorithms, 1986, v:7, n:2, pp:159-173 [Journal]
- Mark Allen Weiss, Robert Sedgewick
Tight Lower Bounds for Shellsort. [Citation Graph (0, 0)][DBLP] J. Algorithms, 1990, v:11, n:2, pp:242-251 [Journal]
- Janet Incerpi, Robert Sedgewick
Improved Upper Bounds on Shellsort. [Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 1985, v:31, n:2, pp:210-224 [Journal]
- Robert Sedgewick
Quicksort with Equal Keys. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1977, v:6, n:2, pp:240-268 [Journal]
- Robert Sedgewick
Data Movement in Odd-Even Merging. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1978, v:7, n:3, pp:239-272 [Journal]
- Robert Sedgewick, Thomas G. Szymanski, Andrew Chi-Chih Yao
The Complexity of Finding Cycles in Periodic Functions. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1982, v:11, n:2, pp:376-390 [Journal]
- Marc H. Brown, Robert Sedgewick
Techniques for Algorithm Animation. [Citation Graph (0, 0)][DBLP] IEEE Software, 1985, v:2, n:1, pp:28-39 [Journal]
- Philippe Flajolet, Robert Sedgewick
Mellin Transforms and Asymptotics: Finite Differences and Rice's Integrals. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1995, v:144, n:1&2, pp:101-124 [Journal]
- Richard J. Lipton, Jacobo Valdes, Gopalakrishnan Vijayan, Stephen C. North, Robert Sedgewick
VLSI Layout as Programming. [Citation Graph (0, 0)][DBLP] ACM Trans. Program. Lang. Syst., 1983, v:5, n:3, pp:405-421 [Journal]
06091 Abstracts Collection -- Data Structures. [Citation Graph (, )][DBLP]
06091 Executive Summary -- Data Structures. [Citation Graph (, )][DBLP]
CS-1 for scientists. [Citation Graph (, )][DBLP]
Search in 0.003secs, Finished in 0.306secs
|