Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 54
Volume 54, 1987
- Jieh Hsiang
, Mandayam K. Srivas:
Automatic Inductive Theorem Proving Using Prolog. 3-28 - Finn Verner Jensen, Kim Guldstrand Larsen:
Recursively Defined Doains and their Induction Principles. 29-51 - Alberto Marchetti-Spaccamela:
New Protocols for the Election of a Leader in a Ring. 53-64 - Victor Y. Pan:
Complexity of Parallel Matrix Computations. 65-85 - Chandrajit L. Bajaj:
Geometric Optimization and the Polynomial Hierarchy. 87-102 - V. S. Lakshmanan, C. E. Veni Madhavan:
An Algebraic Theory of Functional and Multivalued Dependencies in Relational Databases. 103-128 - Shankar M. Venkatesan:
Approximation Algorithms for Weighted Matching. 129-137 - Lutz Priese, Ralf Rehrmann, Uwe Willecke-Klemme:
An Introduction to the Regular Theory of Fairness. 139-163 - Giuseppina Rindone:
Construction d'une Famille de Codes Associes a Certains Groupes Finis. 165-179 - Andreas Brandstädt, Dieter Kratsch:
On Domination Problems for Permutation and Other Graphs. 181-198 - Andrzej Szalas:
A Complete Axiomatic Characterization of First-Order Temporal Logic of Linear Time. 199-214 - J. Robin B. Cockett:
Discrete Decision Theory: Manipulations. 215-236 - Paola Bertolazzi, Antonio Sassano:
An O(mn) Algorithm for Regular Set-Covering Problems. 237-247 - Osamu Watanabe:
A Comparison of Polynomial Time Completeness Notions. 249-265 - David E. Muller, Paul E. Schupp:
Alternating Automata on Infinite Trees. 267-276 - Hugues Fauconnier:
Semantique Asynchrone et Comportements Infinis en CSP. 277-298 - Seymour Ginsburg, Chang-jie Tang:
Canonical Forms for Interval Functions. 299-313 - Kazuhiro Sado, Yoshihide Igarashi:
A Function for Evaluating the Computing Time of a Bubbling System. 315-324 - Shigeki Iwata, Takumi Kasai:
Simultaneous (Poly-Time, Log-Space) Lower Bounds. 325-329 - Maciej Liskiewicz, Krzysztof Lorys, Marek Piotrów:
On Reversal Bounded Alternating Turing Machines. 331-339 - Ker-I Ko:
Corrigenda: On the Continued Fraction Representation of Computable Real Numbers. 341-343
a service of 
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-04-18 20:20 CEST 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:
