Search results for "LATIN"

Hits ?▲	Authors	Title	Venue	Year	Link
1	François Laroussinie, Philippe Schnoebelen, Mathieu Turuani	On the Expressivity and Complexity of Quantitative Branching-Time Temporal Logics.	LATIN	2000	DBLP DOI BibTeX RDF
1	Claudio Gutierrez 0001	Equations in Free Semigroups with Anti-involution and Their Relation to Equations in Free Groups.	LATIN	2000	DBLP DOI BibTeX RDF
1	Daniel Panario, Alfredo Viola	Analysis of Rabin's Polynomial Irreducability Test.	LATIN	1998	DBLP DOI BibTeX RDF
1	Noga Alon	Spectral Techniques in Graph Algorithms.	LATIN	1998	DBLP DOI BibTeX RDF
1	James Abello, Emden R. Gansner	Short and Smooth Polygonal Paths.	LATIN	1998	DBLP DOI BibTeX RDF
1	Orlando Lee, Yoshiko Wakabayashi	Circuit Covers in Series-Parallel Mixed Graphs.	LATIN	1998	DBLP DOI BibTeX RDF
1	Luérbio Faria, Celina M. H. de Figueiredo, Candido Ferreira Xavier de Mendonça Neto	The Splitting Number of the 4-Cube.	LATIN	1998	DBLP DOI BibTeX RDF
1	Claudio L. Lucchesi, Arnaldo V. Moura (eds.)	LATIN '98: Theoretical Informatics, Third Latin American Symposium, Campinas, Brazil, April, 20-24, 1998, Proceedings	LATIN	1998	DBLP DOI BibTeX RDF
1	Ricardo A. Baeza-Yates, Gonzalo Navarro 0001	Fast Two-Dimensional Approximate Pattern Matching	LATIN	1998	DBLP DOI BibTeX RDF
1	David Fernández-Baca	Faster Non-linear Parametric Search with Applications to Optimazation and Dynamic Geometry.	LATIN	1998	DBLP DOI BibTeX RDF
1	Gilles Brassard, Peter Høyer, Alain Tapp	Quantum Cryptanalysis of Hash and Claw-Free Functions.	LATIN	1998	DBLP DOI BibTeX RDF
1	Klaus Jansen	A New Characterization for Parity Graphs and a Coloring Problem with Costs.	LATIN	1998	DBLP DOI BibTeX RDF
1	Alain Finkel, Philippe Schnoebelen	Fundamental Structures in Well-Structured Infinite Transition Systems.	LATIN	1998	DBLP DOI BibTeX RDF
1	Michael Molloy 0001, Bruce A. Reed	Colouring Graphs whose Chromatic Number Is Almost Their Maximum Degree.	LATIN	1998	DBLP DOI BibTeX RDF
1	Nicolas Bedon, Olivier Carton	An Eilenberg Theorem for Words on Countable Ordinals.	LATIN	1998	DBLP DOI BibTeX RDF
1	Joachim von zur Gathen, Igor E. Shparlinski	The CREW PRAM Complexity of Modular Inversion.	LATIN	1998	DBLP DOI BibTeX RDF
1	Dana Randall, Prasad Tetali	Analyzing Glauber Dynamics by Comparison of Markov Chains.	LATIN	1998	DBLP DOI BibTeX RDF
1	Claudio Gutierrez 0001	Solving Equations in Strings: On Makanin's Algorithm.	LATIN	1998	DBLP DOI BibTeX RDF
1	Marisa Gutierrez, João Meidanis	On the Clique Operator.	LATIN	1998	DBLP DOI BibTeX RDF
1	Andrei Z. Broder, Alan M. Frieze, Eli Upfal	Dynamic Packet Routing on Arrays with Bounded Buffers.	LATIN	1998	DBLP DOI BibTeX RDF
1	Alair Pereira do Lago	Maximal Groups in Free Burnside Semigroups.	LATIN	1998	DBLP DOI BibTeX RDF
1	Peter Damaschke	A Chip Search Problem on Binary Numbers.	LATIN	1998	DBLP DOI BibTeX RDF
1	Mihir Bellare, Juan A. Garay, Tal Rabin	Batch Verification with Applications to Cryptography and Checking.	LATIN	1998	DBLP DOI BibTeX RDF
1	Herbert Edelsbrunner	Shape Reconstruction with Delaunay Complex.	LATIN	1998	DBLP DOI BibTeX RDF
1	Friedhelm Meyer auf der Heide, Gabriel Terán Martinez	Communication-Efficient Parallel Multiway and Approximate Minimum Cut Computation.	LATIN	1998	DBLP DOI BibTeX RDF
1	Alan Roberts, Antonios Symvonis	On-Line Matching Routing on Trees.	LATIN	1998	DBLP DOI BibTeX RDF
1	Esteban Feuerstein	Uniform Service Systems with k Servers.	LATIN	1998	DBLP DOI BibTeX RDF
1	Marie-France Sagot	Spelling Approximate Repeated or Common Motifs Using a Suffix Tree.	LATIN	1998	DBLP DOI BibTeX RDF
1	Marcos Veloso Peixoto, Laurent Fribourg	Unfolding Parametric Automata.	LATIN	1998	DBLP DOI BibTeX RDF
1	Alejandro Hevia, Marcos A. Kiwi	Strength of Two Data Encryption Standard Implementations under Timing Attacks.	LATIN	1998	DBLP DOI BibTeX RDF
1	Richard Beigel, Egemen Tanin	The Geometry of Browsing.	LATIN	1998	DBLP DOI BibTeX RDF
1	Frédérique Bassino, Marie-Pierre Béal, Dominique Perrin	Super-State Automata and Rational Trees.	LATIN	1998	DBLP DOI BibTeX RDF
1	Gonzalo Navarro 0001	Improved Approximate Pattern Matching on Hypertext.	LATIN	1998	DBLP DOI BibTeX RDF
1	Jean-Eric Pin	Positive Varieties and Infinite Words.	LATIN	1998	DBLP DOI BibTeX RDF
1	Anamaria Gomide, Jorge Stolfi	Bases for Non-homogeneous Polynomial Ck Splines on the Sphere.	LATIN	1998	DBLP DOI BibTeX RDF
1	Elias Dahlhaus	A Linear Time Algorithm to Recognize Clustered Graphs and Its Parallelization.	LATIN	1998	DBLP DOI BibTeX RDF
1	Maxime Crochemore, Wojciech Rytter	On Linear-Time Alphabet-Independent 2-Dimensional Pattern Matching.	LATIN	1995	DBLP DOI BibTeX RDF
1	Stephen L. Bloom, Zoltán Ésik	Free Shuffle Algebras in Language Varieties (Extended Abstract).	LATIN	1995	DBLP DOI BibTeX RDF
1	Laureano González-Vega	On the Complexity of Computing the Greatest Common Divisor of Several Univariate Polynomials.	LATIN	1995	DBLP DOI BibTeX RDF
1	Stefan Brands	Off-Line Electronic Cash Based on Secret-Key Certificates.	LATIN	1995	DBLP DOI BibTeX RDF
1	Christoph Meinel, Stephan Waack	Lower Bounds for the Modular Communication Complexity of Various Graph Accessibility Problems.	LATIN	1995	DBLP DOI BibTeX RDF
1	Esteban Feuerstein	Paging More Than One Page.	LATIN	1995	DBLP DOI BibTeX RDF
1	Ricardo A. Baeza-Yates, Eric Goles Ch., Patricio V. Poblete (eds.)	LATIN '95: Theoretical Informatics, Second Latin American Symposium, Valparaíso, Chile, April 3-7, 1995, Proceedings	LATIN	1995	DBLP DOI BibTeX RDF
1	Joao Meidanis, João C. Setubal	Multiple Alignment of Biological Sequences with Gap Flexibility.	LATIN	1995	DBLP DOI BibTeX RDF
1	François Blanchard, Alejandro Maass	On Dynamical Properties of Generalized Toggle Automata.	LATIN	1995	DBLP DOI BibTeX RDF
1	Christian Herzog 0003	Pushdown Automata with Bounded Nondeterminism and Bounded Anbiguity.	LATIN	1995	DBLP DOI BibTeX RDF
1	Maurice Margenstern	Non-Erasing Turing Machines: A New Frontier Between a Decidable Halting Problem and Universality.	LATIN	1995	DBLP DOI BibTeX RDF
1	David Fernández-Baca, Giora Slutzki	Linear-Time Algorithms for Parametric Minimum Spanning Tree Problems on Planar Graphs.	LATIN	1995	DBLP DOI BibTeX RDF
1	Laurent Alonso, René Schott	Random Generation of Colored Trees.	LATIN	1995	DBLP DOI BibTeX RDF
1	David A. Mix Barrington, Howard Straubing	Lower Bounds for Modular Counting by Circuits with Modular Gates.	LATIN	1995	DBLP DOI BibTeX RDF
1	Peter Eades, Sue Whitesides	Nearest Neighbour Graph Realizability is NP-hard.	LATIN	1995	DBLP DOI BibTeX RDF
1	Bernd Becker 0001, Rolf Drechsler, Ralph Werchner	On the Relation Betwen BDDs and FDDs.	LATIN	1995	DBLP DOI BibTeX RDF
1	Jozef Gruska, Angelo Monti, Margherita Napoli, Domenico Parente	State Complexity of SBTA Languages.	LATIN	1995	DBLP DOI BibTeX RDF
1	Martín Matamala, Eric Goles Ch.	Cyclic Automata Networks on Finite Graphs.	LATIN	1995	DBLP DOI BibTeX RDF
1	B. John Oommen, Edward V. de St. Croix	On Using Learning Automata for Fast Graph Partitioning.	LATIN	1995	DBLP DOI BibTeX RDF
1	James Abello, Krishna Kumar	Visibility Graphs of 2-Spiral Polygons (Extended Abstract).	LATIN	1995	DBLP DOI BibTeX RDF
1	Zsuzsanna Róka	Simulations Between Cellular Automata on Cayley Graphs.	LATIN	1995	DBLP DOI BibTeX RDF
1	Farn Wang	A Temporal Logic for Real-Time Partial-Ordering with Named Transactions.	LATIN	1995	DBLP DOI BibTeX RDF
1	Giulia Galbiati, Angelo Morzenti, Francesco Maffioli	On the Approximability of some Maximum Spanning Tree Problems.	LATIN	1995	DBLP DOI BibTeX RDF
1	Gerhard Buntrock, Gundula Niemann	On Weak Growing Context-Sensitive Grammars.	LATIN	1995	DBLP DOI BibTeX RDF
1	Shiva Chaudhuri, Devdatt P. Dubhashi	(Probabilistic) Recurrence Realtions Revisited.	LATIN	1995	DBLP DOI BibTeX RDF
1	Celina M. H. de Figueiredo, João Meidanis, Célia Picinin de Mello	On Edge-Colouring Indifference Graphs.	LATIN	1995	DBLP DOI BibTeX RDF
1	Martin Mundhenk	On Monotonous Oracle Machines.	LATIN	1995	DBLP DOI BibTeX RDF
1	Gilles Richard, Frédéric Saubion	A Rewrite Approach for Constraint Logic Programming.	LATIN	1995	DBLP DOI BibTeX RDF
1	William I. Gasarch, Katia S. Guimarães	Unbounded Search and Recursive Graph Problems.	LATIN	1995	DBLP DOI BibTeX RDF
1	Véronique Bruyère, Georges Hansel	Recognizable Sets of Numbers in Nonstandard Bases.	LATIN	1995	DBLP DOI BibTeX RDF
1	Jérôme Olivier Durand-Lose	Reversible Cellular Automaton Able to Simulate Any Other Reversible One Using Partitioning Automata.	LATIN	1995	DBLP DOI BibTeX RDF
1	Peter M. Yamakawa, Hiroyuki Ebara, Hideo Nakano	A New Approach for Routing in Arrangement Graphs and its Performance Evaluation.	LATIN	1995	DBLP DOI BibTeX RDF
1	Helmut Prodinger	Solution of a Problem of Yekutieli and Mandelbrot.	LATIN	1995	DBLP DOI BibTeX RDF
1	R. Balasubramanian, Venkatesh Raman 0001, G. Srinivasaraghavan 0001	Tight Bounds for Finding Degrees from the Adjacency Matrix.	LATIN	1995	DBLP DOI BibTeX RDF
1	Shuhong Gao, Joachim von zur Gathen, Daniel Panario	Gauss Periods and Fast Exponentiation in Finite Fields (Extended Abstract).	LATIN	1995	DBLP DOI BibTeX RDF
1	Ioan I. Macarie	Multihead Two-Way probabilistic Finite Automata.	LATIN	1995	DBLP DOI BibTeX RDF
1	Phillip G. Bradford, Venkatesh Choppella, Gregory J. E. Rawlins	Lower Bounds for the Matrix Chain Ordering Problem (Extended bstract).	LATIN	1995	DBLP DOI BibTeX RDF
1	Tetsuo Asano, Desh Ranjan, Thomas Roos, Emo Welzl, Peter Widmayer	Space Filling Curves and Their Use in the Design of Geometric Data Structures.	LATIN	1995	DBLP DOI BibTeX RDF
1	Benjamín René Callejas Bedregal, Benedito Melo Acióly	Logic of Plotkin Continuous Domain.	LATIN	1995	DBLP DOI BibTeX RDF
1	Jaime Gutierrez 0001, Tomás Recio	Rational Function Decomposition and Gröbner Bases in the Parameterization of Plane Curves (An extended abstract).	LATIN	1992	DBLP DOI BibTeX RDF
1	Afonso Ferreira, Siang W. Song	Achieving Optimality for Gate Matrix Layout and PLA Folding: a Graph Theoretic Approach.	LATIN	1992	DBLP DOI BibTeX RDF
1	Saïd Bettayeb, Bin Cong, Mike Girou, Ivan Hal Sudborough	Simulation Permutation Networks on Hypercubes.	LATIN	1992	DBLP DOI BibTeX RDF
1	Ulrich Hertrampf	Locally Definable Acceptance Types - The Three-Valued Case.	LATIN	1992	DBLP DOI BibTeX RDF
1	José D. P. Rolim	On the Density and Core of the Complexity Classes.	LATIN	1992	DBLP DOI BibTeX RDF
1	Daniel Dominic Sleator	Data Structures and Terminating Petri Nets.	LATIN	1992	DBLP DOI BibTeX RDF
1	Alistair Sinclair	Improved Bounds for Mixing Rates of Marked Chains and Multicommodity Flow.	LATIN	1992	DBLP DOI BibTeX RDF
1	Anne Brüggemann-Klein	Regular Expressions into Finite Automata.	LATIN	1992	DBLP DOI BibTeX RDF
1	Joseph Gil, Yossi Matias	Leaders Election Without Conflict Resolution Rule - Fast and Efficient Randomized Simulations among CRCW PRAMs.	LATIN	1992	DBLP DOI BibTeX RDF
1	Mark Giesbrecht	Factoring in Skew-Polynomial Rings.	LATIN	1992	DBLP DOI BibTeX RDF
1	Imre Simon (eds.)	LATIN '92, 1st Latin American Symposium on Theoretical Informatics, São Paulo, Brazil, April 6-10, 1992, Proceedings	LATIN	1992	DBLP DOI BibTeX RDF
1	David A. Mix Barrington, Howard Straubing	Complex Polynomials and Circuit Lower Bounds for Modular Counting.	LATIN	1992	DBLP DOI BibTeX RDF
1	Felipe Cucker, Francesc Rosselló	On the Complexity of Some Problems for the Blum, Shub & Smale Model.	LATIN	1992	DBLP DOI BibTeX RDF
1	Marshall W. Bern, Herbert Edelsbrunner, David Eppstein, Scott A. Mitchell, Tiow Seng Tan	Edge Insertion for Optional Triangulations.	LATIN	1992	DBLP DOI BibTeX RDF
1	Eric Goles Ch., Marcos A. Kiwi	Dynamics of Sand-Piles Games on Graphs.	LATIN	1992	DBLP DOI BibTeX RDF
1	Jean-Eric Pin	On Reversible Automata.	LATIN	1992	DBLP DOI BibTeX RDF
1	Christiane Frougny	How to Write Integers in Non-Integer Base.	LATIN	1992	DBLP DOI BibTeX RDF
1	Francis Bossut, Bruno Warin	Automata and Pattern Matching in Planar Directed Acyclic Graphs.	LATIN	1992	DBLP DOI BibTeX RDF
1	Arjen K. Lenstra	Massively Parallel Computing and Factoring.	LATIN	1992	DBLP DOI BibTeX RDF
1	Kosaburo Hashiguchi	The Double Reconstruction Conjectures about Colored Hypergraphs and Colored Directed Graphs.	LATIN	1992	DBLP DOI BibTeX RDF
1	Gene Myers	Approximate Matching of Network Expressions with Spacers.	LATIN	1992	DBLP DOI BibTeX RDF
1	William I. Gasarch, Katia S. Guimarães	On the Number Components of a Recursive Graph.	LATIN	1992	DBLP DOI BibTeX RDF
1	Wenceslas Fernandez de la Vega, Vangelis Th. Paschos, Rachid Saad	Average Case Analysis of a Greedy Algorithm for the Minimum Hitting Set Problem.	LATIN	1992	DBLP DOI BibTeX RDF
1	Michel Cosnard, Pascal Koiran, Hélène Paugam-Moisy	Complexity Issues in Neural Network Computations.	LATIN	1992	DBLP DOI BibTeX RDF
1	Paola Alimonti, Esteban Feuerstein, Umberto Nanni	Linear Time Algorithms for Liveness and Boundedness in Conflict-free Petri Nets.	LATIN	1992	DBLP DOI BibTeX RDF

Publications at "LATIN"( http://dblp.L3S.de/Venues/LATIN )