Equivalence of free boolean graphs can be decided probabilistically in polynomial time
- Manuel Blum
- Ashok K. Chandra
- et al.
- 1980
- Information Processing Letters
Publications
Date
Featured collections
Popular topics
81 results at Information Processing Letters
A new permutation algorithm for bubble memories
- K.M. Chung
- F. Luccio
- et al.
- 1980
- Information Processing Letters
Minimum number of steps for permutation in a bubble memory
- K.M. Chung
- F. Luccio
- et al.
- 1980
- Information Processing Letters
Implicit computation of synchronization primitives
- Richard A. De Millo
- Raymond E. Miller
- 1979
- Information Processing Letters
A note on paths embedded in trees
- Arnold L. Rosenberg
- 1979
- Information Processing Letters
Two results on process logic
- David Harel
- 1979
- Information Processing Letters
A batching method for coloring planar graphs
- Richard J. Lipton
- Raymond E. Miller
- 1978
- Information Processing Letters
A probabilistic minimum spanning tree algorithm
- F. James Rohlf
- 1978
- Information Processing Letters
Two fast simulations which imply some fast string matching and palindrome-recognition algorithms
- Zvi Galil
- 1976
- Information Processing Letters
A modified branch-and-bound strategy
- D.T. Tang
- C.K. Wong
- 1973
- Information Processing Letters