


default search action
Theoretical Computer Science, Volume 132
Volume 132, Numbers 1&2, 26 September 1994
- Philippe Flajolet, Paul Zimmermann, Bernard Van Cutsem:

A Calculus for the Random Generation of Labelled Combinatorial Structures. 1-35 - David W. Juedes

, James I. Lathrop, Jack H. Lutz:
Computational Depth and Reducibility. 37-70 - Ernst L. Leiss:

Unrestricted Complementation in Language Equations Over a One-Letter Alphabet. 71-84 - Changwook Kim:

Retreat Bounded Picture Languages. 85-112 - Pascal Koiran, Michel Cosnard

, Max H. Garzon:
Computability with Low-Dimensional Dynamical Systems. 113-128 - Lila Kari:

On Language Equations with Invertible Operations. 129-150 - Paola Bonizzoni

:
Primitive 2-structures with the (n-2)-Property. 151-178 - Giovanni Pighizzini

:
Asynchronous Automata Versus Asynchronous Cellular Automata. 179-207 - Andrzej Ehrenfeucht, Ross M. McConnell:

A k-Structure Generalization of the Theory of 2-Structures. 209-227 - Klaus Ambos-Spies, Steven Homer

, Robert I. Soare:
Minimal Pairs and Complete Problems. 229-241 - Jean-Camille Birget, Joseph B. Stephen:

Formal Languages Defined by Uniform Substitutions. 243-258 - Zsuzsanna Róka

:
One-Way Cellular Automata on Cayley Graphs. 259-290 - Alfredo De Santis

, Giovanni Di Crescenzo, Giuseppe Persiano:
The Knowledge Complexity of Quadratic Residuosity Languages. 291-317 - Juraj Hromkovic, Branislav Rovan, Anna Slobodová:

Deterministic versus Nondeterministic Space in Terms of Synchronized Alternating Machines. 319-336 - Reinhard Diestel, Imre Leader:

Domination Games on Infinite Graphs. 337-345 - Jefferey A. Shufelt, Hans J. Berliner:

Generating Hamiltonian Circuits without Backtracking from Errors. 347-375 - Amir M. Ben-Amram:

Unit-Cost Pointers versus Logarithmic-Cost Addresses. 377-385 - Douglas S. Bridges, Cristian Calude

:
On Recursive Bounds for the Exceptional Values in Speed-Up. 387-394 - Pierre Lescanne:

On Termination of One Rule Rewrite Systems. 395-401 - Maxime Crochemore, Wojciech Rytter:

On Two-Dimensional Pattern Matching by Optimal Parallel Algorithms. 403-414 - Jean Berstel, Michel Pocchiola:

Average Cost of Duval's Algorithm for Generating Lyndon Words. 415-425 - Lucian Ilie

:
On a Conjecture about Slender Context-Free Languages. 427-434 - Pavol Duris, José D. P. Rolim:

A Note on the Density of Oracle Decreasing Time-Space Complexity. 435-444

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.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














