default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation and Computation, Volume 84
Volume 84, Number 1, 1990
- George K. Georgakopoulos, Dimitris J. Kavvadias:
The Banker's Problem with Precedences. 1-12 - Samir Khuller:
Extending Planar Graph Algorithms to K_3,3-Free Graphs. 13-25 - Dieter Spreen:
Computable One-to-One Enumerations of Effective Domains. 26-46 - Azeddine Lazrek, Pierre Lescanne, Jean-Jacques Thiel:
Tools for Proving Inductive Equalities, Relative Completeness, and omega-Completeness. 47-70 - Torben Hagerup:
Optimal Parallel Algorithms on Planar Graphs. 71-96 - Yehuda Afek, Gad M. Landau, Baruch Schieber, Moti Yung:
The Power of Multimedia: Combining Point-to-Point and Multiaccess Networks. 97-118 - Jin-yi Cai:
A Note on the Determinant and Permanent Problem. 119-127
Volume 84, Number 2, 1990
- Pierre America, Frank S. de Boer:
Proving Total Correctness of Recursive Procedures. 129-162 - Joost Engelfriet, Grzegorz Rozenberg:
A Comparison of Boundary Graph Grammars and Context-Free Hypergraph Grammars. 163-206 - Shojiro Sakata:
Extension of the Berlekamp-Massey Algorithm to N Dimensions. 207-239
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 2025-12-19 21:01 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:
