The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. James Abello, Krishna Kumar
    Visibility Graphs of 2-Spiral Polygons (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    LATIN, 1995, pp:1-15 [Conf]
  2. Laurent Alonso, René Schott
    Random Generation of Colored Trees. [Citation Graph (0, 0)][DBLP]
    LATIN, 1995, pp:16-35 [Conf]
  3. Tetsuo Asano, Desh Ranjan, Thomas Roos, Emo Welzl, Peter Widmayer
    Space Filling Curves and Their Use in the Design of Geometric Data Structures. [Citation Graph (0, 0)][DBLP]
    LATIN, 1995, pp:36-48 [Conf]
  4. R. Balasubramanian, Venkatesh Raman, G. Srinivasaraghavan
    Tight Bounds for Finding Degrees from the Adjacency Matrix. [Citation Graph (0, 0)][DBLP]
    LATIN, 1995, pp:49-59 [Conf]
  5. David A. Mix Barrington, Howard Straubing
    Lower Bounds for Modular Counting by Circuits with Modular Gates. [Citation Graph (0, 0)][DBLP]
    LATIN, 1995, pp:60-71 [Conf]
  6. Bernd Becker, Rolf Drechsler, Ralph Werchner
    On the Relation Betwen BDDs and FDDs. [Citation Graph (0, 0)][DBLP]
    LATIN, 1995, pp:72-83 [Conf]
  7. François Blanchard, Alejandro Maass
    On Dynamical Properties of Generalized Toggle Automata. [Citation Graph (0, 0)][DBLP]
    LATIN, 1995, pp:84-98 [Conf]
  8. Stephen L. Bloom, Zoltán Ésik
    Free Shuffle Algebras in Language Varieties (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    LATIN, 1995, pp:99-111 [Conf]
  9. Phillip G. Bradford, Venkatesh Chopella, Gregory J. E. Rawlins
    Lower Bounds for the Matrix Chain Ordering Problem (Extended bstract). [Citation Graph (0, 0)][DBLP]
    LATIN, 1995, pp:112-130 [Conf]
  10. Stefan Brands
    Off-Line Electronic Cash Based on Secret-Key Certificates. [Citation Graph (0, 0)][DBLP]
    LATIN, 1995, pp:131-166 [Conf]
  11. Véronique Bruyère, Georges Hansel
    Recognizable Sets of Numbers in Nonstandard Bases. [Citation Graph (0, 0)][DBLP]
    LATIN, 1995, pp:167-179 [Conf]
  12. Gerhard Buntrock, Gundula Niemann
    On Weak Growing Context-Sensitive Grammars. [Citation Graph (0, 0)][DBLP]
    LATIN, 1995, pp:180-194 [Conf]
  13. Benjamín René Callejas Bedregal, Benedito Melo Acióly
    Logic of Plotkin Continuous Domain. [Citation Graph (0, 0)][DBLP]
    LATIN, 1995, pp:195-206 [Conf]
  14. Shiva Chaudhuri, Devdatt P. Dubhashi
    (Probabilistic) Recurrence Realtions Revisited. [Citation Graph (0, 0)][DBLP]
    LATIN, 1995, pp:207-219 [Conf]
  15. Maxime Crochemore, Wojciech Rytter
    On Linear-Time Alphabet-Independent 2-Dimensional Pattern Matching. [Citation Graph (0, 0)][DBLP]
    LATIN, 1995, pp:220-229 [Conf]
  16. Jérôme Olivier Durand-Lose
    Reversible Cellular Automaton Able to Simulate Any Other Reversible One Using Partitioning Automata. [Citation Graph (0, 0)][DBLP]
    LATIN, 1995, pp:230-244 [Conf]
  17. Peter Eades, Sue Whitesides
    Nearest Neighbour Graph Realizability is NP-hard. [Citation Graph (0, 0)][DBLP]
    LATIN, 1995, pp:245-256 [Conf]
  18. David Fernández-Baca, Giora Slutzki
    Linear-Time Algorithms for Parametric Minimum Spanning Tree Problems on Planar Graphs. [Citation Graph (0, 0)][DBLP]
    LATIN, 1995, pp:257-271 [Conf]
  19. Esteban Feuerstein
    Paging More Than One Page. [Citation Graph (0, 0)][DBLP]
    LATIN, 1995, pp:272-285 [Conf]
  20. Celina M. Herrera de Figueiredo, João Meidanis, Célia Picinin de Mello
    On Edge-Colouring Indifference Graphs. [Citation Graph (0, 0)][DBLP]
    LATIN, 1995, pp:286-299 [Conf]
  21. Giulia Galbiati, Angelo Morzenti, Francesco Maffioli
    On the Approximability of some Maximum Spanning Tree Problems. [Citation Graph (0, 0)][DBLP]
    LATIN, 1995, pp:300-310 [Conf]
  22. Shuhong Gao, Joachim von zur Gathen, Daniel Panario
    Gauss Periods and Fast Exponentiation in Finite Fields (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    LATIN, 1995, pp:311-322 [Conf]
  23. William I. Gasarch, Katia S. Guimarães
    Unbounded Search and Recursive Graph Problems. [Citation Graph (0, 0)][DBLP]
    LATIN, 1995, pp:323-331 [Conf]
  24. Laureano González-Vega
    On the Complexity of Computing the Greatest Common Divisor of Several Univariate Polynomials. [Citation Graph (0, 0)][DBLP]
    LATIN, 1995, pp:332-345 [Conf]
  25. Jozef Gruska, Angelo Monti, Margherita Napoli, Domenico Parente
    State Complexity of SBTA Languages. [Citation Graph (0, 0)][DBLP]
    LATIN, 1995, pp:346-357 [Conf]
  26. Christian Herzog
    Pushdown Automata with Bounded Nondeterminism and Bounded Anbiguity. [Citation Graph (0, 0)][DBLP]
    LATIN, 1995, pp:358-370 [Conf]
  27. Ioan I. Macarie
    Multihead Two-Way probabilistic Finite Automata. [Citation Graph (0, 0)][DBLP]
    LATIN, 1995, pp:371-385 [Conf]
  28. Maurice Margenstern
    Non-Erasing Turing Machines: A New Frontier Between a Decidable Halting Problem and Universality. [Citation Graph (0, 0)][DBLP]
    LATIN, 1995, pp:386-397 [Conf]
  29. Martín Matamala, Eric Goles Ch.
    Cyclic Automata Networks on Finite Graphs. [Citation Graph (0, 0)][DBLP]
    LATIN, 1995, pp:398-410 [Conf]
  30. Joao Meidanis, João C. Setubal
    Multiple Alignment of Biological Sequences with Gap Flexibility. [Citation Graph (0, 0)][DBLP]
    LATIN, 1995, pp:411-426 [Conf]
  31. Christoph Meinel, Stephan Waack
    Lower Bounds for the Modular Communication Complexity of Various Graph Accessibility Problems. [Citation Graph (0, 0)][DBLP]
    LATIN, 1995, pp:427-435 [Conf]
  32. Martin Mundhenk
    On Monotonous Oracle Machines. [Citation Graph (0, 0)][DBLP]
    LATIN, 1995, pp:436-448 [Conf]
  33. B. John Oommen, Edward V. de St. Croix
    On Using Learning Automata for Fast Graph Partitioning. [Citation Graph (0, 0)][DBLP]
    LATIN, 1995, pp:449-460 [Conf]
  34. Helmut Prodinger
    Solution of a Problem of Yekutieli and Mandelbrot. [Citation Graph (0, 0)][DBLP]
    LATIN, 1995, pp:461-468 [Conf]
  35. Gilles Richard, Frédéric Saubion
    A Rewrite Approach for Constraint Logic Programming. [Citation Graph (0, 0)][DBLP]
    LATIN, 1995, pp:469-482 [Conf]
  36. Zsuzsanna Róka
    Simulations Between Cellular Automata on Cayley Graphs. [Citation Graph (0, 0)][DBLP]
    LATIN, 1995, pp:483-493 [Conf]
  37. Farn Wang
    A Temporal Logic for Real-Time Partial-Ordering with Named Transactions. [Citation Graph (0, 0)][DBLP]
    LATIN, 1995, pp:494-508 [Conf]
  38. Peter M. Yamakawa, Hiroyuki Ebara, Hideo Nakano
    A New Approach for Routing in Arrangement Graphs and its Performance Evaluation. [Citation Graph (0, 0)][DBLP]
    LATIN, 1995, pp:509-524 [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