| Publication | Date of Publication | Type |
|---|
Rectangular layouts and contact graphs
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Improving table compression with combinatorial optimization
Journal of the ACM | 2015-11-12 | Paper |
scientific article; zbMATH DE number 6381738 (Why is no real title available?)
| 2014-12-18 | Paper |
OPT versus LOAD in dynamic storage allocation
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
Linear-Time Algorithms for Dominators and Other Path-Evaluation Problems
SIAM Journal on Computing | 2009-08-20 | Paper |
New results for finding common neighborhoods in massive graphs in the data stream model
Theoretical Computer Science | 2008-11-18 | Paper |
Fast prefix matching of bounded strings
ACM Journal of Experimental Algorithmics | 2005-08-04 | Paper |
Biased skip lists
Algorithmica | 2005-05-13 | Paper |
OPTVersusLOADin Dynamic Storage Allocation
SIAM Journal on Computing | 2005-02-21 | Paper |
scientific article; zbMATH DE number 2119663 (Why is no real title available?)
| 2004-11-29 | Paper |
Three-dimensional layers of maxima
Algorithmica | 2004-10-01 | Paper |
scientific article; zbMATH DE number 1979482 (Why is no real title available?)
| 2003-09-14 | Paper |
scientific article; zbMATH DE number 1947398 (Why is no real title available?)
| 2003-07-08 | Paper |
On finding common neighborhoods in massive graphs.
Theoretical Computer Science | 2003-05-25 | Paper |
scientific article; zbMATH DE number 1775413 (Why is no real title available?)
| 2002-09-17 | Paper |
A functional approach to external graph algorithms
Algorithmica | 2002-05-21 | Paper |
scientific article; zbMATH DE number 1670652 (Why is no real title available?)
| 2001-11-11 | Paper |
An approximate determinization algorithm for weighted finite-state automata
Algorithmica | 2001-08-09 | Paper |
scientific article; zbMATH DE number 1615267 (Why is no real title available?)
| 2001-07-08 | Paper |
On the determinization of weighted finite automata
SIAM Journal on Computing | 2001-03-19 | Paper |
scientific article; zbMATH DE number 1445387 (Why is no real title available?)
| 2000-10-23 | Paper |
scientific article; zbMATH DE number 1445352 (Why is no real title available?)
| 2000-10-23 | Paper |
scientific article; zbMATH DE number 1305093 (Why is no real title available?)
| 2000-03-13 | Paper |
scientific article; zbMATH DE number 1256639 (Why is no real title available?)
| 1999-04-22 | Paper |
scientific article; zbMATH DE number 1223726 (Why is no real title available?)
| 1998-11-15 | Paper |
A data structure for arc insertion and regular path finding
Annals of Mathematics and Artificial Intelligence | 1997-11-27 | Paper |
Data-Structural Bootstrapping, Linear Path Compression, and Catenable Heap-Ordered Double-Ended Queues
SIAM Journal on Computing | 1996-09-15 | Paper |
scientific article; zbMATH DE number 871925 (Why is no real title available?)
| 1996-06-18 | Paper |
Confluently Persistent Deques via Data-Structural Bootstrapping
Journal of Algorithms | 1996-03-18 | Paper |
Monte Carlo and Markov Chain techniques for network reliability and sampling
Networks | 1995-07-20 | Paper |
Lazy structure sharing for query optimization
Acta Informatica | 1995-06-21 | Paper |
scientific article; zbMATH DE number 742895 (Why is no real title available?)
| 1995-04-11 | Paper |
Determining uni-connectivity in directed graphs
Information Processing Letters | 1994-02-24 | Paper |
scientific article; zbMATH DE number 432747 (Why is no real title available?)
| 1994-01-02 | Paper |
scientific article; zbMATH DE number 437540 (Why is no real title available?)
| 1993-12-15 | Paper |
