Search results for "LATIN"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Hajo Broersma, Matthew Johnson 0002, Daniël Paulusma, Iain A. Stewart	The Computational Complexity of the Parallel Knock-Out Problem.	LATIN	2006	DBLP DOI BibTeX RDF	Parallel knock-out, computational complexity, graphs
1	Boris Aronov, Alan R. Davis, John Iacono, Albert Siu Cheong Yu	The Complexity of Diffuse Reflections in a Simple Polygon.	LATIN	2006	DBLP DOI BibTeX RDF
1	Anne Condon	RNA Molecules: Glimpses Through an Algorithmic Lens.	LATIN	2006	DBLP DOI BibTeX RDF
1	Daniel Sawitzki	Exponential Lower Bounds on the Space Complexity of OBDD-Based Graph Algorithms.	LATIN	2006	DBLP DOI BibTeX RDF
1	Lap Chi Lau, Michael Molloy 0001	Randomly Colouring Graphs with Girth Five and Large Maximum Degree.	LATIN	2006	DBLP DOI BibTeX RDF
1	Yngve Villanger	Improved Exponential-Time Algorithms for Treewidth and Minimum Fill-In.	LATIN	2006	DBLP DOI BibTeX RDF
1	Evangelos Kranakis, Danny Krizanc, Euripides Markou	Mobile Agent Rendezvous in a Synchronous Torus.	LATIN	2006	DBLP DOI BibTeX RDF	rendezvous with detection, synchronous, Mobile agent, torus, tokens, rendezvous
1	Yan Mayster, Mario Alberto López	Rectilinear Approximation of a Set of Points in the Plane.	LATIN	2006	DBLP DOI BibTeX RDF
1	Veli Mäkinen, Gonzalo Navarro 0001	Position-Restricted Substring Searching.	LATIN	2006	DBLP DOI BibTeX RDF
1	Ilya Baran, Erik D. Demaine, Dmitriy A. Katz	Optimally Adaptive Integration of Univariate Lipschitz Functions.	LATIN	2006	DBLP DOI BibTeX RDF
1	Frédéric Mazoit	The Branch-Width of Circular-Arc Graphs.	LATIN	2006	DBLP DOI BibTeX RDF	algorithm, circular-arc graphs, Branch-width
1	Marek Chrobak, Claire Kenyon, John Noga, Neal E. Young	Oblivious Medians Via Online Bidding.	LATIN	2006	DBLP DOI BibTeX RDF
1	Ho-Kwok Dai, Hung-Chi Su	A Parallel Algorithm for Finding All Successive Minimal Maximum Subsequences.	LATIN	2006	DBLP DOI BibTeX RDF
1	Douglas G. Down, George Karakostas	Maximizing Throughput in Queueing Networks with Limited Flexibility.	LATIN	2006	DBLP DOI BibTeX RDF	scheduling, approximation algorithms, Queueing networks
1	Jérémie Bourdon, Brigitte Vallée	Pattern Matching Statistics on Correlated Sources.	LATIN	2006	DBLP DOI BibTeX RDF
1	Argimiro Arratia, Carlos E. Ortiz	Counting Proportions of Sets: Expressive Power with Almost Order.	LATIN	2006	DBLP DOI BibTeX RDF	Proportional quantifiers, almost order, P, computational complexity, expressiveness, NL
1	Khaled M. Elbassioni	Finding All Minimal Infrequent Multi-dimensional Intervals.	LATIN	2006	DBLP DOI BibTeX RDF
1	Feodor F. Dragan, Chenyu Yan	Network Flow Spanners.	LATIN	2006	DBLP DOI BibTeX RDF
1	Michel X. Goemans, Jan Vondrák	Stochastic Covering and Adaptivity.	LATIN	2006	DBLP DOI BibTeX RDF
1	Béla Bollobás, Guy Kindler, Imre Leader, Ryan O'Donnell	Eliminating Cycles in the Discrete Torus.	LATIN	2006	DBLP DOI BibTeX RDF
1	Nayantara Bhatnagar, Dana Randall, Vijay V. Vazirani, Eric Vigoda	Random Bichromatic Matchings.	LATIN	2006	DBLP DOI BibTeX RDF
1	Pinar Heggernes, Federico Mancini 0001	Minimal Split Completions of Graphs.	LATIN	2006	DBLP DOI BibTeX RDF
1	Madhu Sudan 0001	Modelling Errors and Recovery for Communication.	LATIN	2006	DBLP DOI BibTeX RDF
1	Roee Engelberg, Jochen Könemann, Stefano Leonardi 0001, Joseph Naor	Cut Problems in Graphs with a Budget Constraint.	LATIN	2006	DBLP DOI BibTeX RDF
1	Ricardo A. Baeza-Yates	Algorithmic Challenges in Web Search Engines.	LATIN	2006	DBLP DOI BibTeX RDF
1	Abdullah N. Arslan	Efficient Approximate Dictionary Look-Up for Long Words over Small Alphabets.	LATIN	2006	DBLP DOI BibTeX RDF	d-query, approximate dictionary look-up, space efficient algorithm, suffix tree, edit distance, preprocessing, Hamming distance
1	Sergio Verdú	Lossless Data Compression Via Error Correction.	LATIN	2006	DBLP DOI BibTeX RDF
1	Wojciech Jawor, Marek Chrobak, Christoph Dürr	Competitive Analysis of Scheduling Algorithms for Aggregated Links.	LATIN	2006	DBLP DOI BibTeX RDF
1	Parikshit Gopalan, Venkatesan Guruswami, Richard J. Lipton	Algorithms for Modular Counting of Roots of Multivariate Polynomials.	LATIN	2006	DBLP DOI BibTeX RDF
1	Thorsten Bernholt, Thomas Hofmeister	An Algorithm for a Generalized Maximum Subsequence Problem.	LATIN	2006	DBLP DOI BibTeX RDF
1	Claudson F. Bornstein, Eduardo Sany Laber, Marcelo Mas	On Behalf of the Seller and Society: Bicriteria Mechanisms for Unit-Demand Auctions.	LATIN	2006	DBLP DOI BibTeX RDF
1	Elói Araújo, José Soares	Scoring Matrices That Induce Metrics on Sequences.	LATIN	2006	DBLP DOI BibTeX RDF
1	Saurabh Agarwal, Gudmund Skovbjerg Frandsen	A New GCD Algorithm for Quadratic Number Rings with Unique Factorization.	LATIN	2006	DBLP DOI BibTeX RDF	quadratic number ring, quadratic form reduction, gcd
1	Eli Gafni, Sergio Rajsbaum, Michel Raynal, Corentin Travers	The Committee Decision Problem.	LATIN	2006	DBLP DOI BibTeX RDF
1	Venkatesan Guruswami, Valentine Kabanets	Hardness Amplification Via Space-Efficient Direct Products.	LATIN	2006	DBLP DOI BibTeX RDF	error-correcting codes, expanders, Direct products, hardness amplification
1	Martin Fürer	A Faster Algorithm for Finding Maximum Independent Sets in Sparse Graphs.	LATIN	2006	DBLP DOI BibTeX RDF	exponential time algorithm, NP-hard, Maximum independent set, sparse graph
1	Nir Ailon, Steve Chien, Cynthia Dwork	On Clusters in Markov Chains.	LATIN	2006	DBLP DOI BibTeX RDF
1	Mark Cieliebak, Stephan J. Eidenbenz	Measurement Errors Make the Partial Digest Problem NP-Hard.	LATIN	2004	DBLP DOI BibTeX RDF
1	Mike Paterson	Analysis of Scheduling Algorithms for Proportionate Fairness.	LATIN	2004	DBLP DOI BibTeX RDF
1	Martin Farach-Colton (eds.)	LATIN 2004: Theoretical Informatics, 6th Latin American Symposium, Buenos Aires, Argentina, April 5-8, 2004, Proceedings	LATIN	2004	DBLP DOI BibTeX RDF
1	Mark Cieliebak	Gathering Non-oblivious Mobile Robots.	LATIN	2004	DBLP DOI BibTeX RDF
1	Frank Gurski, Egon Wanke	Vertex Disjoint Paths on Clique-Width Bounded Graphs.	LATIN	2004	DBLP DOI BibTeX RDF
1	Alantha Newman, Matthias Ruhl	Combinatorial Problems on Strings with Applications to Protein Folding.	LATIN	2004	DBLP DOI BibTeX RDF
1	James R. Lee, Manor Mendel, Assaf Naor	Metric Structures in L1: Dimension, Snowflakes, and Average Distortion.	LATIN	2004	DBLP DOI BibTeX RDF
1	Paola Flocchini, Evangelos Kranakis, Danny Krizanc, Nicola Santoro, Cindy Sawchuk	Multiple Mobile Agent Rendezvous in a Ring.	LATIN	2004	DBLP DOI BibTeX RDF
1	Frédéric Gardi	On Partitioning Interval and Circular-Arc Graphs into Proper Interval Subgraphs with Applications.	LATIN	2004	DBLP DOI BibTeX RDF
1	Graham Cormode, S. Muthukrishnan 0001	An Improved Data Stream Summary: The Count-Min Sketch and Its Applications.	LATIN	2004	DBLP DOI BibTeX RDF
1	Gadiel Seroussi	Universal Types and Simulation of Individual Sequences.	LATIN	2004	DBLP DOI BibTeX RDF
1	Joachim von zur Gathen	Arithmetic Circuits for Discrete Logarithms.	LATIN	2004	DBLP DOI BibTeX RDF	Discrete logarithm, arithmetic circuit, generic algorithm, cyclic group
1	Jens S. Kohrt, Kirk Pruhs	A Constant Approximation Algorithm for Sorting Buffers.	LATIN	2004	DBLP DOI BibTeX RDF
1	Olga Tveretina, Hans Zantema	A Proof System and a Decision Procedure for Equality Logic.	LATIN	2004	DBLP DOI BibTeX RDF	Equality logic, satisfiability, resolution
1	Paul Gastin, Benjamin Lerman, Marc Zeitoun	Distributed Games and Distributed Control for Asynchronous Systems.	LATIN	2004	DBLP DOI BibTeX RDF	Distributed game, distributed control, distributed strategy
1	Edith Hemaspaandra, Holger Spakowski, Mayur Thakur	Complexity of Cycle Length Modularity Problems in Graphs.	LATIN	2004	DBLP DOI BibTeX RDF
1	Volker Diekert, Paul Gastin	Pure Future Local Temporal Logics Are Expressively Complete for Mazurkiewicz Traces.	LATIN	2004	DBLP DOI BibTeX RDF	concurrency, Temporal logics, Mazurkiewicz traces
1	Marcos A. Kiwi, Martin Loebl, Jirí Matousek 0001	Expected Length of the Longest Common Subsequence for Large Alphabets.	LATIN	2004	DBLP DOI BibTeX RDF
1	Bernard Mans, Igor E. Shparlinski	Bisecting and Gossiping in Circulant Graphs.	LATIN	2004	DBLP DOI BibTeX RDF
1	Martin Fürer	An Improved Communication-Randomness Tradeo.	LATIN	2004	DBLP DOI BibTeX RDF
1	Alper Üngör	O.-Centers: A New Type of Steiner Points for Computing Size-Optimal Quality-Guaranteed Delaunay Triangulations.	LATIN	2004	DBLP DOI BibTeX RDF	computational geometry, triangulations, Delaunay refinement
1	Jean Cardinal, Stefan Langerman	Designing Small Keyboards Is Hard.	LATIN	2004	DBLP DOI BibTeX RDF
1	Prabhakar Gubbala, Balaji Raghavachari	Finding k-Connected Subgraphs with Minimum Average Weight.	LATIN	2004	DBLP DOI BibTeX RDF
1	Nikhil Bansal 0001, Kirk Pruhs	Server Scheduling in the Weighted lp Norm.	LATIN	2004	DBLP DOI BibTeX RDF
1	Christian Borgs, Jennifer T. Chayes, Stephan Mertens, Boris G. Pittel	Constrained Integer Partitions.	LATIN	2004	DBLP DOI BibTeX RDF
1	Funda Ergün, S. Muthukrishnan 0001, Süleyman Cenk Sahinalp	Sublinear Methods for Detecting Periodic Trends in Data Streams.	LATIN	2004	DBLP DOI BibTeX RDF
1	Argimiro Arratia, Carlos E. Ortiz	Approximating the Expressive Power of Logics in Finite Models.	LATIN	2004	DBLP DOI BibTeX RDF
1	Hervé Brönnimann, Timothy M. Chan	Space-E.cient Algorithms for Computing the Convex Hull of a Simple Polygonal Line in Linear Time.	LATIN	2004	DBLP DOI BibTeX RDF
1	Jean-Eric Pin	The Consequences of Imre Simon's Work in the Theory of Automata, Languages, and Semigroups.	LATIN	2004	DBLP DOI BibTeX RDF
1	Dusan Guller	Procedural Semantics for Fuzzy Disjunctive Programs on Residuated Lattices.	LATIN	2004	DBLP DOI BibTeX RDF
1	Kimmo Fredriksson, Veli Mäkinen, Gonzalo Navarro 0001	Rotation and Lighting Invariant Template Matching.	LATIN	2004	DBLP DOI BibTeX RDF
1	Mihai Badoiu, Erik D. Demaine	A Simplified, Dynamic Unified Structure.	LATIN	2004	DBLP DOI BibTeX RDF
1	Jeff Edmonds	On the Competitiveness of AIMD-TCP within a General Network.	LATIN	2004	DBLP DOI BibTeX RDF	online competitive ratio, multi-bottleneck, TCP, fairness, flow time, AIMD
1	Pierre Fraigniaud, Leszek Gasieniec, Dariusz R. Kowalski, Andrzej Pelc	Collective Tree Exploration.	LATIN	2004	DBLP DOI BibTeX RDF
1	Flávio Keidi Miyazawa, Yoshiko Wakabayashi	Packing Problems with Orthogonal Rotations.	LATIN	2004	DBLP DOI BibTeX RDF
1	Tomás Feder, Pavol Hell, Sulamita Klein, Loana Tito Nogueira, Fábio Protti	List Partitions of Chordal Graphs.	LATIN	2004	DBLP DOI BibTeX RDF
1	Abraham Flaxman, David Gamarnik, Gregory B. Sorkin	Embracing the Giant Component.	LATIN	2004	DBLP DOI BibTeX RDF
1	Jeremy Elson, Richard M. Karp, Christos H. Papadimitriou, Scott Shenker	Global Synchronization in Sensornets.	LATIN	2004	DBLP DOI BibTeX RDF
1	Saverio Caminiti, Irene Finocchi, Rossella Petreschi	A Unified Approach to Coding Labeled Trees.	LATIN	2004	DBLP DOI BibTeX RDF
1	Cynthia Dwork	Fighting Spam: The Science.	LATIN	2004	DBLP DOI BibTeX RDF
1	Kirk Pruhs, Gerhard J. Woeginger	Approximation Schemes for a Class of Subset Selection Problems.	LATIN	2004	DBLP DOI BibTeX RDF
1	Jesper Jansson 0001, Joseph H.-K. Ng, Kunihiko Sadakane, Wing-Kin Sung	Rooted Maximum Agreement Supertrees.	LATIN	2004	DBLP DOI BibTeX RDF
1	Sylvain Lombardy, Jacques Sakarovitch	How Expressions Can Code for Automata.	LATIN	2004	DBLP DOI BibTeX RDF
1	Manuel Bodirsky, Tobias Gärtner, Timo von Oertzen, Jan Schwinghammer	Effciently Computing the Density of Regular Languages.	LATIN	2004	DBLP DOI BibTeX RDF
1	Claudio Gutierrez 0001, Flavio Gutierrez, Maria-Cecilia Rivara	A Geometric Approach to the Bisection Method.	LATIN	2004	DBLP DOI BibTeX RDF
1	Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos	Bidimensional Parameters and Local Treewidth.	LATIN	2004	DBLP DOI BibTeX RDF
1	John Rhodes 0001, Benjamin Steinberg	Join Irreducible Pseudovarieties, Group Mapping, and Kovács-Newman Semigroups.	LATIN	2004	DBLP DOI BibTeX RDF
1	H. K. Dai 0001, Xi-Wen Zhang	Improved Linear Expected-Time Algorithms for Computing Maxima.	LATIN	2004	DBLP DOI BibTeX RDF
1	Ali Akhavi, Céline Moreira Dos Santos	Another View of the Gaussian Algorithm.	LATIN	2004	DBLP DOI BibTeX RDF
1	Ke Yang 0005	On the (Im)possibility of Non-interactive Correlation Distillation.	LATIN	2004	DBLP DOI BibTeX RDF
1	Richard J. Lipton, Evangelos Markakis	Nash Equilibria via Polynomial Equations.	LATIN	2004	DBLP DOI BibTeX RDF
1	Lane A. Hemaspaandra, Mitsunori Ogihara, Mohammed Javeed Zaki, Marius Zimand	The Complexity of Finding Top-Toda-Equivalence-Class Members.	LATIN	2004	DBLP DOI BibTeX RDF
1	Maxime Crochemore, Costas S. Iliopoulos, Manal Mohamed 0001, Marie-France Sagot	Longest Repeats with a Block of Don't Cares.	LATIN	2004	DBLP DOI BibTeX RDF	Repeat Extraction, Dont Care, Efficient Merging, Suffix Tree, String, Combinatorial Problems, Lowest Common Ancestor
1	Sergei Bespamyatnikh	Encoding Homotopy of Paths in the Plane.	LATIN	2004	DBLP DOI BibTeX RDF
1	Olivier Carton, Chloe Rispal	Complementation of Rational Sets on Scattered Linear Orderings of Finite Rank.	LATIN	2004	DBLP DOI BibTeX RDF
1	Gérard D. Cohen, Hans Georg Schaathun	Separating Codes: Constructions and Bounds.	LATIN	2004	DBLP DOI BibTeX RDF
1	Yoshiharu Kohayakawa	Advances in the Regularity Method.	LATIN	2004	DBLP DOI BibTeX RDF
1	Eduardo Sany Laber, Renato Carmo, Yoshiharu Kohayakawa	Querying Priced Information in Databases: The Conjunctive Case.	LATIN	2004	DBLP DOI BibTeX RDF
1	Dimitris Achlioptas, Michael S. O. Molloy, Cristopher Moore, Frank Van Bussel	Sampling Grid Colorings with Fewer Colors.	LATIN	2004	DBLP DOI BibTeX RDF
1	Josep Díaz, Maria J. Serna, Nicholas C. Wormald	Computation of the Bisection Width for Random d-Regular Graphs.	LATIN	2004	DBLP DOI BibTeX RDF
1	Raja Jothi, Balaji Raghavachari	Minimum Latency Tours and the k-Traveling Repairmen Problem.	LATIN	2004	DBLP DOI BibTeX RDF
1	Shigeki Akiyama, Frédérique Bassino, Christiane Frougny	Automata for Arithmetic Meyer Sets.	LATIN	2004	DBLP DOI BibTeX RDF
1	Hervé Brönnimann, Marc Glisse	Cost-Optimal Trees for Ray Shooting.	LATIN	2004	DBLP DOI BibTeX RDF

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