default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID5. LATIN 2002: Cancun, Mexico
- Sergio Rajsbaum:
LATIN 2002: Theoretical Informatics, 5th Latin American Symposium, Cancun, Mexico, April 3-6, 2002, Proceedings. Lecture Notes in Computer Science 2286, Springer 2002, ISBN 3-540-43400-3
Invited Talks and Tutorials
- Jennifer T. Chayes
:
Phase Transitions in Computer Science. 1 - Christos H. Papadimitriou:
The Internet, the Web, and Algorithms. 2 - Joel Spencer:
Erdős Magic. 3 - Jorge Urrutia:
Open Problems in Computational Geometry. 4-11 - Umesh V. Vazirani:
Quantum Algorithms. 12-13 - Mihalis Yannakakis:
Testing and Checking of Finite State Systems. 14 - Fabrizio Luccio, Linda Pagli:
From Algorithms to Cryptography. 15 - Eric Goubault, Martin Raußen:
Dihomotopy as a Tool in State Space Analysis. 16-37
Regular Contributions
- Abdullah N. Arslan, Ömer Egecioglu:
Algorithms for Local Alignment with Length Constraints. 38-51 - Marília D. V. Braga, Joao Meidanis:
An Algorithm That Builds a Set of Strings Given Its Overlap Graph. 52-63 - Christiane Frougny:
Conversion between Two Multiplicatively Dependent Linear Numeration Systems. 64-75 - Sylvain Lombardy, Jacques Sakarovitch:
Star Height of Reversible Languages and Universal Automata. 76-90 - Howard Straubing, Denis Thérien:
Weakly Iterated Block Products of Finite Monoids. 91-104 - María Isabel González Vasco, Mats Näslund, Igor E. Shparlinski:
The Hidden Number Problem in Extension Fields and Its Applications. 105-117 - Theodoulos Garefalakis:
The Generalized Weil Pairing and the Discrete Logarithm Problem on Elliptic Curves. 118-130 - E. Rodney Canfield, Sylvie Corteel, Pawel Hitczenko:
Random Partitions with Non Negative rth Differences. 131-140 - Frédérique Bassino:
Beta-Expansions for Cubic Pisot Numbers. 141-152 - Prosenjit Bose, Qingda Wang:
Facility Location Constrained to a Polygonal Domain. 153-164 - Hanno Lefmann, Niels Schmitt:
A Deterministic Polynomial Time Algorithm for Heilbronn's Problem in Dimension Three. 165-180 - Edgar Chávez, Gonzalo Navarro:
A Metric Index for Approximate String Matching. 181-195 - Wojciech Rytter:
On Maximal Suffices and Constant-Space Linear-Time Versions of KMP Algorithm. 196-208 - Derek G. Corneil, Feodor F. Dragan, Ekkehard Köhler:
On the Power of BFS to Determine a Graphs Diameter. 209-223 - Martín Matamala, Erich Prisner, Ivan Rapaport:
k-pseudosnakes in Large Grids. 224-235 - Tiziana Calamoneri, Rossella Petreschi:
L(2, 1)-Coloring Matrogenic Graphs. 236-247 - Ruy Luiz Milidiú, Artur Alves Pessoa, Eduardo Sany Laber:
Pipeline Transportation of Petroleum Products with No Due Dates. 248-262 - Enrico Pontelli, Desh Ranjan:
Ancestor Problems on Pure Pointer Machines. 263-277 - Renato Carmo, Jair Donadelli, Yoshiharu Kohayakawa, Eduardo Sany Laber:
Searching in Random Partially Ordered Sets. 278-292 - Brett Stevens, Eric Mendelsohn:
Packing Arrays. 293-305 - Michael Drmota, Wojciech Szpankowski:
Generalized Shannon Code Minimizes the Maximal Redundancy. 306-318 - S. Muthukrishnan, Süleyman Cenk Sahinalp:
An Improved Algorithm for Sequence Comparison with Block Reversals. 319-325 - Blaise Genest, Anca Muscholl:
Pattern Matching and Membership for Hierarchical Message Sequence Charts. 326-340 - Jianer Chen, Iyad A. Kanj:
Improved Exact Algorithms for MAX-SAT. 341-355 - Steffen van Bakel, Mariangiola Dezani-Ciancaglini:
Characterising Strong Normalisation for Explicit Substitutions. 356-370 - Roel Bloo, Fairouz Kamareddine, Twan Laan, Rob Nederpelt:
Parameters in Pure Type Systems. 371-385 - Rusins Freivalds, Carl H. Smith:
Category, Measure, Inductive Inference: A Triality Theorem and Its Applications. 386-399 - Frédéric Herbreteau, Franck Cassez, Alain Finkel, Olivier F. Roux, Grégoire Sutre:
Verification of Embedded Reactive Fiffo Systems. 400-414 - Alejandro Hevia, Marcos A. Kiwi:
Electronic Jury Voting Protocols. 415-429 - Gonzalo Tornaría:
Square Roots Modulo p. 430-434 - Goran Konjevod, Soohyun Oh, Andréa W. Richa:
Finding Most Sustainable Paths in Networks with Time-Dependent Edge Reliabilities. 435-450 - Jean-Christophe Dubacq, Véronique Terrier:
Signals for Cellular Automata in Dimension 2 or Higher. 451-464 - Paolo Boldi, Sebastiano Vigna:
Holographic Trees. 465-478 - Prosenjit Bose, Luc Devroye, William S. Evans, David G. Kirkpatrick:
On the Spanning Ratio of Gabriel Graphs and beta-skeletons. 479-493 - Hervé Brönnimann, John Iacono, Jyrki Katajainen, Pat Morin, Jason Morrison, Godfried T. Toussaint:
In-Place Planar Convex Hull Algorithms. 494-507 - Michael A. Bender, Martin Farach-Colton:
The Level Ancestor Problem Simplified. 508-515 - Claudson F. Bornstein, Santosh S. Vempala:
Flow Metrics. 516-527 - Howard Straubing:
On Logical Descriptions of Regular Languages. 528-538 - Mario Szegedy, Xiaomin Chen:
Computing Boolean Functions from Multiple Faulty Copies of Input Bits. 539-553 - Magnús M. Halldórsson, Kazuo Iwama, Shuichi Miyazaki, Yasufumi Morita:
Inapproximability Results on Stable Marriage Problems. 554-568 - Hadas Shachnai, Tami Tamir:
Tight Bounds for Online Class-Constrained Packing. 569-583 - R. Sai Anand, Thomas Erlebach:
On-line Algorithms for Edge-Disjoint Paths in Trees of Rings. 584-597 - James Abello, Mauricio G. C. Resende, Sandra Sudarsky:
Massive Quasi-Clique Detection. 598-612 - Jochen Alber, Rolf Niedermeier:
Improved Tree Decomposition Based Algorithms for Domination-like Problems. 613-628
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 2024-10-31 20:03 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:
