default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 99
Volume 99, Number 1, 1992
- Virgil Emil Cazanescu, Gheorghe Stefanescu:
A General Result on Abstract Flowchart Schemes with Applications to the Study of Accessibility, Reduction and Minimization. 1-63 - James Hein:
Completions of Perpetual Logic Programs. 65-78 - Jean-Luc Lambert:
A Structure to Decide Reachability in Petri Nets. 79-104 - Wim H. Hesselink:
Processes and Formalism for Unbounded Choice. 105-119 - Lutz Priese, Doris Nolte:
Strong Fairness and Ultra Metrics. 121-140 - Philip S. Mulry:
Monads and Algebras in the Semantics or Partial Data Types. 141-155 - Sanguthevar Rajasekaran, John H. Reif:
Nested Annealing: A Provable Improvement to Simulated Annealing. 157-176
Volume 99, Number 2, 1992
- Symeon Bozapalidis:
Alphabetic Tree Relations. 177-211 - Jyrki Nummenmaa:
Constructing Compact Rectilinear Planar Layouts Using Canonical Representation of Planar Graphs. 213-230 - Jean Néraud
:
On the Rank of the Subsets of a Free Monoid. 231-241 - Oscar H. Ibarra, Nicholas Q. Trân:
On Space-Bounded Synchronized Alternating Turing Machines. 243-264 - Shuhua Zhang:
Efficient Simplicity Testing of Automata. 265-278 - José L. Balcázar, Uwe Schöning:
Logarithmic Advice Classes. 279-290 - Stefano Varricchio:
On the Decidability of Equivalence Problem for Partially Commutative Rational Power Series. 291-299 - Oscar H. Ibarra, Tao Jiang, Hui Wang:
A Characterization of Exponential-Time Languages by Alternating Context-Free Grammars. 301-313 - Jean-Denis Fouks:
Tseitin's Formula Revisited. 315-326 - Brigitte Mossé:
Puissances de mots et reconnaissabilité des point fixes d'une substitution. 327-334 - Chính T. Hoàng:
A Parallel Algorithm for Minimum Weighted Colouring of Triangulated Graphs. 335-344
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-08 10:03 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:
