LATIN B

43 papers

YearTitle / Authors
1992A Decidability Result about Convex Polyominoes.
Danièle Beauquier, Michel Latteux, Karine Slowinski
1992A Distributed Algorithm for finding All Maximal Cliques in a Network Graph.
Esther Jennings, Lenka Motyckova
1992A Simple Randomized Parallel Algorithm for Maximal
Oscar Garrido, Stefan Jarominek, Andrzej Lingas, Wojciech Rytter
1992Achieving Optimality for Gate Matrix Layout and PLA Folding: a Graph Theoretic Approach.
Afonso Ferreira, Siang W. Song
1992An Efficient Algorithm for Edge-Coloring Series-Parallel Multigraphs.
Xiao Zhou, Shin-Ichi Nakano, Hitoshi Suzuki, Takao Nishizeki
1992Approximate Matching of Network Expressions with Spacers.
Gene Myers
1992Arithmetic + Logic + Geometry = Concurrency.
Vaughan R. Pratt
1992Automata and Codes with Bounded Deciphering Delay.
Véronique Bruyère
1992Automata and Pattern Matching in Planar Directed Acyclic Graphs.
Francis Bossut, Bruno Warin
1992Average Case Analysis of a Greedy Algorithm for the Minimum Hitting Set Problem.
Wenceslas Fernandez de la Vega, Vangelis Th. Paschos, Rachid Saad
1992Circuits Constructed with
Denis Thérien
1992Complex Polynomials and Circuit Lower Bounds for Modular Counting.
David A. Mix Barrington, Howard Straubing
1992Complexity Issues in Neural Network Computations.
Michel Cosnard, Pascal Koiran, Hélène Paugam-Moisy
1992Data Structures and Terminating Petri Nets.
Daniel Dominic Sleator
1992Decomposing a
Andreas Weber
1992Dynamics of Sand-Piles Games on Graphs.
Eric Goles Ch., Marcos A. Kiwi
1992Edge Insertion for Optional Triangulations.
Marshall W. Bern, Herbert Edelsbrunner, David Eppstein, Scott A. Mitchell, Tiow Seng Tan
1992Even Induced Cycles in Planar Graphs.
Oscar Porto
1992Factoring in Skew-Polynomial Rings.
Mark Giesbrecht
1992How to Write Integers in Non-Integer Base.
Christiane Frougny
1992Improved Bounds for Mixing Rates of Marked Chains and Multicommodity Flow.
Alistair Sinclair
1992LATIN '92, 1st Latin American Symposium on Theoretical Informatics, São Paulo, Brazil, April 6-10, 1992, Proceedings
Imre Simon
1992Leaders Election Without Conflict Resolution Rule - Fast and Efficient Randomized Simulations among CRCW PRAMs.
Joseph Gil, Yossi Matias
1992Linear Time Algorithms for Liveness and Boundedness in Conflict-free Petri Nets.
Paola Alimonti, Esteban Feuerstein, Umberto Nanni
1992Locally Definable Acceptance Types - The Three-Valued Case.
Ulrich Hertrampf
1992Massively Parallel Computing and Factoring.
Arjen K. Lenstra
1992On Reversible Automata.
Jean-Eric Pin
1992On the Burnside Semigroups
Alair Pereira do Lago
1992On the Complexity of Some Problems for the Blum, Shub & Smale Model.
Felipe Cucker, Francesc Rosselló
1992On the Computation of the Hilbert Series.
Joachim Hollman
1992On the Density and Core of the Complexity Classes.
José D. P. Rolim
1992On the Number Components of a Recursive Graph.
William I. Gasarch, Katia S. Guimarães
1992Parallel Complexity of Heaps and Min-Max Heaps.
Svante Carlsson, Jingsen Chen
1992Polynomial Factorization 1987-1991.
Erich L. Kaltofen
1992Properties of Recognizable
Nami Kobayashi
1992Rational Function Decomposition and Gröbner Bases in the Parameterization of Plane Curves (An extended abstract).
Jaime Gutierrez, Tomás Recio
1992Regular Expressions into Finite Automata.
Anne Brüggemann-Klein
1992Simulation Permutation Networks on Hypercubes.
Saïd Bettayeb, Bin Cong, Mike Girou, Ivan Hal Sudborough
1992Some Regularity Conditions Based on Well Quasi-Orders.
Aldo de Luca, Stefano Varricchio
1992The "Last" Decision Problem for Rational Trace Languages.
Jacques Sakarovitch
1992The Double Reconstruction Conjectures about Colored Hypergraphs and Colored Directed Graphs.
Kosaburo Hashiguchi
1992Unambiguous Simulations of Auxiliary Pushdown Automata and Circuits (Extended Abstract).
Rolf Niedermeier, Peter Rossmanith
1992Universal Statistical Tests.
Manuel Blum