Mikkel Thorup

Yin Zhang

Proceedings of the 3rd ACM SIGCOMM Internet Measurement Conference, 2003

2002

Optimizing OSPF/IS-IS weights in a changing world.

[BibT_eX]

[DOI]

Bernard Fortz

IEEE J. Sel. Areas Commun., 2002

Randomized Sorting in O(n log log n) Time and Linear Space Using Addition, Shift, and Bit-wise Boolean Operations.

[BibT_eX]

[DOI]

J. Algorithms, 2002

Efficient Tree Layout in a Multilevel Memory Hierarchy

[BibT_eX]

[DOI]

CoRR, 2002

Traffic engineering with traditional IP routing protocols.

[BibT_eX]

[DOI]

Bernard Fortz

Jennifer Rexford

IEEE Commun. Mag., 2002

Oracles for distances avoiding a link-failure.

[BibT_eX]

[DOI]

Camil Demetrescu

Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

Properties and prediction of flow statistics from sampled packet streams.

[BibT_eX]

[DOI]

Nick G. Duffield

Carsten Lund

Proceedings of the 2nd ACM SIGCOMM Internet Measurement Workshop, 2002

Integer Sorting in 0(n sqrt (log log n)) Expected Time and Linear Space.

[BibT_eX]

[DOI]

Yijie Han

Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS 2002), 2002

On Distance Oracles and Routing in Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2002

2001

An Experimental Study of Polylogarithmic, Fully Dynamic, Connectivity Algorithms.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2001

Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity.

[BibT_eX]

[DOI]

Kristian de Lichtenberg

J. ACM, 2001

Compact routing schemes.

[BibT_eX]

[DOI]

Uri Zwick

Proceedings of the Thirteenth Annual ACM Symposium on Parallel Algorithms and Architectures, 2001

Dynamic string searching.

[BibT_eX]

[DOI]

Arne Andersson

Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

Charging from sampled network usage.

[BibT_eX]

[DOI]

Nick G. Duffield

Carsten Lund

Proceedings of the 1st ACM SIGCOMM Internet Measurement Workshop, 2001

A Space Saving Trick for Directed Dynamic Transitive Closure and Shortest Path Algorithms.

[BibT_eX]

[DOI]

Valerie King

Proceedings of the Computing and Combinatorics, 7th Annual International Conference, 2001

2000

On RAM Priority Queues.

[BibT_eX]

[DOI]

SIAM J. Comput., 2000

An O(nlog n) Algorithm for the Maximum Agreement Subtree Problem for Binary Trees.

[BibT_eX]

[DOI]

SIAM J. Comput., 2000

Floats, Integers, and Single Source Shortest Paths.

[BibT_eX]

[DOI]

J. Algorithms, 2000

Optimal Pointer Algorithms for Finding Nearest Common Ancestors in Dynamic Trees.

[BibT_eX]

[DOI]

J. Algorithms, 2000

Generalized Dominators for Structured Programs.

[BibT_eX]

[DOI]

Peter W. Lauridsen

Algorithmica, 2000

Dynamic Graph Algorithms with Applications.

[BibT_eX]

[DOI]

David R. Karger

Proceedings of the Algorithm Theory, 2000

Maintaining Center and Median in Dynamic Trees.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 2000

Near-optimal fully-dynamic graph connectivity.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000

Tight(er) worst-case bounds on dynamic searching and priority queues.

[BibT_eX]

[DOI]

Arne Andersson

Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000

Even strongly universal hashing is pretty fast.

[BibT_eX]

[DOI]

Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

Word encoding tree connectivity works.

[BibT_eX]

[DOI]

Jens P. Secher

Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

Internet Traffic Engineering by Optimizing OSPF Weights.

[BibT_eX]

[DOI]

Bernard Fortz

Proceedings of the Proceedings IEEE INFOCOM 2000, 2000

1999

Fusion Trees can be Implemented with AC0 Instructions Only.

[BibT_eX]

[DOI]

Arne Andersson

Peter Bro Miltersen

Theor. Comput. Sci., 1999

Dominators in Linear Time.

[BibT_eX]

[DOI]

SIAM J. Comput., 1999

On the Approximability of Numerical Taxonomy (Fitting Distances by Tree Metrics).

[BibT_eX]

[DOI]

SIAM J. Comput., 1999

Decremental Dynamic Connectivity.

[BibT_eX]

[DOI]

J. Algorithms, 1999

Undirected Single-Source Shortest Paths with Positive Integer Weights in Linear Time.

[BibT_eX]

[DOI]

J. ACM, 1999

1998

All Structured Programs have Small Tree-Width and Good Register Allocation.

[BibT_eX]

[DOI]

Inf. Comput., 1998

String Matching in Lempel-Ziv Compressed Strings.

[BibT_eX]

[DOI]

Algorithmica, 1998

Faster Deterministic Sorting and Priority Queues in Linear Space.

[BibT_eX]

[DOI]

Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998

Direct Routing on Trees (Extended Abstract).

[BibT_eX]

[DOI]

Kristian de Lichtenberg

Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998

Map Graphs in Polynomial Time.

[BibT_eX]

[DOI]

Proceedings of the 39th Annual Symposium on Foundations of Computer Science, 1998

1997

Sparse Dynamic Programming for Evolutionary-Tree Comparison.

[BibT_eX]

[DOI]

SIAM J. Comput., 1997

Sampling to provide or to bound: With applications to fully dynamic graph algorithms.

[BibT_eX]

[DOI]

Monika Rauch Henzinger

Random Struct. Algorithms, 1997

Parallel Shortcutting of Rooted Trees.

[BibT_eX]

[DOI]

J. Algorithms, 1997

Structured Programs have Small Tree-Width and Good Register Allocation (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1997

Finding Cores of Limited Length.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 5th International Workshop, 1997

Minimizing Diameters of Dynamic Trees.

[BibT_eX]

[DOI]

Kristian de Lichtenberg

Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997

Undirected Single Source Shortest Path in Linear Time.

[BibT_eX]

[DOI]

Proceedings of the 38th Annual Symposium on Foundations of Computer Science, 1997

1996

Efficient Preprocessing of Simple Binay Pattern Forests.

[BibT_eX]

[DOI]

J. Algorithms, 1996

Disambiguating Grammars by Exclusion of Sub-Parse Trees.

[BibT_eX]

[DOI]

Acta Informatica, 1996

On the Approximability of Numerical Taxonomy (Fitting Distances by Tree Metrics).

[BibT_eX]

[DOI]

Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 1996

Improved Sampling with Applications to Dynamic Graph Algorithms.

[BibT_eX]

[DOI]

Monika Rauch Henzinger

Proceedings of the Automata, Languages and Programming, 23rd International Colloquium, 1996

Static Dictionaries on AC0 RAMs: Query Time Theta(sqrt(log n/log log n)) is Necessary and Sufficient.

[BibT_eX]

[DOI]

Proceedings of the 37th Annual Symposium on Foundations of Computer Science, 1996

1995

On the Agreement of Many Trees.

[BibT_eX]

[DOI]

Teresa M. Przytycka

Inf. Process. Lett., 1995

Fast Comparison of Evolutionary Trees.

[BibT_eX]

[DOI]

Inf. Comput., 1995

Shortcutting Planar Digraphs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 1995

Computing the Agreement of Trees with Bounded Degrees.

[BibT_eX]

[DOI]

Teresa M. Przytycka

Proceedings of the Algorithms, 1995

1994

Controlled Grammatic Ambiguity.

[BibT_eX]

[DOI]

ACM Trans. Program. Lang. Syst., 1994

Efficient Preprocessing of Simple Binary Pattern Forests.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 1994

Optimal Evolutionary Tree Comparison by Sparse Dynamic Programming (Extended Abstract)

[BibT_eX]

[DOI]

Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 1994

1992

On Shortcutting Digraphs.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1992

1991

On Conservative Extensions of Syntax in System Development.

[BibT_eX]

[DOI]

Andrzej Blikle

Andrzej Tarlecki

Theor. Comput. Sci., 1991

1990

On Conservative Extensions of Syntax in the Process of System Development.

[BibT_eX]

[DOI]

Andrzej Blikle