Optimal Time-Space Trade-Offs for Non-Comparison-Based Sorting (2001)

by Rasmus Pagh , Jakob Pagter
Citations:3 - 0 self

Documents Related by Co-Citation

67 Linear Parametric Model Checking of Timed Automata – Thomas Hune, Judi Romijn, Mariëlle Stoelinga, Frits Vaandrager - 2002
5 Efficient Guiding Towards Cost-Optimality in UPPAAL – Paul Pettersson Larsen, Judi Romijn - 2001
5 Tools and Algorithms for The Construction and Analysis of Systems – S Hune, Kim G Larsen, Paul Pettersson, Judi Romijn, Frits W Vaandrager - 2001
575 Perspectives on Program Analysis – Flemming Nielson - 1996
2 Crépeau, Frédéric Légaré, and Louis Salvail. How to Convert a Flavor of Quantum Bit Commitment – RS-00-52 Claude - 2000
260 Digraphs -- Theory, Algorithms and Applications – Jørgen Bang-Jensen , Gregory Gutin - 2007
7 AND ZVEROVICH, A.: ‘Traveling salesman should not be greedy: domination analysis of greedy-type heuristics for the TSP – G GUTIN, A YEO
135 XDuce: A Typed XML Processing Language – Haruo Hosoya, Benjamin C. Pierce - 2000
113 Regular expression pattern matching for XML – Haruo Hosoya, Benjamin C. Pierce - 2003