default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 74
Volume 74, Number 1, 1990
- Volker Diekert:
Word Problems Over Traces which are Solvable in Linear Time. 3-18 - Donald S. Fussell, Ramakrishna Thurimella:
Successive Approximation in Parallel Graph Algorithms. 19-35 - Antonio Gavilanes-Franco, Francisca Lucio-Carrasco
:
A First Order Logic for Partial Functions. 37-69 - Petr Jancar:
Decidability of a Temporal Logic Problem for Petri Nets. 71-93 - Franco P. Preparata, Roberto Tamassia:
Dynamic Planar Point Location with Optimal Query Time. 95-114 - Andrzej Szepietowski:
If Deterministic and Nondeterministic Space Complexities are Equal for log log n, then they are also Equal for log n. 115-119 - Paul Gastin:
Un Modèle Asynchrone pour les Systèmes Distribués. 121-162
Volume 74, Number 2, 1990
- Ferenc Gécseg, Helmut Jürgensen:
Automata Represented by Products of Soliton Automata. 163-181 - B. John Oommen, E. R. Hansen, J. Ian Munro:
Deterministic Optimal and Expedient Move-to-Rear List Organizing Strategies. 183-197 - Felicja Okulicka:
On Priority in Cosy. 199-216 - Juris Hartmanis, Lane A. Hemachandra:
Robust Machines Accept Easy Sets. 217-225 - Marc Bezem:
Completeness of Resolution Revisited. 227-237 - Hans Hüttel:
SnS Can be Modally Characterized. 239-248 - Martin Kummer:
An Easy Priority-Free Proof of a Theorem of Friedberg. 249-251
Volume 74, Number 3, 1990
- Jingzhong Zhang, Lu Yang, Mike Deng:
The Parallel Numerical Method of Mechanical Theorem Proving. 253-271 - María-Inés Fernández-Camacho, Jean-Marc Steyaert:
Algebraic Simplification in Computer Algebra: An Analysis of Bottom-up Algorithms. 273-298 - Xin He:
An Efficient Algorithm for Edge Coloring Planar Graphs with Delta Colors. 299-312 - László Babai, Pavel Pudlák, Vojtech Rödl, Endre Szemerédi:
Lower Bounds to the Complexity of Symmetric Boolean Functions. 313-323 - Ulrich Hertrampf:
Relations Among Mod-Classes. 325-328 - Jean-François Romeuf:
A Polynomial Algorithm for Solving Systems of Two Linear Diophantine Equations. 329-340 - Marcella Anselmo:
Sur les Codes ZigZag et Leur Décidabilité. 341-354 - Jerzy Szymanski:
On the Complexity of Algorithms on Recursive Trees. 355-361
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-11-20 00:14 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:
