Jennifer Chayes, Phase Transitions in Computer Science. [Bibtex]
Christos Papadimitriou, The Internet, the Web, and Algorithms. [Bibtex] Joel Spencer, Erdos Magic. [Bibtex] Jorge Urrutia, Open Problems in Computational Geometry. [Bibtex] Umesh V. Vazirani, Quantum Algorithms. [Bibtex] Mihalis Yannakakis, Testing and Checking of Finite State Systems. [Bibtex] Fabrizio Luccio and Linda Pagli, From Algorithms to Cryptography. [Bibtex] Eric Goubault and Martin Raussen, Dihomotopy as a Tool in State Space Analysis. [Bibtex] Abdullah N. Arslan and Ömer Egecioglu, Algorithms for Local Alignment with Length Constraints. [Bibtex] Marília D. V. Braga and Joao Meidanis, An Algorithm That Builds a Set of Strings Given Its Overlap Graph. [Bibtex] Christiane Frougny, Conversion between Two Multiplicatively Dependent Linear Numeration Systems. [Bibtex] Sylvain Lombardy and Jacques Sakarovitch, Star Height of Reversible Languages and Universal Automata. [Bibtex] Howard Straubing and Denis Thérien, Weakly Iterated Block Products of Finite Monoids. [Bibtex] Maria Isabel Gonzalez Vasco, Mats Näslund and Igor Shparlinski, The Hidden Number Problem in Extension Fields and Its Applications. [Bibtex] Theodoulos Garefalakis, The Generalized Weil Pairing and the Discrete Logarithm Problem on Elliptic Curves. [Bibtex] Rod Canfield, Sylvie Corteel and Pawel Hitczenko, Random Partitions with Non Negative rth Differences. [Bibtex] Frédérique Bassino, Beta-Expansions for Cubic Pisot Numbers. [Bibtex] Prosenjit Bose and Qingda Wang, Facility Location Constrained to a Polygonal Domain. [Bibtex] Hanno Lefmann and Niels Schmitt, A Deterministic Polynomial Time Algorithm for Heilbronn's Problem in Dimension Three. [Bibtex] Edgar Chávez and Gonzalo Navarro, A Metric Index for Approximate String Matching. [Bibtex] Wojciech Rytter, On Maximal Suffices and Constant-Space Linear-Time Versions of KMP Algorithm. [Bibtex] Derek G. Corneil, Feodor F. Dragan and Ekkehard Köhler, On the Power of BFS to Determine a Graphs Diameter. [Bibtex] Martín Matamala, Erich Prisner and Ivan Rapaport, k-pseudosnakes in Large Grids. [Bibtex] Tiziana Calamoneri and Rossella Petreschi, L(2, 1)-Coloring Matrogenic Graphs. [Bibtex] Ruy Luiz Milidiú, Artur Alves Pessoa and Eduardo Sany Laber, Pipeline Transportation of Petroleum Products with No Due Dates. [Bibtex] Enrico Pontelli and Desh Ranjan, Ancestor Problems on Pure Pointer Machines. [Bibtex] Renato Carmo, Jair Donadelli, Yoshiharu Kohayakawa and Eduardo Sany Laber, Searching in Random Partially Ordered Sets. [Bibtex] Brett Stevens and Eric Mendelsohn, Packing Arrays. [Bibtex] Michael Drmota and Wojciech Szpankowski, Generalized Shannon Code Minimizes the Maximal Redundancy. [Bibtex] S. Muthukrishnan and Cenk Sahinalp, An Improved Algorithm for Sequence Comparison with Block Reversals. [Bibtex] Blaise Genest and Anca Muscholl, Pattern Matching and Membership for Hierarchical Message Sequence Charts. [Bibtex] Jianer Chen and Iyad Kanj, Improved Exact Algorithms for MAX-SAT. [Bibtex] Steffen van Bakel and Mariangiola Dezani-Ciancaglini, Characterising Strong Normalisation for Explicit Substitutions. [Bibtex] Roel Bloo, Fairouz Kamareddine, Twan Laan and Rob Nederpelt, Parameters in Pure Type Systems. [Bibtex] Rusins Freivalds and Carl H. Smith, Category, Measure, Inductive Inference: A Triality Theorem and Its Applications. [Bibtex] Frédéric Herbreteau, Franck Cassez, Alain Finkel, Olivier Roux and Grégoire Sutre, Verification of Embedded Reactive Fiffo Systems. [Bibtex] Alejandro Hevia and Marcos Kiwi, Electronic Jury Voting Protocols. [Bibtex] Gonzalo Tornaría, Square Roots Modulo p. [Bibtex] Goran Konjevod, Soohyun Oh and Andréa W. Richa, Finding Most Sustainable Paths in Networks with Time-Dependent Edge Reliabilities. [Bibtex] Jean-Christophe Dubacq and Véronique Terrier, Signals for Cellular Automata in Dimension 2 or Higher. [Bibtex] Paolo Boldi and Sebastiano Vigna, Holographic Trees. [Bibtex] Prosenjit Bose, Luc Devroye, William S. Evans and David G. Kirkpatrick, On the Spanning Ratio of Gabriel Graphs and beta-skeletons. [Bibtex] Hervé Brönnimann, John Iacono, Jyrki Katajainen, Pat Morin, Jason Morrison and Godfried T. Toussaint, In-Place Planar Convex Hull Algorithms. [Bibtex] Michael A. Bender and Martin Farach-Colton, The Level Ancestor Problem Simplified. [Bibtex] Claudson F. Bornstein and Santosh Vempala, Flow Metrics. [Bibtex] Howard Straubing, On Logical Descriptions of Regular Languages. [Bibtex] Mario Szegedy and Xiaomin Chen, Computing Boolean Functions from Multiple Faulty Copies of Input Bits. [Bibtex] Magnús M. Halldórsson, Kazuo Iwama, Shuichi Miyazaki and Yasufumi Morita, Inapproximability Results on Stable Marriage Problems. [Bibtex] Hadas Shachnai and Tami Tamir, Tight Bounds for Online Class-Constrained Packing. [Bibtex] R. Sai Anand and Thomas Erlebach, On-line Algorithms for Edge-Disjoint Paths in Trees of Rings. [Bibtex] James Abello, Mauricio G. C. Resende and Sandra Sudarsky, Massive Quasi-Clique Detection. [Bibtex] Jochen Alber and Rolf Niedermeier, Improved Tree Decomposition Based Algorithms for Domination-like Problems. [Bibtex] |
[Home] [All LATIN Papers] [LATIN 2002] |