| Publication | Date of Publication | Type |
|---|
Packing trees
Lecture Notes in Computer Science | 2023-05-08 | Paper |
Acronyms: identification, expansion and disambiguation
Annals of Mathematics and Artificial Intelligence | 2020-06-11 | Paper |
On an algorithm of Zemlyachenko for subtree isomorphism
Information Processing Letters | 2016-06-16 | Paper |
Canonical density control
Information Processing Letters | 2010-03-24 | Paper |
Covering a tree by a forest
Graph Theory, Computational Intelligence and Thought | 2010-01-07 | Paper |
Strongly competitive algorithms for caching with pipelined prefetching
Information Processing Letters | 2009-07-21 | Paper |
| scientific article; zbMATH DE number 1875407 (Why is no real title available?) | 2003-03-02 | Paper |
The passport control problem or how to keep a dynamic service system load balanced?
Theoretical Computer Science | 2002-07-15 | Paper |
Geometry helps in bottleneck matching and related problems
Algorithmica | 2002-03-04 | Paper |
Timing verification by successive approximation
Information and Computation | 2000-07-04 | Paper |
How to Pack Trees
Journal of Algorithms | 1999-09-22 | Paper |
Average and Randomized Complexity of Distributed Problems
SIAM Journal on Computing | 1997-06-09 | Paper |
A set expression based inheritance system
Annals of Mathematics and Artificial Intelligence | 1997-05-13 | Paper |
Adaptive Source Routing in High-Speed Networks
Journal of Algorithms | 1996-09-05 | Paper |
Learning by distances
Information and Computation | 1995-07-10 | Paper |
Nonuniform learnability
Journal of Computer and System Sciences | 1995-02-13 | Paper |
Optimal mapping in direct mapped cache environments
Mathematical Programming. Series A. Series B | 1994-06-19 | Paper |
Multiple Communication in Multihop Radio Networks
SIAM Journal on Computing | 1993-10-10 | Paper |
On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
Journal of Computer and System Sciences | 1993-01-16 | Paper |
Learnability with respect to fixed distributions
Theoretical Computer Science | 1991-01-01 | Paper |
Efficient emulation of single-hop radio network with collision detection on multi-hop radio network with no collision detection
Distributed Computing | 1991-01-01 | Paper |
Symmetry breaking in distributed networks
Information and Computation | 1990-01-01 | Paper |
Three tree-paths
Journal of Graph Theory | 1989-01-01 | Paper |
The multi-tree approach to reliability in distributed networks
Information and Computation | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4060753 (Why is no real title available?) | 1988-01-01 | Paper |
Unification as a complexity measure for logic programming
The Journal of Logic Programming | 1987-01-01 | Paper |
Complexity of Views: Tree and Cyclic Schemas
SIAM Journal on Computing | 1987-01-01 | Paper |
A fast and simple randomized parallel algorithm for the maximal independent set problem
Journal of Algorithms | 1986-01-01 | Paper |
A fast and simple randomized parallel algorithm for maximal matching
Information Processing Letters | 1986-01-01 | Paper |
Scheduling transmissions in a network
Journal of Algorithms | 1985-01-01 | Paper |
A golden ratio control policy for a multiple-access channel
IEEE Transactions on Automatic Control | 1984-01-01 | Paper |
Bounds on path connectivity
Discrete Mathematics | 1984-01-01 | Paper |
Hamilton Paths in Grid Graphs
SIAM Journal on Computing | 1982-01-01 | Paper |
The complexity of finding maximum disjoint paths with length constraints
Networks | 1982-01-01 | Paper |
Representation of graphs
Acta Informatica | 1982-01-01 | Paper |
Covering Graphs by Simple Circuits
SIAM Journal on Computing | 1981-01-01 | Paper |
Maximum Flow in Planar Networks
SIAM Journal on Computing | 1979-01-01 | Paper |
A randomized algorithm for checking equivalence of circular lists
Information Processing Letters | 1979-01-01 | Paper |
Some Matching Problems for Bipartite Graphs
Journal of the ACM | 1978-01-01 | Paper |
| scientific article; zbMATH DE number 3600081 (Why is no real title available?) | 1978-01-01 | Paper |
Finding a Minimum Circuit in a Graph
SIAM Journal on Computing | 1978-01-01 | Paper |
Interpolation search—a log log N search
Communications of the ACM | 1978-01-01 | Paper |
Two-Commodity Flow
Journal of the ACM | 1978-01-01 | Paper |
| scientific article; zbMATH DE number 3551893 (Why is no real title available?) | 1977-01-01 | Paper |
On the Complexity of Timetable and Multicommodity Flow Problems
SIAM Journal on Computing | 1976-01-01 | Paper |
Optimal Alphabetic Trees
SIAM Journal on Computing | 1976-01-01 | Paper |
