The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. Mike Paterson
    Analysis of Scheduling Algorithms for Proportionate Fairness. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:1- [Conf]
  2. Yoshiharu Kohayakawa
    Advances in the Regularity Method. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:2- [Conf]
  3. Cynthia Dwork
    Fighting Spam: The Science. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:3-4 [Conf]
  4. Jean-Eric Pin
    The Consequences of Imre Simon's Work in the Theory of Automata, Languages, and Semigroups. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:5- [Conf]
  5. Eduardo Sany Laber, Renato Carmo, Yoshiharu Kohayakawa
    Querying Priced Information in Databases: The Conjunctive Case. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:6-15 [Conf]
  6. Funda Ergün, S. Muthukrishnan, Süleyman Cenk Sahinalp
    Sublinear Methods for Detecting Periodic Trends in Data Streams. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:16-28 [Conf]
  7. Graham Cormode, S. Muthukrishnan
    An Improved Data Stream Summary: The Count-Min Sketch and Its Applications. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:29-38 [Conf]
  8. Kimmo Fredriksson, Veli Mäkinen, Gonzalo Navarro
    Rotation and Lighting Invariant Template Matching. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:39-48 [Conf]
  9. Josep Díaz, Maria J. Serna, Nicholas C. Wormald
    Computation of the Bisection Width for Random d-Regular Graphs. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:49-58 [Conf]
  10. Christian Borgs, Jennifer T. Chayes, Stephan Mertens, Boris Pittel
    Constrained Integer Partitions. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:59-68 [Conf]
  11. Abraham Flaxman, David Gamarnik, Gregory B. Sorkin
    Embracing the Giant Component. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:69-79 [Conf]
  12. Dimitris Achlioptas, Michael S. O. Molloy, Cristopher Moore, Frank Van Bussel
    Sampling Grid Colorings with Fewer Colors. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:80-89 [Conf]
  13. Lane A. Hemaspaandra, Mitsunori Ogihara, Mohammed Javeed Zaki, Marius Zimand
    The Complexity of Finding Top-Toda-Equivalence-Class Members. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:90-99 [Conf]
  14. Tomás Feder, Pavol Hell, Sulamita Klein, Loana Tito Nogueira, Fábio Protti
    List Partitions of Chordal Graphs. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:100-108 [Conf]
  15. Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos
    Bidimensional Parameters and Local Treewidth. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:109-118 [Conf]
  16. Frank Gurski, Egon Wanke
    Vertex Disjoint Paths on Clique-Width Bounded Graphs. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:119-128 [Conf]
  17. Frédéric Gardi
    On Partitioning Interval and Circular-Arc Graphs into Proper Interval Subgraphs with Applications. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:129-140 [Conf]
  18. Pierre Fraigniaud, Leszek Gasieniec, Dariusz R. Kowalski, Andrzej Pelc
    Collective Tree Exploration. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:141-151 [Conf]
  19. Alper Üngör
    O.-Centers: A New Type of Steiner Points for Computing Size-Optimal Quality-Guaranteed Delaunay Triangulations. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:152-161 [Conf]
  20. Hervé Brönnimann, Timothy M. Chan
    Space-E.cient Algorithms for Computing the Convex Hull of a Simple Polygonal Line in Linear Time. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:162-171 [Conf]
  21. Claudio Gutiérrez, Flavio Gutierrez, Maria-Cecilia Rivara
    A Geometric Approach to the Bisection Method. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:172-180 [Conf]
  22. H. K. Dai, Xi-Wen Zhang
    Improved Linear Expected-Time Algorithms for Computing Maxima. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:181-192 [Conf]
  23. Jens S. Kohrt, Kirk Pruhs
    A Constant Approximation Algorithm for Sorting Buffers. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:193-202 [Conf]
  24. Kirk Pruhs, Gerhard J. Woeginger
    Approximation Schemes for a Class of Subset Selection Problems. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:203-211 [Conf]
  25. Prabhakar Gubbala, Balaji Raghavachari
    Finding k-Connected Subgraphs with Minimum Average Weight. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:212-221 [Conf]
  26. Ke Yang
    On the (Im)possibility of Non-interactive Correlation Distillation. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:222-231 [Conf]
  27. Volker Diekert, Paul Gastin
    Pure Future Local Temporal Logics Are Expressively Complete for Mazurkiewicz Traces. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:232-241 [Conf]
  28. Sylvain Lombardy, Jacques Sakarovitch
    How Expressions Can Code for Automata. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:242-251 [Conf]
  29. Shigeki Akiyama, Frédérique Bassino, Christiane Frougny
    Automata for Arithmetic Meyer Sets. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:252-261 [Conf]
  30. Manuel Bodirsky, Tobias Gärtner, Timo von Oertzen, Jan Schwinghammer
    Effciently Computing the Density of Regular Languages. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:262-270 [Conf]
  31. Maxime Crochemore, Costas S. Iliopoulos, Manal Mohamed, Marie-France Sagot
    Longest Repeats with a Block of Don't Cares. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:271-278 [Conf]
  32. John Rhodes, Benjamin Steinberg
    Join Irreducible Pseudovarieties, Group Mapping, and Kovács-Newman Semigroups. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:279-291 [Conf]
  33. Olivier Carton, Chloe Rispal
    Complementation of Rational Sets on Scattered Linear Orderings of Finite Rank. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:292-301 [Conf]
  34. Marcos A. Kiwi, Martin Loebl, Jirí Matousek
    Expected Length of the Longest Common Subsequence for Large Alphabets. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:302-311 [Conf]
  35. Gadiel Seroussi
    Universal Types and Simulation of Individual Sequences. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:312-321 [Conf]
  36. Gérard D. Cohen, Hans Georg Schaathun
    Separating Codes: Constructions and Bounds. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:322-328 [Conf]
  37. Sergei Bespamyatnikh
    Encoding Homotopy of Paths in the Plane. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:329-338 [Conf]
  38. Saverio Caminiti, Irene Finocchi, Rossella Petreschi
    A Unified Approach to Coding Labeled Trees. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:339-348 [Conf]
  39. Hervé Brönnimann, Marc Glisse
    Cost-Optimal Trees for Ray Shooting. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:349-358 [Conf]
  40. Flávio Keidi Miyazawa, Yoshiko Wakabayashi
    Packing Problems with Orthogonal Rotations. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:359-368 [Conf]
  41. Alantha Newman, Matthias Ruhl
    Combinatorial Problems on Strings with Applications to Protein Folding. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:369-378 [Conf]
  42. Mark Cieliebak, Stephan Eidenbenz
    Measurement Errors Make the Partial Digest Problem NP-Hard. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:379-390 [Conf]
  43. Jean Cardinal, Stefan Langerman
    Designing Small Keyboards Is Hard. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:391-400 [Conf]
  44. James R. Lee, Manor Mendel, Assaf Naor
    Metric Structures in L1: Dimension, Snowflakes, and Average Distortion. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:401-412 [Conf]
  45. Richard J. Lipton, Evangelos Markakis
    Nash Equilibria via Polynomial Equations. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:413-422 [Conf]
  46. Raja Jothi, Balaji Raghavachari
    Minimum Latency Tours and the k-Traveling Repairmen Problem. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:423-433 [Conf]
  47. Nikhil Bansal, Kirk Pruhs
    Server Scheduling in the Weighted lp Norm. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:434-443 [Conf]
  48. Martin Fürer
    An Improved Communication-Randomness Tradeo. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:444-454 [Conf]
  49. Paul Gastin, Benjamin Lerman, Marc Zeitoun
    Distributed Games and Distributed Control for Asynchronous Systems. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:455-465 [Conf]
  50. Mihai Badoiu, Erik D. Demaine
    A Simplified, Dynamic Unified Structure. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:466-473 [Conf]
  51. Ali Akhavi, Céline Moreira Dos Santos
    Another View of the Gaussian Algorithm. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:474-487 [Conf]
  52. Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan
    Generating Maximal Independent Sets for Hypergraphs with Bounded Edge-Intersections. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:488-498 [Conf]
  53. Jesper Jansson, Joseph H.-K. Ng, Kunihiko Sadakane, Wing-Kin Sung
    Rooted Maximum Agreement Supertrees. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:499-508 [Conf]
  54. Edith Hemaspaandra, Holger Spakowski, Mayur Thakur
    Complexity of Cycle Length Modularity Problems in Graphs. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:509-518 [Conf]
  55. Dusan Guller
    Procedural Semantics for Fuzzy Disjunctive Programs on Residuated Lattices. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:519-529 [Conf]
  56. Olga Tveretina, Hans Zantema
    A Proof System and a Decision Procedure for Equality Logic. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:530-539 [Conf]
  57. Argimiro Arratia, Carlos E. Ortiz
    Approximating the Expressive Power of Logics in Finite Models. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:540-556 [Conf]
  58. Joachim von zur Gathen
    Arithmetic Circuits for Discrete Logarithms. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:557-566 [Conf]
  59. Jeff Edmonds
    On the Competitiveness of AIMD-TCP within a General Network. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:567-576 [Conf]
  60. Mark Cieliebak
    Gathering Non-oblivious Mobile Robots. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:577-588 [Conf]
  61. Bernard Mans, Igor Shparlinski
    Bisecting and Gossiping in Circulant Graphs. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:589-598 [Conf]
  62. Paola Flocchini, Evangelos Kranakis, Danny Krizanc, Nicola Santoro, Cindy Sawchuk
    Multiple Mobile Agent Rendezvous in a Ring. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:599-608 [Conf]
  63. Jeremy Elson, Richard M. Karp, Christos H. Papadimitriou, Scott Shenker
    Global Synchronization in Sensornets. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:609-624 [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