| Description |
1 online resource (xvii, 669 pages) |
| Series |
Lecture notes in computer science, 0302-9743 ; 7256 |
|
Advanced research in computing and software science |
|
LNCS sublibrary. SL 1, Theoretical computer science and general issues |
|
Lecture notes in computer science ; 7256.
|
|
Lecture notes in computer science. Advanced research in computing and software science.
|
|
LNCS sublibrary. SL 1, Theoretical computer science and general issues.
|
| Contents |
A Generalization of the Convex Kakeya Problem / Hee-Kap Ahn, Sang Won Bae, Otfried Cheong, Joachim Gudmundsson and Takeshi Tokuyama, et al. -- Low Complexity Scheduling Algorithm Minimizing the Energy for Tasks with Agreeable Deadlines / Eric Angel, Evripidis Bampis and Vincent Chau -- Bichromatic 2-Center of Pairs of Points / Esther M. Arkin, José Miguel Díaz-Báñez, Ferran Hurtado, Piyush Kumar and Joseph S.B. Mitchell, et al. -- Erdős-Rényi Sequences and Deterministic Construction of Expanding Cayley Graphs / Vikraman Arvind, Partha Mukhopadhyay and Prajakta Nimbhorkar -- A Better Approximation Ratio and an IP Formulation for a Sensor Cover Problem / Rafael da Ponte Barbosa and Yoshiko Wakabayashi -- On the Advice Complexity of the Knapsack Problem / Hans-Joachim Böckenhauer, Dennis Komm, Richard Královič and Peter Rossmanith -- Reoptimization of Some Maximum Weight Induced Hereditary Subgraph Problems / Nicolas Boria, Jérôme Monnot and Vangelis Th. Paschos -- On Plane Constrained Bounded-Degree Spanners / Prosenjit Bose, Rolf Fagerberg, André van Renssen and Sander Verdonschot |
|
Space-Efficient Approximation Scheme for Circular Earth Mover Distance / Joshua Brody, Hongyu Liang and Xiaoming Sun -- Density Classification on Infinite Lattices and Trees / Ana Bušić, Nazim Fatès, Jean Mairesse and Irène Marcovici -- Coloring Planar Homothets and Three-Dimensional Hypergraphs / Jean Cardinal and Matias Korman -- An Equivariance Theorem with Applications to Renaming / Armando Castañeda, Maurice Herlihy and Sergio Rajsbaum -- Renaming Is Weaker Than Set Agreement But for Perfect Renaming: A Map of Sub-consensus Tasks / Armando Castañeda, Damien Imbs, Sergio Rajsbaum and Michel Raynal -- Pseudorandomness of a Random Kronecker Sequence / Eda Cesaratto and Brigitte Vallée -- Revisiting the Cache Miss Analysis of Multithreaded Algorithms / Richard Cole and Vijaya Ramachandran -- Parameterized Complexity of MaxSat above Average / Robert Crowston, Gregory Gutin, Mark Jones, Venkatesh Raman and Saket Saurabh -- Solving the 2-Disjoint Connected Subgraphs Problem Faster Than 2n / Marek Cygan, Marcin Pilipczuk, Michał Pilipczuk and Jakub Onufry Wojtaszczyk |
|
On the Non-progressive Spread of Influence through Social Networks / MohammadAmin Fazli, Mohammad Ghodsi, Jafar Habibi, Pooya Jalaly Khalilabadi and Vahab Mirrokni, et al. -- Forbidden Patterns / Johannes Fischer, Travis Gagie, Tsvi Kopelowitz, Moshe Lewenstein and Veli Mäkinen, et al. -- Structural Complexity of Multiobjective NP Search Problems / Krzysztof Fleszar, Christian Glaßer, Fabian Lipp, Christian Reitwießner and Maximilian Witek -- k-Gap Interval Graphs / Fedor V. Fomin, Serge Gaspers, Petr Golovach, Karol Suchan and Stefan Szeider, et al. -- Decidability Classes for Mobile Agents Computing / Pierre Fraigniaud and Andrzej Pelc -- NE Is Not NP Turing Reducible to Nonexponentially Dense NP Sets / Bin Fu -- Efficient Arbitrary and Resolution Proofs of Unsatisfiability for Restricted Tree-Width / Martin Fürer -- Indexed Multi-pattern Matching / Travis Gagie, Kalle Karhu, Juha Kärkkäinen, Veli Mäkinen and Leena Salmela, et al. -- New Lower Bound on Max Cut of Hypergraphs with an Application to r-Set Splitting / Archontia C. Giannopoulou, Sudeshna Kolay and Saket Saurabh |
|
Cache Me If You Can: Capacitated Selfish Replication Games / Ragavendran Gopalakrishnan, Dimitrios Kanoulas, Naga Naresh Karuturi, C. Pandu Rangan and Rajmohan Rajaraman, et al. -- The Efficiency of MapReduce in Parallel External Memory / Gero Greiner and Riko Jacob -- Algorithms for Some H-Join Decompositions / Michel Habib, Antoine Mamcarz and Fabien de Montgolfier -- On the Bend-Number of Planar and Outerplanar Graphs / Daniel Heldt, Kolja Knauer and Torsten Ueckerdt -- Hiring above the m-th Best Candidate: A Generalization of Records in Permutations / Ahmed Helmi, Conrado Martínez and Alois Panholzer -- On the Performance of Smith's Rule in Single-Machine Scheduling with Nonlinear Cost / Wiebke Höhn and Tobias Jacobs -- Advantage of Overlapping Clusters for Minimizing Conductance / Rohit Khandekar, Guy Kortsarz and Vahab Mirrokni -- Independence of Tabulation-Based Hash Classes / Toryn Qwyllyn Klassen and Philipp Woelfel -- Oblivious Two-Way Finite Automata: Decidability and Complexity / Martin Kutrib, Andreas Malcher and Giovanni Pighizzini |
|
Clique-Colouring and Biclique-Colouring Unichord-Free Graphs / Hélio B. Macêdo Filho, Raphael C.S. Machado and Celina M.H. Figueiredo -- Random Walks and Bisections in Random Circulant Graphs / Bernard Mans and Igor E. Shparlinski -- The Feedback Arc Set Problem with Triangle Inequality Is a Vertex Cover Problem / Monaldo Mastrolilli -- Fully Analyzing an Algebraic Pólya Urn Model / Basile Morcrette -- Degree-Constrained Node-Connectivity / Zeev Nutov -- Survivable Network Activation Problems / Zeev Nutov -- On the Integrality Gap of the Subtour LP for the 1,2-TSP / Jiawei Qian, Frans Schalekamp, David P. Williamson and Anke van Zuylen -- A Theory and Algorithms for Combinatorial Reoptimization / Hadas Shachnai, Gal Tamir and Tami Tamir -- Capacity Achieving Two-Write WOM Codes / Amir Shpilka -- The Relationship between Inner Product and Counting Cycles / Xiaoming Sun, Chengu Wang and Wei Yu -- Approximating Minimum Label s-t Cut via Linear Programming / Linqing Tang and Peng Zhang |
| Summary |
Annotation This book constitutes the proceedings of the 10th Latin American Symposium on Theoretical Informatics, LATIN 2012, held in Arequipa, Peru, in April 2012. The 55 papers presented in this volume were carefully reviewed and selected from 153 submissions. The papers address a variety of topics in theoretical computer science with a certain focus on algorithms, automata theory and formal languages, coding theory and data compression, algorithmic graph theory and combinatorics, complexity theory, computational algebra, computational biology, computational geometry, computational number theory, cryptography, theoretical aspects of databases and information retrieval, data structures, networks, logic in computer science, machine learning, mathematical programming, parallel and distributed computing, pattern matching, quantum computing and random structures |
| Analysis |
Computer science |
|
Computer Communication Networks |
|
Computer software |
|
Electronic data processing |
|
Computational complexity |
|
Algorithm Analysis and Problem Complexity |
|
Discrete Mathematics in Computer Science |
|
Numeric Computing |
|
Information Systems Applications (incl. Internet) |
|
Computation by Abstract Devices |
| Bibliography |
Includes bibliographical references and author index |
| Notes |
English |
| In |
Springer eBooks |
| Subject |
Computer science -- Congresses
|
|
Software
|
|
Electronic Data Processing
|
|
software.
|
|
Informatique.
|
|
Computer science
|
| Genre/Form |
Conference papers and proceedings
|
|
Software.
|
| Form |
Electronic book
|
| Author |
Fernández-Baca, David.
|
| ISBN |
9783642293443 |
|
3642293441 |
|
