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