Skip to content

International Symposium on Latin American Theoretical Informatics

LATIN

B

CORE rank

CORE rank (raw)

B

Fields of research

Theory of Computation

Papers indexed

851

1992–2024

Papers per year

199273 peak2024

LATIN papers

851 records sourced from DBLP. Search titles, filter by year, sort by recency.

YearTitleAuthors
1995On Using Learning Automata for Fast Graph Partitioning.B. John Oommen, Edward V. de St. Croix
1995On Monotonous Oracle Machines.Martin Mundhenk
1995Lower Bounds for the Modular Communication Complexity of Various Graph Accessibility Problems.Christoph Meinel, Stephan Waack
1995Multiple Alignment of Biological Sequences with Gap Flexibility.Joao Meidanis, Joo C. Setubal
1995Cyclic Automata Networks on Finite Graphs.Martn Matamala, Eric Goles Ch.
1995Non-Erasing Turing Machines: A New Frontier Between a Decidable Halting Problem and Universality.Maurice Margenstern
1995Multihead Two-Way probabilistic Finite Automata.Ioan I. Macarie
1995Pushdown Automata with Bounded Nondeterminism and Bounded Anbiguity.Christian Herzog
1995State Complexity of SBTA Languages.Jozef Gruska, Angelo Monti, Margherita Napoli, Domenico Parente
1995On the Complexity of Computing the Greatest Common Divisor of Several Univariate Polynomials.Laureano Gonzlez-Vega
1995Unbounded Search and Recursive Graph Problems.William I. Gasarch, Katia S. Guimares
1995Gauss Periods and Fast Exponentiation in Finite Fields (Extended Abstract).Shuhong Gao, Joachim von zur Gathen, Daniel Panario
1995On the Approximability of some Maximum Spanning Tree Problems.Giulia Galbiati, Angelo Morzenti, Francesco Maffioli
1995On Edge-Colouring Indifference Graphs.Celina M. H. de Figueiredo, Joo Meidanis, Clia Picinin de Mello
1995Paging More Than One Page.Esteban Feuerstein
1995Linear-Time Algorithms for Parametric Minimum Spanning Tree Problems on Planar Graphs.David Fernndez-Baca, Giora Slutzki
1995Nearest Neighbour Graph Realizability is NP-hard.Peter Eades, Sue Whitesides
1995Reversible Cellular Automaton Able to Simulate Any Other Reversible One Using Partitioning Automata.Jrme Olivier Durand-Lose
1995On Linear-Time Alphabet-Independent 2-Dimensional Pattern Matching.Maxime Crochemore, Wojciech Rytter
1995(Probabilistic) Recurrence Realtions Revisited.Shiva Chaudhuri, Devdatt P. Dubhashi
1995On Weak Growing Context-Sensitive Grammars.Gerhard Buntrock, Gundula Niemann
1995Recognizable Sets of Numbers in Nonstandard Bases.Vronique Bruyre, Georges Hansel
1995Off-Line Electronic Cash Based on Secret-Key Certificates.Stefan Brands
1995Lower Bounds for the Matrix Chain Ordering Problem (Extended bstract).Phillip G. Bradford, Venkatesh Choppella, Gregory J. E. Rawlins
1995Free Shuffle Algebras in Language Varieties (Extended Abstract).Stephen L. Bloom, Zoltn sik
776800 of 851← PreviousNext →

Comparable venues

Other A*/A conferences filed under the same field of research.