Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Journal=Theor.~Comput.~Sci. AND Volume=112
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Structure of concurrency
Ryszard Janicki
,
Maciej Koutny
Theoretical Computer Science
112
, 1993, pp. 5-52
A sheaf-theoretic approach to pattern matching and related problems
Yellamraju V. Srinivas
Theoretical Computer Science
112
, 1993, pp. 53-97
A theory of binding structures and applications to rewriting
Carolyn Talcott
Theoretical Computer Science
112
, 1993, pp. 99-143
Solving divergence in Knuth-Bendix completion by enriching signatures
Muffy Thomas
,
Phil Watson
Theoretical Computer Science
112
, 1993, pp. 145-185
Group presentations, formal languages and characterizations of one-counter groups
Thomas Herbst
,
Richard M. Thomas
Theoretical Computer Science
112
, 1993, pp. 187-213
Shortest curves in planar regions with curved boundary
Richard D. Bourgin
,
Sally E. Howe
Theoretical Computer Science
112
, 1993, pp. 215-253
On sparse hard sets for counting classes
Mitsunori Ogiwara
,
Antoni Lozano
Theoretical Computer Science
112
, 1993, pp. 255-275
Descriptional complexity of context-free grammar forms
Erzsébet Csuhaj-Varjú
,
Alica Kelemenová
Theoretical Computer Science
112
, 1993, pp. 277-289
The computational efficacy of finite-field arithmetic
Carl Sturtivant
,
Gudmund Skovbjerg Frandsen
Theoretical Computer Science
112
, 1993, pp. 291-309
Deciding whether a finite set of words has rank at most two
Jean Néraud
Theoretical Computer Science
112
, 1993, pp. 311-337
On the randomized construction of the Delaunay tree
Jean-Daniel Boissonnat
,
Monique Teillaud
Theoretical Computer Science
112
, 1993, pp. 339-354
On-line algorithms for 2-coloring hypergraphs via chip games
Javed A. Aslam
,
Aditi Dhagat
Theoretical Computer Science
112
, 1993, pp. 355-369
Undirected edge geography
Aviezri S. Fraenkel
,
Edward R. Scheinerman
,
Daniel Ullman
Theoretical Computer Science
112
, 1993, pp. 371-381
Note on the topological structure of random strings
Cristian Calude
,
Cezar Câmpeanu
Theoretical Computer Science
112
, 1993, pp. 383-390
A note on simple programs with two variables
Oscar H. Ibarra
,
Nicholas Q. Trân
Theoretical Computer Science
112
, 1993, pp. 391-397
Irrational speeds of configurations growth in generalized Pascal triangles
Ivan Korec
Theoretical Computer Science
112
, 1993, pp. 399-412
The Borel hierarchy is infinite in the class of regular sets of trees
Jerzy Skurczyński
Theoretical Computer Science
112
, 1993, pp. 413-418
Edge separators for graphs of bounded genus with applications
Ondrej Sýkora
,
Imrich Vrt̑o
Theoretical Computer Science
112
, 1993, pp. 419-429