| Publication | Date of Publication | Type |
|---|
| Packing trees | 2023-05-08 | Paper |
| Acronyms: identification, expansion and disambiguation | 2020-06-11 | Paper |
| On an algorithm of Zemlyachenko for subtree isomorphism | 2016-06-16 | Paper |
| Canonical density control | 2010-03-24 | Paper |
| Covering a Tree by a Forest | 2010-01-07 | Paper |
| Strongly competitive algorithms for caching with pipelined prefetching | 2009-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4796166 | 2003-03-02 | Paper |
| The passport control problem or how to keep a dynamic service system load balanced? | 2002-07-15 | Paper |
| Geometry helps in bottleneck matching and related problems | 2002-03-04 | Paper |
| Timing verification by successive approximation | 2000-07-04 | Paper |
| How to Pack Trees | 1999-09-22 | Paper |
| Average and Randomized Complexity of Distributed Problems | 1997-06-09 | Paper |
| A set expression based inheritance system | 1997-05-13 | Paper |
| Adaptive Source Routing in High-Speed Networks | 1996-09-05 | Paper |
| Learning by distances | 1995-07-10 | Paper |
| Nonuniform learnability | 1995-02-13 | Paper |
| Optimal mapping in direct mapped cache environments | 1994-06-19 | Paper |
| Multiple Communication in Multihop Radio Networks | 1993-10-10 | Paper |
| On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization | 1993-01-16 | Paper |
| Learnability with respect to fixed distributions | 1991-01-01 | Paper |
| Efficient emulation of single-hop radio network with collision detection on multi-hop radio network with no collision detection | 1991-01-01 | Paper |
| Symmetry breaking in distributed networks | 1990-01-01 | Paper |
| Three tree-paths | 1989-01-01 | Paper |
| The multi-tree approach to reliability in distributed networks | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3795256 | 1988-01-01 | Paper |
| Unification as a complexity measure for logic programming | 1987-01-01 | Paper |
| Complexity of Views: Tree and Cyclic Schemas | 1987-01-01 | Paper |
| A fast and simple randomized parallel algorithm for the maximal independent set problem | 1986-01-01 | Paper |
| A fast and simple randomized parallel algorithm for maximal matching | 1986-01-01 | Paper |
| Scheduling transmissions in a network | 1985-01-01 | Paper |
| A golden ratio control policy for a multiple-access channel | 1984-01-01 | Paper |
| Bounds on path connectivity | 1984-01-01 | Paper |
| Hamilton Paths in Grid Graphs | 1982-01-01 | Paper |
| The complexity of finding maximum disjoint paths with length constraints | 1982-01-01 | Paper |
| Representation of graphs | 1982-01-01 | Paper |
| Covering Graphs by Simple Circuits | 1981-01-01 | Paper |
| Maximum Flow in Planar Networks | 1979-01-01 | Paper |
| A randomized algorithm for checking equivalence of circular lists | 1979-01-01 | Paper |
| Some Matching Problems for Bipartite Graphs | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4166786 | 1978-01-01 | Paper |
| Finding a Minimum Circuit in a Graph | 1978-01-01 | Paper |
| Interpolation search—a log log N search | 1978-01-01 | Paper |
| Two-Commodity Flow | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4125770 | 1977-01-01 | Paper |
| On the Complexity of Timetable and Multicommodity Flow Problems | 1976-01-01 | Paper |
| Optimal Alphabetic Trees | 1976-01-01 | Paper |
