The SCEAS System
Navigation Menu

Conferences in DBLP

Latin American Theoretical INformatics (LATIN) (latin)
2002 (conf/latin/2002)

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