LATIN B

34 papers

YearTitle / Authors
1998A Chip Search Problem on Binary Numbers.
Peter Damaschke
1998A Linear Time Algorithm to Recognize Clustered Graphs and Its Parallelization.
Elias Dahlhaus
1998A New Characterization for Parity Graphs and a Coloring Problem with Costs.
Klaus Jansen
1998An Eilenberg Theorem for Words on Countable Ordinals.
Nicolas Bedon, Olivier Carton
1998Analysis of Rabin's Polynomial Irreducability Test.
Daniel Panario, Alfredo Viola
1998Analyzing Glauber Dynamics by Comparison of Markov Chains.
Dana Randall, Prasad Tetali
1998Bases for Non-homogeneous Polynomial C
Anamaria Gomide, Jorge Stolfi
1998Batch Verification with Applications to Cryptography and Checking.
Mihir Bellare, Juan A. Garay, Tal Rabin
1998Circuit Covers in Series-Parallel Mixed Graphs.
Orlando Lee, Yoshiko Wakabayashi
1998Colouring Graphs whose Chromatic Number Is Almost Their Maximum Degree.
Michael Molloy, Bruce A. Reed
1998Communication-Efficient Parallel Multiway and Approximate Minimum Cut Computation.
Friedhelm Meyer auf der Heide, Gabriel Terán Martinez
1998Dynamic Packet Routing on Arrays with Bounded Buffers.
Andrei Z. Broder, Alan M. Frieze, Eli Upfal
1998Fast Two-Dimensional Approximate Pattern Matching
Ricardo A. Baeza-Yates, Gonzalo Navarro
1998Faster Non-linear Parametric Search with Applications to Optimazation and Dynamic Geometry.
David Fernández-Baca
1998Fundamental Structures in Well-Structured Infinite Transition Systems.
Alain Finkel, Philippe Schnoebelen
1998Improved Approximate Pattern Matching on Hypertext.
Gonzalo Navarro
1998LATIN '98: Theoretical Informatics, Third Latin American Symposium, Campinas, Brazil, April, 20-24, 1998, Proceedings
Claudio L. Lucchesi, Arnaldo V. Moura
1998Maximal Groups in Free Burnside Semigroups.
Alair Pereira do Lago
1998On the Clique Operator.
Marisa Gutierrez, João Meidanis
1998On-Line Matching Routing on Trees.
Alan Roberts, Antonios Symvonis
1998Positive Varieties and Infinite Words.
Jean-Eric Pin
1998Quantum Cryptanalysis of Hash and Claw-Free Functions.
Gilles Brassard, Peter Høyer, Alain Tapp
1998Shape Reconstruction with Delaunay Complex.
Herbert Edelsbrunner
1998Short and Smooth Polygonal Paths.
James Abello, Emden R. Gansner
1998Solving Equations in Strings: On Makanin's Algorithm.
Claudio Gutierrez
1998Spectral Techniques in Graph Algorithms.
Noga Alon
1998Spelling Approximate Repeated or Common Motifs Using a Suffix Tree.
Marie-France Sagot
1998Strength of Two Data Encryption Standard Implementations under Timing Attacks.
Alejandro Hevia, Marcos A. Kiwi
1998Super-State Automata and Rational Trees.
Frédérique Bassino, Marie-Pierre Béal, Dominique Perrin
1998The CREW PRAM Complexity of Modular Inversion.
Joachim von zur Gathen, Igor E. Shparlinski
1998The Geometry of Browsing.
Richard Beigel, Egemen Tanin
1998The Splitting Number of the 4-Cube.
Luérbio Faria, Celina M. H. de Figueiredo, Candido Ferreira Xavier de Mendonça Neto
1998Unfolding Parametric Automata.
Marcos Veloso Peixoto, Laurent Fribourg
1998Uniform Service Systems with k Servers.
Esteban Feuerstein