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