default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation and Computation, Volume 74
Volume 74, Number 1, 1987
- R. E. Krichevsky:
Information Compression and Varshamov-Gilbert Bound. 1-14 - Peter Kirschenhofer, Helmut Prodinger:
On the Recursive Depth of Special Tree Traversal Algorithms. 15-32 - David Peleg, Barbara Simons:
On Fault Tolerant Routings in General Networks. 33-49 - Che-Liang Yang, Gerald M. Masson:
An Efficient Algorithm for Multiprocessor Fault Diagnosis Using the Comparison Approach. 50-63 - Brigitte Rozoy:
The Dyck Language D'_1^* Is Not Generated by Any Matric Grammar of Finite Index. 64-89
Volume 74, Number 2, 1987
- Assaf Marron, Ker-I Ko:
Identification of Pattern Languages from Examples and Queries. 91-112 - Greg N. Frederickson, Mandayan A. Srinivas:
On-line Updating of Solutions to a Class of Matroid Intersection Problems. 113-139 - Dieter Kratsch:
Finding the Minimum Bandwidth of an Interval Graphs. 140-158 - Jennifer L. Welch:
Simulating Synchronous Processors. 159-170
Volume 74, Number 3, 1987
- Jacques Sakarovitch:
Easy Multiplications. I. The Realm of Kleene's Theorem. 173-197 - Karel Hrbacek:
Convex Powerdomains I. 198-225 - Ravi B. Boppana, J. C. Lagarias:
One-Way Functions and Circuit Complexity. 226-240 - Miklos Santha:
On Using Deterministic Functions to Reduce Randomness in Probabilistic Algorithms. 241-249
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-22 19:46 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
