1 option
LATIN 2006: Theoretical Informatics : 7th Latin American Symposium, Valdivia, Chile, March 20-24, 2006, Proceedings / edited by José R. Correa, Alejandro Hevia, Marcos Kiwi.
SpringerLink Books Lecture Notes In Computer Science (LNCS) (1997-2024) Available online
View online- Format:
- Book
- Series:
- Computer Science (Springer-11645)
- LNCS sublibrary. Theoretical computer science and general issues ; SL 1, 3887.
- Theoretical Computer Science and General Issues ; 3887
- Language:
- English
- Subjects (All):
- Computers.
- Algorithms.
- Data structures (Computer science).
- Computer science--Mathematics.
- Computer science.
- Computer logic.
- Theory of Computation.
- Algorithm Analysis and Problem Complexity.
- Computation by Abstract Devices.
- Data Structures.
- Discrete Mathematics in Computer Science.
- Logics and Meanings of Programs.
- Local Subjects:
- Theory of Computation.
- Algorithm Analysis and Problem Complexity.
- Computation by Abstract Devices.
- Data Structures.
- Discrete Mathematics in Computer Science.
- Logics and Meanings of Programs.
- Physical Description:
- 1 online resource (XVI, 814 pages).
- Edition:
- First edition 2006.
- Contained In:
- Springer eBooks
- Place of Publication:
- Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2006.
- System Details:
- text file PDF
- Contents:
- Keynotes
- Algorithmic Challenges in Web Search Engines
- RNA Molecules: Glimpses Through an Algorithmic Lens
- Squares
- Matching Based Augmentations for Approximating Connectivity Problems
- Modelling Errors and Recovery for Communication
- Lossless Data Compression Via Error Correction
- The Power and Weakness of Randomness in Computation
- Regular Contributions
- A New GCD Algorithm for Quadratic Number Rings with Unique Factorization
- On Clusters in Markov Chains
- An Architecture for Provably Secure Computation
- Scoring Matrices That Induce Metrics on Sequences
- Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams
- The Complexity of Diffuse Reflections in a Simple Polygon
- Counting Proportions of Sets: Expressive Power with Almost Order
- Efficient Approximate Dictionary Look-Up for Long Words over Small Alphabets
- Relations Among Notions of Security for Identity Based Encryption Schemes
- Optimally Adaptive Integration of Univariate Lipschitz Functions
- Classical Computability and Fuzzy Turing Machines
- An Optimal Algorithm for the Continuous/Discrete Weighted 2-Center Problem in Trees
- An Algorithm for a Generalized Maximum Subsequence Problem
- Random Bichromatic Matchings
- Eliminating Cycles in the Discrete Torus
- On Behalf of the Seller and Society: Bicriteria Mechanisms for Unit-Demand Auctions
- Pattern Matching Statistics on Correlated Sources
- Robust Model-Checking of Linear-Time Properties in Timed Automata
- The Computational Complexity of the Parallel Knock-Out Problem
- Reconfigurations in Graphs and Grids
- -Varieties, Actions and Wreath Product
- Local Construction of Planar Spanners in Unit Disk Graphs with Irregular Transmission Ranges
- An Efficient Approximation Algorithm for Point Pattern Matching Under Noise
- Oblivious Medians Via Online Bidding
- Efficient Computation of the Relative Entropy of Probabilistic Automata
- A Parallel Algorithm for Finding All Successive Minimal Maximum Subsequences
- De Dictionariis Dynamicis Pauco Spatio Utentibus
- Customized Newspaper Broadcast: Data Broadcast with Dependencies
- On Minimum k-Modal Partitions of Permutations
- Two Birds with One Stone: The Best of Branchwidth and Treewidth with One Algorithm
- Maximizing Throughput in Queueing Networks with Limited Flexibility
- Network Flow Spanners
- Finding All Minimal Infrequent Multi-dimensional Intervals
- Cut Problems in Graphs with a Budget Constraint
- Lower Bounds for Clear Transmissions in Radio Networks
- Asynchronous Behavior of Double-Quiescent Elementary Cellular Automata
- Lower Bounds for Geometric Diameter Problems
- Connected Treewidth and Connected Graph Searching
- A Faster Algorithm for Finding Maximum Independent Sets in Sparse Graphs
- The Committee Decision Problem
- Common Deadline Lazy Bureaucrat Scheduling Revisited
- Approximate Sorting
- Stochastic Covering and Adaptivity
- Algorithms for Modular Counting of Roots of Multivariate Polynomials
- Hardness Amplification Via Space-Efficient Direct Products
- The Online Freeze-Tag Problem
- I/O-Efficient Algorithms on Near-Planar Graphs
- Minimal Split Completions of Graphs
- Design and Analysis of Online Batching Systems
- Competitive Analysis of Scheduling Algorithms for Aggregated Links
- A 4-Approximation Algorithm for Guarding 1.5-Dimensional Terrains
- On Sampling in Higher-Dimensional Peer-to-Peer Systems
- Mobile Agent Rendezvous in a Synchronous Torus
- Randomly Colouring Graphs with Girth Five and Large Maximum Degree
- Packing Dicycle Covers in Planar Graphs with No K 5-e Minor
- Sharp Estimates for the Main Parameters of the Euclid Algorithm
- Position-Restricted Substring Searching
- Rectilinear Approximation of a Set of Points in the Plane
- The Branch-Width of Circular-Arc Graphs
- Minimal Eulerian Circuit in a Labeled Digraph
- Speeding up Approximation Algorithms for NP-Hard Spanning Forest Problems by Multi-objective Optimization
- RISOTTO: Fast Extraction of Motifs with Mismatches
- Minimum Cost Source Location Problems with Flow Requirements
- Exponential Lower Bounds on the Space Complexity of OBDD-Based Graph Algorithms
- Constructions of Approximately Mutually Unbiased Bases
- Improved Exponential-Time Algorithms for Treewidth and Minimum Fill-In.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-540-32756-1
- 9783540327561
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.