default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID3. LATIN 1998: Campinas, Brazil
- Claudio L. Lucchesi, Arnaldo V. Moura:
LATIN '98: Theoretical Informatics, Third Latin American Symposium, Campinas, Brazil, April, 20-24, 1998, Proceedings. Lecture Notes in Computer Science 1380, Springer 1998, ISBN 3-540-64275-7
Algorithms, Complexity
- Daniel Panario
, Alfredo Viola:
Analysis of Rabin's Polynomial Irreducability Test. 1-10 - Peter Damaschke:
A Chip Search Problem on Binary Numbers. 11-22 - Esteban Feuerstein:
Uniform Service Systems with k Servers. 23-32 - David Fernández-Baca:
Faster Non-linear Parametric Search with Applications to Optimazation and Dynamic Geometry. 33-41
Automata, Transition Systems, Combinatorics on Words
- Frédérique Bassino, Marie-Pierre Béal, Dominique Perrin:
Super-State Automata and Rational Trees. 42-52 - Nicolas Bedon, Olivier Carton:
An Eilenberg Theorem for Words on Countable Ordinals. 53-64 - Alair Pereira do Lago:
Maximal Groups in Free Burnside Semigroups. 65-75 - Jean-Eric Pin:
Positive Varieties and Infinite Words. 76-87 - Marcos Veloso Peixoto, Laurent Fribourg:
Unfolding Parametric Automata. 88-101 - Alain Finkel, Philippe Schnoebelen:
Fundamental Structures in Well-Structured Infinite Transition Systems. 102-118
Computational Geometry, Graph Drawing
- Herbert Edelsbrunner:
Shape Reconstruction with Delaunay Complex. 119-132 - Anamaria Gomide, Jorge Stolfi:
Bases for Non-homogeneous Polynomial Ck Splines on the Sphere. 133-140 - Luérbio Faria, Celina M. H. de Figueiredo, Candido Ferreira Xavier de Mendonça Neto:
The Splitting Number of the 4-Cube. 141-150 - James Abello, Emden R. Gansner:
Short and Smooth Polygonal Paths. 151-162
Cryptography
- Gilles Brassard, Peter Høyer, Alain Tapp:
Quantum Cryptanalysis of Hash and Claw-Free Functions. 163-169 - Mihir Bellare, Juan A. Garay, Tal Rabin:
Batch Verification with Applications to Cryptography and Checking. 170-191 - Alejandro Hevia, Marcos A. Kiwi:
Strength of Two Data Encryption Standard Implementations under Timing Attacks. 192-205
Graph Theory, Algorithms on Graphs
- Noga Alon:
Spectral Techniques in Graph Algorithms. 206-215 - Michael Molloy, Bruce A. Reed:
Colouring Graphs whose Chromatic Number Is Almost Their Maximum Degree. 216-225 - Orlando Lee, Yoshiko Wakabayashi:
Circuit Covers in Series-Parallel Mixed Graphs. 226-238 - Elias Dahlhaus:
A Linear Time Algorithm to Recognize Clustered Graphs and Its Parallelization. 239-248 - Klaus Jansen:
A New Characterization for Parity Graphs and a Coloring Problem with Costs. 249-260 - Marisa Gutierrez, João Meidanis:
On the Clique Operator. 261-272
Packet Routing
- Andrei Z. Broder, Alan M. Frieze, Eli Upfal:
Dynamic Packet Routing on Arrays with Bounded Buffers. 273-281 - Alan Roberts, Antonios Symvonis:
On-Line Matching Routing on Trees. 282-291
Parallel Algorithms
- Dana Randall, Prasad Tetali:
Analyzing Glauber Dynamics by Comparison of Markov Chains. 292-304 - Joachim von zur Gathen, Igor E. Shparlinski:
The CREW PRAM Complexity of Modular Inversion. 305-315 - Friedhelm Meyer auf der Heide, Gabriel Terán Martinez:
Communication-Efficient Parallel Multiway and Approximate Minimum Cut Computation. 316-330
Pattern Matching, Browsing
- Richard Beigel, Egemen Tanin:
The Geometry of Browsing. 331-340 - Ricardo A. Baeza-Yates, Gonzalo Navarro:
Fast Two-Dimensional Approximate Pattern Matching. 341-351 - Gonzalo Navarro:
Improved Approximate Pattern Matching on Hypertext. 352-357 - Claudio Gutierrez:
Solving Equations in Strings: On Makanin's Algorithm. 358-373 - Marie-France Sagot:
Spelling Approximate Repeated or Common Motifs Using a Suffix Tree. 374-390
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-11-18 22:37 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:
