 | 2008 |
|---|
| 46 |       | Greg Wilson,
Christine Alvarado,
Jennifer Campbell,
Rubin H. Landau,
Robert Sedgewick:
CS-1 for scientists.
SIGCSE 2008: 36-37 |
| 2006 |
|---|
| 45 |  | Lars Arge,
Robert Sedgewick,
Dorothea Wagner:
Data Structures, 26.02. - 03.03.2006
Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2006 |
| 44 | | Lars Arge,
Robert Sedgewick,
Dorothea Wagner:
06091 Abstracts Collection -- Data Structures.
Data Structures 2006 |
| 43 | | Lars Arge,
Robert Sedgewick,
Dorothea Wagner:
06091 Executive Summary -- Data Structures.
Data Structures 2006 |
| 2005 |
|---|
| 42 | | Susanne Albers,
Robert Sedgewick,
Dorothea Wagner:
Data Structures, 22.-27. February 2004
Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany 2005 |
| 41 | | Camil Demetrescu,
Robert Sedgewick,
Roberto Tamassia:
Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics, ALENEX /ANALCO 2005, Vancouver, BC, Canada, 22 January 2005
SIAM 2005 |
| 2004 |
|---|
| 40 | | Lars Arge,
Giuseppe F. Italiano,
Robert Sedgewick:
Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments and the First Workshop on Analytic Algorithmics and Combinatorics, New Orleans, LA, USA, January 10, 2004
SIAM 2004 |
| 39 | | Susanne Albers,
Robert Sedgewick,
Dorothea Wagner:
04091 Abstracts Collection - Data Structures.
Data Structures 2004 |
| 1999 |
|---|
| 38 | | Andrej Brodnik,
Svante Carlsson,
Erik D. Demaine,
J. Ian Munro,
Robert Sedgewick:
Resizable Arrays in Optimal Time and Space.
WADS 1999: 37-48 |
| 1997 |
|---|
| 37 | | Jon Louis Bentley,
Robert Sedgewick:
Fast Algorithms for Sorting and Searching Strings.
SODA 1997: 360-369 |
| 1996 |
|---|
| 36 | | Robert Sedgewick:
Analysis of Shellsort and Related Algorithms.
ESA 1996: 1-11 |
| 1995 |
|---|
| 35 | | Philippe Flajolet,
Robert Sedgewick:
Mellin Transforms and Asymptotics: Finite Differences and Rice's Integrals.
Theor. Comput. Sci. 144(1&2): 101-124 (1995) |
| 1993 |
|---|
| 34 | | Jin-yi Cai,
Richard J. Lipton,
Robert Sedgewick,
Andrew Chi-Chih Yao:
Towards Uncheatable benchmarks.
Structure in Complexity Theory Conference 1993: 2-11 |
| 33 | | Mordecai J. Golin,
Robert Sedgewick:
Queue-Mergesort.
Inf. Process. Lett. 48(5): 253-259 (1993) |
| 32 | | Russel Schaffer,
Robert Sedgewick:
The Analysis of Heapsort.
J. Algorithms 15(1): 76-100 (1993) |
| 1992 |
|---|
| 31 | | J. Ian Munro,
Thomas Papadakis,
Robert Sedgewick:
Deterministic Skip Lists.
SODA 1992: 367-375 |
| 1990 |
|---|
| 30 | | Mark Allen Weiss,
Robert Sedgewick:
More on Shellsort Increment Sequences.
Inf. Process. Lett. 34(5): 267-270 (1990) |
| 29 | | Mark Allen Weiss,
Robert Sedgewick:
Tight Lower Bounds for Shellsort.
J. Algorithms 11(2): 242-251 (1990) |
| 1988 |
|---|
| 28 | | Robert Sedgewick:
Algorithms, 2nd Edition
Addison-Wesley 1988 |
| 27 | | Mark Allen Weiss,
Robert Sedgewick:
Tight Lower Bounds for Shellsort.
SWAT 1988: 255-262 |
| 26 | | Mordecai J. Golin,
Robert Sedgewick:
Analysis of a Simple Yet Efficient Convex Hull Algorithm.
Symposium on Computational Geometry 1988: 153-163 |
| 25 | | Mark Allen Weiss,
Robert Sedgewick:
Bad Cases for Shaker-Sort.
Inf. Process. Lett. 28(3): 133-136 (1988) |
| 1987 |
|---|
| 24 | | Janet Incerpi,
Robert Sedgewick:
Practical Variations of Shellsort.
Inf. Process. Lett. 26(1): 37-43 (1987) |
| 1986 |
|---|
| 23 | | Michael L. Fredman,
Robert Sedgewick,
Daniel Dominic Sleator,
Robert Endre Tarjan:
The Pairing Heap: A New Form of Self-Adjusting Heap.
Algorithmica 1(1): 111-129 (1986) |
| 22 | | Robert Sedgewick,
Jeffrey Scott Vitter:
Shortest Paths in Euclidean Graphs.
Algorithmica 1(1): 31-48 (1986) |
| 21 | | Robert Sedgewick:
A New Upper Bound for Shellsort.
J. Algorithms 7(2): 159-173 (1986) |
| 20 | | Philippe Flajolet,
Robert Sedgewick:
Digital Search Trees Revisited.
SIAM J. Comput. 15(3): 748-767 (1986) |
| 1985 |
|---|
| 19 | | Marc H. Brown,
Robert Sedgewick:
Techniques for Algorithm Animation.
IEEE Software 2(1): 28-39 (1985) |
| 18 | | Janet Incerpi,
Robert Sedgewick:
Improved Upper Bounds on Shellsort.
J. Comput. Syst. Sci. 31(2): 210-224 (1985) |
| 1984 |
|---|
| 17 | | Robert Sedgewick,
Jeffrey Scott Vitter:
Shortest Paths in Euclidean Graphs (Extended Abstract)
FOCS 1984: 417-424 |
| 1983 |
|---|
| 16 | | Robert Sedgewick:
Algorithms
Addison-Wesley 1983 |
| 15 | | Janet Incerpi,
Robert Sedgewick:
Improved Upper Bounds on Shellsort
FOCS 1983: 48-55 |
| 14 | | Richard J. Lipton,
Jacobo Valdes,
Gopalakrishnan Vijayan,
Stephen C. North,
Robert Sedgewick:
VLSI Layout as Programming.
ACM Trans. Program. Lang. Syst. 5(3): 405-421 (1983) |
| 1982 |
|---|
| 13 | | Richard J. Lipton,
Robert Sedgewick,
Jacobo Valdes:
Programming Aspects of VLSI.
POPL 1982: 57-65 |
| 12 | | Zhu Hong,
Robert Sedgewick:
Notes on Merging Networks (Preliminary Version)
STOC 1982: 296-302 |
| 11 | | Robert Sedgewick,
Thomas G. Szymanski,
Andrew Chi-Chih Yao:
The Complexity of Finding Cycles in Periodic Functions.
SIAM J. Comput. 11(2): 376-390 (1982) |
| 1981 |
|---|
| 10 | | Richard J. Lipton,
Robert Sedgewick:
Lower Bounds for VLSI
STOC 1981: 300-307 |
| 1979 |
|---|
| 9 | | Robert Sedgewick,
Thomas G. Szymanski:
The Complexity of Finding Periods
STOC 1979: 74-80 |
| 1978 |
|---|
| 8 | | Leonidas J. Guibas,
Robert Sedgewick:
A Dichromatic Framework for Balanced Trees
FOCS 1978: 8-21 |
| 7 | | Robert Sedgewick:
Implementing Quicksort Programs.
Commun. ACM 21(10): 847-857 (1978) |
| 6 | | Robert Sedgewick:
Data Movement in Odd-Even Merging.
SIAM J. Comput. 7(3): 239-272 (1978) |
| 1977 |
|---|
| 5 | | Robert Sedgewick:
Permutation Generation Methods.
ACM Comput. Surv. 9(2): 137-164 (1977) |
| 4 | | Robert Sedgewick:
Corrigenda: ``Permutation Generation Methods''.
ACM Comput. Surv. 9(4): 314 (1977) |
| 3 | | Robert Sedgewick:
The Analysis of Quicksort Programs
Acta Inf. 7: 327-355 (1977) |
| 2 | | Robert Sedgewick:
Quicksort with Equal Keys.
SIAM J. Comput. 6(2): 240-268 (1977) |
| 1975 |
|---|
| 1 | | Robert Sedgewick:
Quicksort
Garland Publishing, New York 1975 |
