default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID1. LATIN 1992: São Paulo, Brazil
- Imre Simon:
LATIN '92, 1st Latin American Symposium on Theoretical Informatics, São Paulo, Brazil, April 6-10, 1992, Proceedings. Lecture Notes in Computer Science 583, Springer 1992, ISBN 3-540-55284-7 - Paola Alimonti, Esteban Feuerstein, Umberto Nanni
:
Linear Time Algorithms for Liveness and Boundedness in Conflict-free Petri Nets. 1-14 - Jean-Paul Allouche:
q-Regular Sequences and Other Generalizations of q-Automatic Sequences. 15-23 - David A. Mix Barrington, Howard Straubing:
Complex Polynomials and Circuit Lower Bounds for Modular Counting. 24-31 - Danièle Beauquier, Michel Latteux, Karine Slowinski:
A Decidability Result about Convex Polyominoes. 32-45 - Marshall W. Bern, Herbert Edelsbrunner, David Eppstein, Scott A. Mitchell, Tiow Seng Tan:
Edge Insertion for Optional Triangulations. 46-60 - Saïd Bettayeb, Bin Cong, Mike Girou, Ivan Hal Sudborough:
Simulation Permutation Networks on Hypercubes. 61-70 - Manuel Blum:
Universal Statistical Tests. 71-75 - Francis Bossut, Bruno Warin:
Automata and Pattern Matching in Planar Directed Acyclic Graphs. 76-86 - Anne Brüggemann-Klein:
Regular Expressions into Finite Automata. 87-98 - Véronique Bruyère:
Automata and Codes with Bounded Deciphering Delay. 99-107 - Svante Carlsson, Jingsen Chen:
Parallel Complexity of Heaps and Min-Max Heaps. 108-116 - Felipe Cucker, Francesc Rosselló:
On the Complexity of Some Problems for the Blum, Shub & Smale Model. 117-129 - Wenceslas Fernandez de la Vega, Vangelis Th. Paschos, Rachid Saad:
Average Case Analysis of a Greedy Algorithm for the Minimum Hitting Set Problem. 130-138 - Afonso Ferreira, Siang W. Song:
Achieving Optimality for Gate Matrix Layout and PLA Folding: a Graph Theoretic Approach. 139-153 - Christiane Frougny:
How to Write Integers in Non-Integer Base. 154-164 - Oscar Garrido, Stefan Jarominek, Andrzej Lingas, Wojciech Rytter:
A Simple Randomized Parallel Algorithm for Maximal f-Matching. 165-176 - William I. Gasarch, Katia S. Guimarães:
On the Number Components of a Recursive Graph. 177-190 - Mark Giesbrecht:
Factoring in Skew-Polynomial Rings. 191-203 - Joseph Gil, Yossi Matias:
Leaders Election Without Conflict Resolution Rule - Fast and Efficient Randomized Simulations among CRCW PRAMs. 204-218 - Eric Goles Ch., Marcos A. Kiwi:
Dynamics of Sand-Piles Games on Graphs. 219-230 - Jaime Gutierrez, Tomás Recio:
Rational Function Decomposition and Gröbner Bases in the Parameterization of Plane Curves (An extended abstract). 231-245 - Kosaburo Hashiguchi:
The Double Reconstruction Conjectures about Colored Hypergraphs and Colored Directed Graphs. 246-261 - Ulrich Hertrampf:
Locally Definable Acceptance Types - The Three-Valued Case. 262-271 - Joachim Hollman:
On the Computation of the Hilbert Series. 272-280 - Esther Jennings, Lenka Motyckova:
A Distributed Algorithm for finding All Maximal Cliques in a Network Graph. 281-293 - Erich L. Kaltofen:
Polynomial Factorization 1987-1991. 294-313 - Nami Kobayashi:
Properties of Recognizable M-Subsets of a Free Monoid. 314-328 - Alair Pereira do Lago:
On the Burnside Semigroups xn = xn+m. 329-343 - Arjen K. Lenstra:
Massively Parallel Computing and Factoring. 344-355 - Aldo de Luca, Stefano Varricchio:
Some Regularity Conditions Based on Well Quasi-Orders. 356-371 - Gene Myers:
Approximate Matching of Network Expressions with Spacers. 372-386 - Rolf Niedermeier, Peter Rossmanith:
Unambiguous Simulations of Auxiliary Pushdown Automata and Circuits (Extended Abstract). 387-400 - Jean-Eric Pin:
On Reversible Automata. 401-416 - Oscar Porto:
Even Induced Cycles in Planar Graphs. 417-429 - Vaughan R. Pratt:
Arithmetic + Logic + Geometry = Concurrency. 430-447 - José D. P. Rolim:
On the Density and Core of the Complexity Classes. 448-459 - Jacques Sakarovitch:
The "Last" Decision Problem for Rational Trace Languages. 460-473 - Alistair Sinclair:
Improved Bounds for Mixing Rates of Marked Chains and Multicommodity Flow. 474-487 - Daniel Dominic Sleator:
Data Structures and Terminating Petri Nets. 488-497 - Denis Thérien:
Circuits Constructed with MODq Gates Cannot Compute AND in Sublinear Size. 498-502 - Andreas Weber:
Decomposing a k-valued Transducer into k Unambiguous Ones. 503-515 - Xiao Zhou, Shin-Ichi Nakano, Hitoshi Suzuki, Takao Nishizeki:
An Efficient Algorithm for Edge-Coloring Series-Parallel Multigraphs. 516-529 - Michel Cosnard, Pascal Koiran, Hélène Paugam-Moisy:
Complexity Issues in Neural Network Computations. 530-543
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-01-23 20:36 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:
