Pages that link to "Item:Q3525739"

The following pages link to LATIN 2006: Theoretical Informatics (Q3525739):

Displaying 50 items.

• Data structures for halfplane proximity queries and incremental Voronoi diagrams (Q1755746) (← links)
• Algorithmic Challenges in Web Search Engines (Q3525740) (← links)
• Matching Based Augmentations for Approximating Connectivity Problems (Q3525741) (← links)
• Lossless Data Compression Via Error Correction (Q3525742) (← links)
• The Power and Weakness of Randomness in Computation (Q3525743) (← links)
• A New GCD Algorithm for Quadratic Number Rings with Unique Factorization (Q3525745) (← links)
• On Clusters in Markov Chains (Q3525746) (← links)
• An Architecture for Provably Secure Computation (Q3525747) (← links)
• Scoring Matrices That Induce Metrics on Sequences (Q3525748) (← links)
• The Complexity of Diffuse Reflections in a Simple Polygon (Q3525751) (← links)
• Counting Proportions of Sets: Expressive Power with Almost Order (Q3525752) (← links)
• Efficient Approximate Dictionary Look-Up for Long Words over Small Alphabets (Q3525753) (← links)
• Relations Among Notions of Security for Identity Based Encryption Schemes (Q3525754) (← links)
• Optimally Adaptive Integration of Univariate Lipschitz Functions (Q3525755) (← links)
• Classical Computability and Fuzzy Turing Machines (Q3525756) (← links)
• An Optimal Algorithm for the Continuous/Discrete Weighted 2-Center Problem in Trees (Q3525757) (← links)
• An Algorithm for a Generalized Maximum Subsequence Problem (Q3525758) (← links)
• Random Bichromatic Matchings (Q3525759) (← links)
• Eliminating Cycles in the Discrete Torus (Q3525760) (← links)
• On Behalf of the Seller and Society: Bicriteria Mechanisms for Unit-Demand Auctions (Q3525761) (← links)
• Pattern Matching Statistics on Correlated Sources (Q3525762) (← links)
• Robust Model-Checking of Linear-Time Properties in Timed Automata (Q3525763) (← links)
• The Computational Complexity of the Parallel Knock-Out Problem (Q3525764) (← links)
• ${\mathcal C}$ -Varieties, Actions and Wreath Product (Q3525766) (← links)
• Local Construction of Planar Spanners in Unit Disk Graphs with Irregular Transmission Ranges (Q3525767) (← links)
• An Efficient Approximation Algorithm for Point Pattern Matching Under Noise (Q3525768) (← links)
• Oblivious Medians Via Online Bidding (Q3525769) (← links)
• Efficient Computation of the Relative Entropy of Probabilistic Automata (Q3525770) (← links)
• A Parallel Algorithm for Finding All Successive Minimal Maximum Subsequences (Q3525771) (← links)
• De Dictionariis Dynamicis Pauco Spatio Utentibus (Q3525772) (← links)
• Customized Newspaper Broadcast: Data Broadcast with Dependencies (Q3525773) (← links)
• On Minimum k-Modal Partitions of Permutations (Q3525774) (← links)
• Two Birds with One Stone: The Best of Branchwidth and Treewidth with One Algorithm (Q3525775) (← links)
• Maximizing Throughput in Queueing Networks with Limited Flexibility (Q3525776) (← links)
• Network Flow Spanners (Q3525777) (← links)
• Finding All Minimal Infrequent Multi-dimensional Intervals (Q3525778) (← links)
• Cut Problems in Graphs with a Budget Constraint (Q3525779) (← links)
• Lower Bounds for Clear Transmissions in Radio Networks (Q3525780) (← links)
• Asynchronous Behavior of Double-Quiescent Elementary Cellular Automata (Q3525781) (← links)
• Lower Bounds for Geometric Diameter Problems (Q3525782) (← links)
• Connected Treewidth and Connected Graph Searching (Q3525783) (← links)
• A Faster Algorithm for Finding Maximum Independent Sets in Sparse Graphs (Q3525784) (← links)
• The Committee Decision Problem (Q3525785) (← links)
• Common Deadline Lazy Bureaucrat Scheduling Revisited (Q3525786) (← links)
• Stochastic Covering and Adaptivity (Q3525789) (← links)
• Algorithms for Modular Counting of Roots of Multivariate Polynomials (Q3525790) (← links)
• Hardness Amplification Via Space-Efficient Direct Products (Q3525791) (← links)
• The Online Freeze-Tag Problem (Q3525792) (← links)
• Minimal Split Completions of Graphs (Q3525793) (← links)
• Design and Analysis of Online Batching Systems (Q3525794) (← links)