Coverart for item
The Resource Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part I, Artur Czumaj...[et al.] (eds.), (electronic book)

Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part I, Artur Czumaj...[et al.] (eds.), (electronic book)

Label
Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part I
Title
Automata, Languages, and Programming
Title remainder
39th International Colloquium, ICALP 2012, Warwick, UK, July 9-13, 2012, Proceedings
Title number
Part I
Statement of responsibility
Artur Czumaj...[et al.] (eds.)
Title variation
ICALP 2012
Creator
Contributor
Subject
Genre
Language
eng
Member of
Cataloging source
GW5XE
Dewey number
005.1/3
Index
index present
LC call number
QA76.7
LC item number
.I58 2012
Literary form
non fiction
http://bibfra.me/vocab/lite/meetingDate
2012
http://bibfra.me/vocab/lite/meetingName
International Colloquium on Automata, Languages, and Programming
Nature of contents
  • dictionaries
  • bibliography
http://library.link/vocab/relatedWorkOrContributorName
Czumaj, Artur
Series statement
  • Lecture notes in computer science,
  • Advanced research in computing and software science
  • LNCS sublibrary. SL 1, Theoretical computer science and general issues
Series volume
7391
http://library.link/vocab/subjectName
  • Programming languages (Electronic computers)
  • Computer programming
Label
Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part I, Artur Czumaj...[et al.] (eds.), (electronic book)
Instantiates
Publication
Note
International conference proceedings
Antecedent source
unknown
Bibliography note
Includes bibliographical references and author index
Color
multicolored
Contents
  • Polynomial-Time Isomorphism Test for Groups with No Abelian Normal Subgroups
  • (Extended Abstract)
  • László Babai, Paolo Codenotti and Youming Qiao
  • Clustering under Perturbation Resilience
  • Maria Florina Balcan and Yingyu Liang
  • Secretary Problems with Convex Costs
  • Siddharth Barman, Seeun Umboh, Shuchi Chawla and David Malec
  • Nearly Simultaneously Resettable Black-Box Zero Knowledge
  • Joshua Baron, Rafail Ostrovsky and Ivan Visconti
  • Complexity of Complexity and Maximal Plain versus Prefix-Free Kolmogorov Complexity
  • Unsatisfiability Bounds for Random CSPs from an Energetic Interpolation Method
  • Bruno Bauwens
  • On Quadratic Programming with a Ratio Objective
  • Aditya Bhaskara, Moses Charikar, Rajsekar Manokaran and Aravindan Vijayaraghavan
  • De-amortizing Binary Search Trees
  • Prosenjit Bose, Sébastien Collette, Rolf Fagerberg and Stefan Langerman
  • Efficient Sampling Methods for Discrete Distributions
  • Karl Bringmann and Konstantinos Panagiotou
  • Approximation Algorithms for Online Weighted Rank Function Maximization under Matroid Constraints
  • Niv Buchbinder, Joseph (Seffi) Naor, R. Ravi and Mohit Singh
  • Improved LP-Rounding Approximation Algorithm for k-level Uncapacitated Facility Location
  • Dimitris Achlioptas and Ricardo Menchaca-Mendez
  • Jaroslaw Byrka and Bartosz Rybicki
  • Testing Coverage Functions
  • Deeparnab Chakrabarty and Zhiyi Huang
  • Sparse Fault-Tolerant Spanners for Doubling Metrics with Bounded Hop-Diameter or Degree
  • T. -H. Hubert Chan, Mingfei Li and Li Ning --
  • The NOF Multiparty Communication Complexity of Composed Functions
  • Anil Ada, Arkadev Chattopadhyay, Omar Fawzi and Phuong Nguyen
  • Quantum Strategies Are Better Than Classical in Almost Any XOR Game
  • Andris Ambainis, Artūrs Bačkurs, Kaspars Balodis, Dmitrijs Kravčenko and Raitis Ozols, et al.
  • Efficient Submodular Function Maximization under Linear Packing Constraints
  • Yossi Azar and Iftah Gamzu
  • Max-Cut Parameterized above the Edwards-Erdős Bound
  • Robert Crowston, Mark Jones and Matthias Mnich
  • Clique Cover and Graph Separation: New Incompressibility Results
  • Marek Cygan, Stefan Kratsch, Marcin Pilipczuk, Michał Pilipczuk and Magnus Wahlström
  • The Inverse Shapley Value Problem
  • Anindya De, Ilias Diakonikolas and Rocco Servedio
  • Zero-One Rounding of Singular Vectors
  • Amit Deshpande, Ravindran Kannan and Nikhil Srivastava
  • Label Cover Instances with Large Girth and the Hardness of Approximating Basic k-Spanner
  • Michael Dinitz, Guy Kortsarz and Ran Raz
  • A Dependent LP-Rounding Approach for the k-Median Problem
  • Space-Constrained Interval Selection
  • Yuval Emek, Magnús M. Halldórsson and Adi Rosén
  • Polynomial Time Algorithms for Branching Markov Decision Processes and Probabilistic Min(Max) Polynomial Bellman Equations
  • Kousha Etessami, Alistair Stewart and Mihalis Yannakakis
  • Succinct Indices for Range Queries with Applications to Orthogonal Range Maxima
  • Arash Farzan, J. Ian Munro and Rajeev Raman
  • Universal Factor Graphs
  • Uriel Feige and Shlomo Jozeph
  • Parameterized Approximation via Fidelity Preserving Transformations
  • Michael R. Fellows, Ariel Kulik, Frances Rosamond and Hadas Shachnai
  • Moses Charikar and Shi Li
  • Backdoors to Acyclic SAT
  • Serge Gaspers and Stefan Szeider
  • Dominators, Directed Bipolar Orders, and Independent Spanning Trees
  • Loukas Georgiadis and Robert E. Tarjan
  • Hardness of Approximation for Quantum Problems
  • Sevag Gharibian and Julia Kempe --
  • Node-Weighted Network Design in Planar and Minor-Closed Families of Graphs
  • Chandra Chekuri, Alina Ene and Ali Vakilian
  • Computing the Visibility Polygon of an Island in a Polygonal Domain
  • Danny Z. Chen and Haitao Wang
  • Directed Subset Feedback Vertex Set Is Fixed-Parameter Tractable
  • Rajesh Chitnis, Marek Cygan, Mohammadtaghi Hajiaghayi and Dániel Marx
  • Streaming and Communication Complexity of Clique Approximation
  • Magnús M. Halldórsson, Xiaoming Sun, Mario Szegedy and Chengu Wang
  • Distributed Private Heavy Hitters
  • Justin Hsu, Sanjeev Khanna and Aaron Roth
  • A Thirty Year Old Conjecture about Promise Problems
  • Andrew Hughes, A. Pavan, Nathan Russell and Alan Selman
  • Minimum Latency Submodular Cover
  • Sungjin Im, Viswanath Nagarajan and Ruben van der Zwaan
  • Constant-Time Algorithms for Sparsity Matroids
  • Hiro Ito, Shin-Ichi Tanigawa and Yuichi Yoshida
  • The Complexity of Computing the Sign of the Tutte Polynomial (and Consequent #P-hardness of Approximation)
  • CRAM: Compressed Random Access Memory
  • Jesper Jansson, Kunihiko Sadakane and Wing-Kin Sung
  • Improving Quantum Query Complexity of Boolean Matrix Multiplication Using Graph Collision
  • Stacey Jeffery, Robin Kothari and Frédéric Magniez
  • Faster Fully Compressed Pattern Matching by Recompression
  • Artur Jeż
  • NNS Lower Bounds via Metric Expansion for l∞ and EMD
  • Michael Kapralov and Rina Panigrahy
  • Quantum Adversary (Upper) Bound
  • Shelby Kimmel
  • Leslie Ann Goldberg and Mark Jerrum
  • Solving Planar k-Terminal Cut in O(nc Ök)O(nck) Time
  • Philip N. Klein and Dániel Marx
  • Fixed-Parameter Tractability of Multicut in Directed Acyclic Graphs
  • Stefan Kratsch, Marcin Pilipczuk, Michał Pilipczuk and Magnus Wahlström
  • Preserving Terminal Distances Using Minors
  • Robert Krauthgamer and Tamar Zondiner
  • A Rounding by Sampling Approach to the Minimum Size k-Arc Connected Subgraph Problem
  • Bundit Laekhanukit, Shayan Oveis Gharan and Mohit Singh --
  • Stochastic Vehicle Routing with Recourse
  • Inge Li Gørtz, Viswanath Nagarajan and Rishi Saket
  • The Online Metric Matching Problem for Doubling Metrics
  • Anupam Gupta and Kevin Lewi
  • Approximating Sparse Covering Integer Programs Online
  • Anupam Gupta and Viswanath Nagarajan
  • Assigning Sporadic Tasks to Unrelated Parallel Machines
  • Alberto Marchetti-Spaccamela, Cyriel Rutten, Suzanne van der Ster and Andreas Wiese
  • A Tight Lower Bound for Planar Multiway Cut with Fixed Number of Terminals
  • Dániel Marx
  • The Power of Recourse for Online MST and TSP
  • Nicole Megow, Martin Skutella, José Verschae and Andreas Wiese
  • Geometry of Online Packing Linear Programs
  • Marco Molinaro and R. Ravi
  • Self-assembly with Geometric Tiles
  • Bin Fu, Matthew J. Patitz, Robert T. Schweller and Robert Sheline
  • Classical and Quantum Partition Bound and Detector Inefficiency
  • Quasi-polynomial Local Search for Restricted Max-Min Fair Allocation
  • Lukas Polacek and Ola Svensson
  • Strictly-Black-Box Zero-Knowledge and Efficient Validation of Financial Transactions
  • Michael O. Rabin, Yishay Mansour, S. Muthukrishnan and Moti Yung
  • Parameterized Tractability of Multiway Cut with Parity Constraints
  • Daniel Lokshtanov and M. S. Ramanujan
  • Set Cover Revisited: Hypergraph Cover with Hard Capacities
  • Barna Saha and Samir Khuller
  • On the Limits of Sparsification
  • Rahul Santhanam and Srikanth Srinivasan
  • Sophie Laplante, Virginie Lerays and Jérémie Roland
  • Certifying 3-Connectivity in Linear Time
  • Jens M. Schmidt
  • Epsilon-Net Method for Optimizations over Separable States
  • Yaoyun Shi and Xiaodi Wu
  • Faster Algorithms for Privately Releasing Marginals
  • Justin Thaler, Jonathan Ullman and Salil Vadhan
  • Stochastic Matching with Commitment
  • Kevin P. Costello, Prasad Tetali and Pushkar Tripathi
  • Rademacher-Sketch: A Dimensionality-Reducing Embedding for Sum-Product Norms, with an Application to Earth-Mover Distance
  • Elad Verbin and Qin Zhang
  • Testing Similar Means
  • A Matrix Hyperbolic Cosine Algorithm and Applications
  • Anastasios Zouzias
  • Reut Levi, Dana Ron and Ronitt Rubinfeld
  • The Parameterized Complexity of k-Edge Induced Subgraphs
  • Bingkai Lin and Yijia Chen
  • Converting Online Algorithms to Local Computation Algorithms
  • Yishay Mansour, Aviad Rubinstein, Shai Vardi and Ning Xie
Control code
SPR797966055
Dimensions
unknown
Extent
1 online resource.
File format
unknown
Form of item
online
Isbn
9783642315947
Isbn Type
(electronic bk.)
Level of compression
unknown
Quality assurance targets
not applicable
Reformatting quality
unknown
Reproduction note
Electronic resource.
Sound
unknown sound
Specific material designation
remote
Label
Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part I, Artur Czumaj...[et al.] (eds.), (electronic book)
Publication
Note
International conference proceedings
Antecedent source
unknown
Bibliography note
Includes bibliographical references and author index
Color
multicolored
Contents
  • Polynomial-Time Isomorphism Test for Groups with No Abelian Normal Subgroups
  • (Extended Abstract)
  • László Babai, Paolo Codenotti and Youming Qiao
  • Clustering under Perturbation Resilience
  • Maria Florina Balcan and Yingyu Liang
  • Secretary Problems with Convex Costs
  • Siddharth Barman, Seeun Umboh, Shuchi Chawla and David Malec
  • Nearly Simultaneously Resettable Black-Box Zero Knowledge
  • Joshua Baron, Rafail Ostrovsky and Ivan Visconti
  • Complexity of Complexity and Maximal Plain versus Prefix-Free Kolmogorov Complexity
  • Unsatisfiability Bounds for Random CSPs from an Energetic Interpolation Method
  • Bruno Bauwens
  • On Quadratic Programming with a Ratio Objective
  • Aditya Bhaskara, Moses Charikar, Rajsekar Manokaran and Aravindan Vijayaraghavan
  • De-amortizing Binary Search Trees
  • Prosenjit Bose, Sébastien Collette, Rolf Fagerberg and Stefan Langerman
  • Efficient Sampling Methods for Discrete Distributions
  • Karl Bringmann and Konstantinos Panagiotou
  • Approximation Algorithms for Online Weighted Rank Function Maximization under Matroid Constraints
  • Niv Buchbinder, Joseph (Seffi) Naor, R. Ravi and Mohit Singh
  • Improved LP-Rounding Approximation Algorithm for k-level Uncapacitated Facility Location
  • Dimitris Achlioptas and Ricardo Menchaca-Mendez
  • Jaroslaw Byrka and Bartosz Rybicki
  • Testing Coverage Functions
  • Deeparnab Chakrabarty and Zhiyi Huang
  • Sparse Fault-Tolerant Spanners for Doubling Metrics with Bounded Hop-Diameter or Degree
  • T. -H. Hubert Chan, Mingfei Li and Li Ning --
  • The NOF Multiparty Communication Complexity of Composed Functions
  • Anil Ada, Arkadev Chattopadhyay, Omar Fawzi and Phuong Nguyen
  • Quantum Strategies Are Better Than Classical in Almost Any XOR Game
  • Andris Ambainis, Artūrs Bačkurs, Kaspars Balodis, Dmitrijs Kravčenko and Raitis Ozols, et al.
  • Efficient Submodular Function Maximization under Linear Packing Constraints
  • Yossi Azar and Iftah Gamzu
  • Max-Cut Parameterized above the Edwards-Erdős Bound
  • Robert Crowston, Mark Jones and Matthias Mnich
  • Clique Cover and Graph Separation: New Incompressibility Results
  • Marek Cygan, Stefan Kratsch, Marcin Pilipczuk, Michał Pilipczuk and Magnus Wahlström
  • The Inverse Shapley Value Problem
  • Anindya De, Ilias Diakonikolas and Rocco Servedio
  • Zero-One Rounding of Singular Vectors
  • Amit Deshpande, Ravindran Kannan and Nikhil Srivastava
  • Label Cover Instances with Large Girth and the Hardness of Approximating Basic k-Spanner
  • Michael Dinitz, Guy Kortsarz and Ran Raz
  • A Dependent LP-Rounding Approach for the k-Median Problem
  • Space-Constrained Interval Selection
  • Yuval Emek, Magnús M. Halldórsson and Adi Rosén
  • Polynomial Time Algorithms for Branching Markov Decision Processes and Probabilistic Min(Max) Polynomial Bellman Equations
  • Kousha Etessami, Alistair Stewart and Mihalis Yannakakis
  • Succinct Indices for Range Queries with Applications to Orthogonal Range Maxima
  • Arash Farzan, J. Ian Munro and Rajeev Raman
  • Universal Factor Graphs
  • Uriel Feige and Shlomo Jozeph
  • Parameterized Approximation via Fidelity Preserving Transformations
  • Michael R. Fellows, Ariel Kulik, Frances Rosamond and Hadas Shachnai
  • Moses Charikar and Shi Li
  • Backdoors to Acyclic SAT
  • Serge Gaspers and Stefan Szeider
  • Dominators, Directed Bipolar Orders, and Independent Spanning Trees
  • Loukas Georgiadis and Robert E. Tarjan
  • Hardness of Approximation for Quantum Problems
  • Sevag Gharibian and Julia Kempe --
  • Node-Weighted Network Design in Planar and Minor-Closed Families of Graphs
  • Chandra Chekuri, Alina Ene and Ali Vakilian
  • Computing the Visibility Polygon of an Island in a Polygonal Domain
  • Danny Z. Chen and Haitao Wang
  • Directed Subset Feedback Vertex Set Is Fixed-Parameter Tractable
  • Rajesh Chitnis, Marek Cygan, Mohammadtaghi Hajiaghayi and Dániel Marx
  • Streaming and Communication Complexity of Clique Approximation
  • Magnús M. Halldórsson, Xiaoming Sun, Mario Szegedy and Chengu Wang
  • Distributed Private Heavy Hitters
  • Justin Hsu, Sanjeev Khanna and Aaron Roth
  • A Thirty Year Old Conjecture about Promise Problems
  • Andrew Hughes, A. Pavan, Nathan Russell and Alan Selman
  • Minimum Latency Submodular Cover
  • Sungjin Im, Viswanath Nagarajan and Ruben van der Zwaan
  • Constant-Time Algorithms for Sparsity Matroids
  • Hiro Ito, Shin-Ichi Tanigawa and Yuichi Yoshida
  • The Complexity of Computing the Sign of the Tutte Polynomial (and Consequent #P-hardness of Approximation)
  • CRAM: Compressed Random Access Memory
  • Jesper Jansson, Kunihiko Sadakane and Wing-Kin Sung
  • Improving Quantum Query Complexity of Boolean Matrix Multiplication Using Graph Collision
  • Stacey Jeffery, Robin Kothari and Frédéric Magniez
  • Faster Fully Compressed Pattern Matching by Recompression
  • Artur Jeż
  • NNS Lower Bounds via Metric Expansion for l∞ and EMD
  • Michael Kapralov and Rina Panigrahy
  • Quantum Adversary (Upper) Bound
  • Shelby Kimmel
  • Leslie Ann Goldberg and Mark Jerrum
  • Solving Planar k-Terminal Cut in O(nc Ök)O(nck) Time
  • Philip N. Klein and Dániel Marx
  • Fixed-Parameter Tractability of Multicut in Directed Acyclic Graphs
  • Stefan Kratsch, Marcin Pilipczuk, Michał Pilipczuk and Magnus Wahlström
  • Preserving Terminal Distances Using Minors
  • Robert Krauthgamer and Tamar Zondiner
  • A Rounding by Sampling Approach to the Minimum Size k-Arc Connected Subgraph Problem
  • Bundit Laekhanukit, Shayan Oveis Gharan and Mohit Singh --
  • Stochastic Vehicle Routing with Recourse
  • Inge Li Gørtz, Viswanath Nagarajan and Rishi Saket
  • The Online Metric Matching Problem for Doubling Metrics
  • Anupam Gupta and Kevin Lewi
  • Approximating Sparse Covering Integer Programs Online
  • Anupam Gupta and Viswanath Nagarajan
  • Assigning Sporadic Tasks to Unrelated Parallel Machines
  • Alberto Marchetti-Spaccamela, Cyriel Rutten, Suzanne van der Ster and Andreas Wiese
  • A Tight Lower Bound for Planar Multiway Cut with Fixed Number of Terminals
  • Dániel Marx
  • The Power of Recourse for Online MST and TSP
  • Nicole Megow, Martin Skutella, José Verschae and Andreas Wiese
  • Geometry of Online Packing Linear Programs
  • Marco Molinaro and R. Ravi
  • Self-assembly with Geometric Tiles
  • Bin Fu, Matthew J. Patitz, Robert T. Schweller and Robert Sheline
  • Classical and Quantum Partition Bound and Detector Inefficiency
  • Quasi-polynomial Local Search for Restricted Max-Min Fair Allocation
  • Lukas Polacek and Ola Svensson
  • Strictly-Black-Box Zero-Knowledge and Efficient Validation of Financial Transactions
  • Michael O. Rabin, Yishay Mansour, S. Muthukrishnan and Moti Yung
  • Parameterized Tractability of Multiway Cut with Parity Constraints
  • Daniel Lokshtanov and M. S. Ramanujan
  • Set Cover Revisited: Hypergraph Cover with Hard Capacities
  • Barna Saha and Samir Khuller
  • On the Limits of Sparsification
  • Rahul Santhanam and Srikanth Srinivasan
  • Sophie Laplante, Virginie Lerays and Jérémie Roland
  • Certifying 3-Connectivity in Linear Time
  • Jens M. Schmidt
  • Epsilon-Net Method for Optimizations over Separable States
  • Yaoyun Shi and Xiaodi Wu
  • Faster Algorithms for Privately Releasing Marginals
  • Justin Thaler, Jonathan Ullman and Salil Vadhan
  • Stochastic Matching with Commitment
  • Kevin P. Costello, Prasad Tetali and Pushkar Tripathi
  • Rademacher-Sketch: A Dimensionality-Reducing Embedding for Sum-Product Norms, with an Application to Earth-Mover Distance
  • Elad Verbin and Qin Zhang
  • Testing Similar Means
  • A Matrix Hyperbolic Cosine Algorithm and Applications
  • Anastasios Zouzias
  • Reut Levi, Dana Ron and Ronitt Rubinfeld
  • The Parameterized Complexity of k-Edge Induced Subgraphs
  • Bingkai Lin and Yijia Chen
  • Converting Online Algorithms to Local Computation Algorithms
  • Yishay Mansour, Aviad Rubinstein, Shai Vardi and Ning Xie
Control code
SPR797966055
Dimensions
unknown
Extent
1 online resource.
File format
unknown
Form of item
online
Isbn
9783642315947
Isbn Type
(electronic bk.)
Level of compression
unknown
Quality assurance targets
not applicable
Reformatting quality
unknown
Reproduction note
Electronic resource.
Sound
unknown sound
Specific material designation
remote

Library Locations

Processing Feedback ...