|
4
|
Regular Trace Event Structures
– P. S. Thiagarajan, P. S. Thiagarajan
- 1996
|
|
|
Arne Andersson
– Arne Andersson, Torben Hagerup, Stefan Nilsson
|
|
5
|
Lower Bounds for Dynamic Algebraic Problems
– Gudmund Skovbjerg Frandsen, Johan P. Hansen, Peter Bro Miltersen
- 1999
|
|
1
|
On superlinear lower bounds in complexity theory
– Kenneth W. Regan
- 1995
|
|
5
|
Fast Algorithms for Shortest Paths and Sorting
– Rajeev Raman
- 1996
|
|
73
|
Sorting in Linear Time?
– Arne Andersson, Torben Hagerup, Stefan Nilsson
- 1995
|
|
|
Randomized Signature Sort: Implementation & Performance Analysis
– Tamana Pathak, Dr. Deepak Garg
|
|
149
|
Succinct indexable dictionaries with applications to encoding k-ary trees and multisets
– Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao
|
|
38
|
Improved Parallel Integer Sorting without Concurrent Writing
– Susanne Albers, Torben Hagerup
- 1992
|
|
3
|
Improved Data Structures for Predecessor Queries in Integer Sets
– Rajeev Raman
- 1996
|
|
8
|
Lower bounds for static dictionaries on RAMs with bit operations but no multiplication
– Peter Bro Miltersen
- 1996
|
|
1
|
Lower Bound Techniques for Data Structures
– Mihai Patrascu
- 2008
|
|
1
|
Linear-Time Ranking of Permutations
– Milan Straka
|
|
7
|
Counting Inversions, Offline Orthogonal Range Counting, and Related Problems
– Timothy M. Chan, Mihai Patrascu
|
|
27
|
Cell Probe Complexity - a Survey
– Peter Bro Miltersen
- 1999
|
|
16
|
Tight bounds for the partial-sums problem
– Scu Erik D. Demaine
- 2004
|
|
45
|
Marked Ancestor Problems
– Stephen Alstrup, Thore Husfeldt, Theis Rauhe
- 1998
|
|
23
|
Logarithmic lower bounds in the cell-probe model
– Erik, D. Demaine
- 2006
|
|
3
|
On sorting strings in external memory (extended abstract
– Lars Arge, Paolo Ferragina, Roberto Grossi, Jeffrey Scott Vitter
- 1997
|
