default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 115
Volume 115, Number 1, 1993
- Richard Blute:
Linear Logic, Coherence, and Dinaturality. 3-41 - Albert Burroni:
Higher-Dimensional Word Problems with Applications to Equational Logic. 43-62 - Thierry Coquand:
Another Proof of the Intuitionistic Ramsey Theorem. 63-75 - Abbas Edalat, Michael B. Smyth:
I-Categories as a Framework for Solving Domain Equations. 77-106 - Peter J. Freyd:
Structural Polymorphism. 107-129 - Grzegorz Jarzembski:
Programs in Partial Algebras. 131-149 - C. Barry Jay:
Tail Recursion Through Universal Invariants. 151-189
Volume 115, Number 2, 1993
- Igor Litovsky, Yves Métivier:
Computing with Graph Rewriting Systems with Priorities. 191-224 - Eric Allender, Richard Beigel, Ulrich Hertrampf, Steven Homer
:
Almost-Everywhere Complexity Hierarchies for Nondeterministic Time. 225-241 - Arturo Carpi:
Overlap-Free Words and Finite Automata. 243-260 - Oscar H. Ibarra, Nicholas Q. Trân:
Synchronized Finite Automata and 2DFA Reductions. 261-275 - Luc Longpré, Alan L. Selman:
Hard Promise Problems and Nonuniform Complexity. 277-290 - A. Troesch:
Interprétation géométrique de l'algorithme d'Euclide et reconnaissance de segments. 291-319 - Eric Goles Ch., Marcos A. Kiwi:
Games on Line Graphs and Sand Piles. 321-349 - R. Srikant, Ravi Sundaram, Karan Sher Singh, C. Pandu Rangan:
Optimal Path Cover Problem on Block Graphs and Bipartite Permutation Graphs. 351-357 - Masashi Katsura, Yuji Kobayashi:
The Shuffle Algebra and its Derivations. 359-369 - Shouwen Tang, Bin Fu, Tian Liu:
Exponential-Time and Subexponential-Time Sets. 371-381 - Steven Homer, Stuart A. Kurtz, James S. Royer:
On A-Truth-Table-Hard Languages. 383-389 - Sándor Vágvölgyi:
A Fast Algorithm for Constructing a Tree Automaton Recognizing a Congruential Tree Language. 391-399
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-05 22:23 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:
