Borrow it
 African Studies Library
 Alumni Medical Library
 Astronomy Library
 Fineman and Pappas Law Libraries
 Frederick S. Pardee Management Library
 Howard Gotlieb Archival Research Center
 Mugar Memorial Library
 Music Library
 Pikering Educational Resources Library
 School of Theology Library
 Science & Engineering Library
 Stone Science Library
The Resource Automata, languages and programming : 37th international colloquium, ICALP 2010, Bordeaux, France, July 610, 2010 ; proceedings, Part I, Samson Abramsky ... [et al.] (eds.), (electronic resource)
Automata, languages and programming : 37th international colloquium, ICALP 2010, Bordeaux, France, July 610, 2010 ; proceedings, Part I, Samson Abramsky ... [et al.] (eds.), (electronic resource)
Resource Information
The item Automata, languages and programming : 37th international colloquium, ICALP 2010, Bordeaux, France, July 610, 2010 ; proceedings, Part I, Samson Abramsky ... [et al.] (eds.), (electronic resource) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in Boston University Libraries.This item is available to borrow from all library branches.
Resource Information
The item Automata, languages and programming : 37th international colloquium, ICALP 2010, Bordeaux, France, July 610, 2010 ; proceedings, Part I, Samson Abramsky ... [et al.] (eds.), (electronic resource) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in Boston University Libraries.
This item is available to borrow from all library branches.
 Summary
 The twovolume set LNCS 6198 and LNCS 6199 constitutes the refereed proceedings of the 37th International Colloquium on Automata, Languages and Programming, ICALP 2010, held in Bordeaux, France, in July 2010. The 106 revised full papers (60 papers for track A, 30 for track B, and 16 for track C) presented together with 6 invited talks were carefully reviewed and selected from a total of 389 submissions. The papers are grouped in three major tracks on algorithms, complexity and games; on logic, semantics, automata, and theory of programming; as well as on foundations of networked computation: models, algorithms and information management. LNCS 6198 contains 60 contributions of track A selected from 222 submissions as well as 2 invited talks
 Language
 eng
 Extent
 1 online resource (754 p.)
 Note
 International conference proceedings
 Contents

 Invited Talks
 Local Search: Simple, Successful, But Sometimes Sluggish
 When Conflicting Constraints Can Be Resolved – The Lovász Local Lemma and Satisfiability
 Session 1Track A. Combinatorial Optimization
 Plane Spanners of Maximum Degree Six
 The Positive Semidefinite Grothendieck Problem with Rank Constraint
 Cycle Detection and Correction
 Decomposition Width of Matroids
 Session 2Track A1. Game Theory
 The Cooperative Game Theory Foundations of Network Bargaining Games
 On the Existence of Pure Nash Equilibria in Weighted Congestion Games
 On the Limitations of Greedy Mechanism Design for Truthful Combinatorial Auctions
 MeanPayoff Games and Propositional Proofs
 Session 2Track A2. Security
 Online Network Design with Outliers
 Efficient Completely Nonmalleable Public Key Encryption
 PolynomialSpace Approximation of NoSignaling Provers
 From Secrecy to Soundness: Efficient Verification via Secure Computation
 Session 3Track A1. Data Structures
 Mergeable Dictionaries
 Faster Algorithms for Semimatching Problems (Extended Abstract)
 Clustering with Diversity
 New Data Structures for Subgraph Connectivity
 Session 3Track A2. Sorting & Hashing
 Tight Thresholds for Cuckoo Hashing via XORSAT
 Resource Oblivious Sorting on Multicores
 Interval Sorting
 Session 4Track A. Graphs, Nets and Optimization
 Inapproximability of Hypergraph Vertex Cover and Applications to Scheduling Problems
 Thresholded Covering Algorithms for Robust and Maxmin Optimization
 Graph Homomorphisms with Complex Values: A Dichotomy Theorem
 Metrical Task Systems and the kServer Problem on HSTs
 Session 5Track A1. Scheduling
 Scheduling Periodic Tasks in a Hard RealTime Environment
 Scalably Scheduling PowerHeterogeneous Processors
 Better Scalable Algorithms for Broadcast Scheduling
 Maxmin Online Allocations with a Reordering Buffer
 Session 5Track A2. Graphs & Hypergraphs
 Orientability of Random Hypergraphs and the Power of Multiple Choices
 On the Inapproximability of Vertex Cover on kPartite kUniform Hypergraphs
 Dynamic Programming for Graphs on Surfaces
 Interval Graphs: Canonical Representation in Logspace
 Session 6Track A. Best Paper Award
 Approximating the Partition Function of the Ferromagnetic Potts Model
 Session 7Track A. Algebraic Problems
 On the Relation between Polynomial Identity Testing and Finding Variable Disjoint Factors
 On Sums of Roots of Unity
 Exponential Time Complexity of the Permanent and the Tutte Polynomial
 On Approximate Horn Formula Minimization
 Session 8Track A. Networks & Communication Complexity
 Choosing, Agreeing, and Eliminating in Communication Complexity
 Additive Spanners in Nearly Quadratic Time
 Composition Theorems in Communication Complexity
 Network Design via Core Detouring for Problems without a Core
 Session 9Track A1. Complexity & Automata
 Weak Completeness Notions for Exponential Time
 Efficient Evaluation of Nondeterministic Automata Using Factorization Forests
 On the Complexity of Searching in Trees: AverageCase Minimization
 Session 9Track A2. Finding & Testing
 Finding Is as Easy as Detecting for Quantum Walks
 Improved Constructions for Nonadaptive Threshold Group Testing
 Testing Nonuniform kWise Independent Distributions over Product Spaces
 Session 10Track A1. Approximations
 A Sublogarithmic Approximation for Highway and Tollbooth Pricing
 Maximum Quadratic Assignment Problem: Reduction from Maximum Label Cover and LPBased Approximation Algorithm
 Cell Probe Lower Bounds and Approximations for Range Mode
 SDP Gaps for 2to1 and Other LabelCover Variants
 Session 10Track A2. Streaming & Preprocessing
 Data Stream Algorithms for Codeword Testing
 Streaming Algorithms for Independent Sets
 Preprocessing of Min Ones Problems: A Dichotomy
 Holographic Reduction: A Domain Changed Application and Its Partial Converse Theorems
 Session 11Track A1. Adaptive, Knowledge & Optimality
 Optimal TradeOffs for Succinct String Indexes
 Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems
 Concurrent Knowledge Extraction in the PublicKey Model
 Session 11Track A2. Covering, Graphs & Independence
 On the kIndependence Required by Linear Probing and Minwise Independence
 Covering and Packing in Linear Space
 Testing 2Vertex Connectivity and Computing Pairs of VertexDisjoint st Paths in Digraphs
 Isbn
 9783642141652
 Label
 Automata, languages and programming : 37th international colloquium, ICALP 2010, Bordeaux, France, July 610, 2010 ; proceedings, Part I
 Title
 Automata, languages and programming
 Title remainder
 37th international colloquium, ICALP 2010, Bordeaux, France, July 610, 2010 ; proceedings
 Title number
 Part I
 Statement of responsibility
 Samson Abramsky ... [et al.] (eds.)
 Title variation
 ICALP 2010
 Subject

 Artificial intelligence  Congresses
 Electronic books
 Machine theory
 Machine theory  Congresses
 Machine theory  Congresses
 Artificial intelligence  Congresses
 Conference proceedings
 Electronic resources
 Artificial intelligence
 Intelligence artificielle  Congrès
 Informatique
 Théorie des automates  Congrès
 Language
 eng
 Summary
 The twovolume set LNCS 6198 and LNCS 6199 constitutes the refereed proceedings of the 37th International Colloquium on Automata, Languages and Programming, ICALP 2010, held in Bordeaux, France, in July 2010. The 106 revised full papers (60 papers for track A, 30 for track B, and 16 for track C) presented together with 6 invited talks were carefully reviewed and selected from a total of 389 submissions. The papers are grouped in three major tracks on algorithms, complexity and games; on logic, semantics, automata, and theory of programming; as well as on foundations of networked computation: models, algorithms and information management. LNCS 6198 contains 60 contributions of track A selected from 222 submissions as well as 2 invited talks
 Cataloging source
 GW5XE
 Image bit depth
 0
 LC call number
 QA267
 LC item number
 .I58 2010
 Literary form
 non fiction
 http://bibfra.me/vocab/lite/meetingDate
 2010
 http://bibfra.me/vocab/lite/meetingName
 International Colloquium on Automata, Languages, and Programming
 Nature of contents
 dictionaries
 http://library.link/vocab/relatedWorkOrContributorName
 SpringerLink
 Series statement
 Lecture Notes in Computer Science,
 Series volume
 6198
 http://library.link/vocab/subjectName

 Machine theory
 Artificial intelligence
 Théorie des automates
 Intelligence artificielle
 Artificial intelligence
 Machine theory
 Informatique
 Label
 Automata, languages and programming : 37th international colloquium, ICALP 2010, Bordeaux, France, July 610, 2010 ; proceedings, Part I, Samson Abramsky ... [et al.] (eds.), (electronic resource)
 Note
 International conference proceedings
 Antecedent source
 mixed
 Bibliography note
 Includes bibliographical references and author index
 Color
 not applicable
 Contents
 Invited Talks  Local Search: Simple, Successful, But Sometimes Sluggish  When Conflicting Constraints Can Be Resolved – The Lovász Local Lemma and Satisfiability  Session 1Track A. Combinatorial Optimization  Plane Spanners of Maximum Degree Six  The Positive Semidefinite Grothendieck Problem with Rank Constraint  Cycle Detection and Correction  Decomposition Width of Matroids  Session 2Track A1. Game Theory  The Cooperative Game Theory Foundations of Network Bargaining Games  On the Existence of Pure Nash Equilibria in Weighted Congestion Games  On the Limitations of Greedy Mechanism Design for Truthful Combinatorial Auctions  MeanPayoff Games and Propositional Proofs  Session 2Track A2. Security  Online Network Design with Outliers  Efficient Completely Nonmalleable Public Key Encryption  PolynomialSpace Approximation of NoSignaling Provers  From Secrecy to Soundness: Efficient Verification via Secure Computation  Session 3Track A1. Data Structures  Mergeable Dictionaries  Faster Algorithms for Semimatching Problems (Extended Abstract)  Clustering with Diversity  New Data Structures for Subgraph Connectivity  Session 3Track A2. Sorting & Hashing  Tight Thresholds for Cuckoo Hashing via XORSAT  Resource Oblivious Sorting on Multicores  Interval Sorting  Session 4Track A. Graphs, Nets and Optimization  Inapproximability of Hypergraph Vertex Cover and Applications to Scheduling Problems  Thresholded Covering Algorithms for Robust and Maxmin Optimization  Graph Homomorphisms with Complex Values: A Dichotomy Theorem  Metrical Task Systems and the kServer Problem on HSTs  Session 5Track A1. Scheduling  Scheduling Periodic Tasks in a Hard RealTime Environment  Scalably Scheduling PowerHeterogeneous Processors  Better Scalable Algorithms for Broadcast Scheduling  Maxmin Online Allocations with a Reordering Buffer  Session 5Track A2. Graphs & Hypergraphs  Orientability of Random Hypergraphs and the Power of Multiple Choices  On the Inapproximability of Vertex Cover on kPartite kUniform Hypergraphs  Dynamic Programming for Graphs on Surfaces  Interval Graphs: Canonical Representation in Logspace  Session 6Track A. Best Paper Award  Approximating the Partition Function of the Ferromagnetic Potts Model  Session 7Track A. Algebraic Problems  On the Relation between Polynomial Identity Testing and Finding Variable Disjoint Factors  On Sums of Roots of Unity  Exponential Time Complexity of the Permanent and the Tutte Polynomial  On Approximate Horn Formula Minimization  Session 8Track A. Networks & Communication Complexity  Choosing, Agreeing, and Eliminating in Communication Complexity  Additive Spanners in Nearly Quadratic Time  Composition Theorems in Communication Complexity  Network Design via Core Detouring for Problems without a Core  Session 9Track A1. Complexity & Automata  Weak Completeness Notions for Exponential Time  Efficient Evaluation of Nondeterministic Automata Using Factorization Forests  On the Complexity of Searching in Trees: AverageCase Minimization  Session 9Track A2. Finding & Testing  Finding Is as Easy as Detecting for Quantum Walks  Improved Constructions for Nonadaptive Threshold Group Testing  Testing Nonuniform kWise Independent Distributions over Product Spaces  Session 10Track A1. Approximations  A Sublogarithmic Approximation for Highway and Tollbooth Pricing  Maximum Quadratic Assignment Problem: Reduction from Maximum Label Cover and LPBased Approximation Algorithm  Cell Probe Lower Bounds and Approximations for Range Mode  SDP Gaps for 2to1 and Other LabelCover Variants  Session 10Track A2. Streaming & Preprocessing  Data Stream Algorithms for Codeword Testing  Streaming Algorithms for Independent Sets  Preprocessing of Min Ones Problems: A Dichotomy  Holographic Reduction: A Domain Changed Application and Its Partial Converse Theorems  Session 11Track A1. Adaptive, Knowledge & Optimality  Optimal TradeOffs for Succinct String Indexes  Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems  Concurrent Knowledge Extraction in the PublicKey Model  Session 11Track A2. Covering, Graphs & Independence  On the kIndependence Required by Linear Probing and Minwise Independence  Covering and Packing in Linear Space  Testing 2Vertex Connectivity and Computing Pairs of VertexDisjoint st Paths in Digraphs
 Dimensions
 unknown
 Extent
 1 online resource (754 p.)
 File format
 multiple file formats
 Form of item

 online
 electronic
 Isbn
 9783642141652
 Level of compression
 uncompressed
 Quality assurance targets
 absent
 Reformatting quality
 access
 Specific material designation
 remote
 Stock number
 9783642141645
 System control number

 (OCoLC)663093698
 (OCoLC)ocn663093698
 Label
 Automata, languages and programming : 37th international colloquium, ICALP 2010, Bordeaux, France, July 610, 2010 ; proceedings, Part I, Samson Abramsky ... [et al.] (eds.), (electronic resource)
 Note
 International conference proceedings
 Antecedent source
 mixed
 Bibliography note
 Includes bibliographical references and author index
 Color
 not applicable
 Contents
 Invited Talks  Local Search: Simple, Successful, But Sometimes Sluggish  When Conflicting Constraints Can Be Resolved – The Lovász Local Lemma and Satisfiability  Session 1Track A. Combinatorial Optimization  Plane Spanners of Maximum Degree Six  The Positive Semidefinite Grothendieck Problem with Rank Constraint  Cycle Detection and Correction  Decomposition Width of Matroids  Session 2Track A1. Game Theory  The Cooperative Game Theory Foundations of Network Bargaining Games  On the Existence of Pure Nash Equilibria in Weighted Congestion Games  On the Limitations of Greedy Mechanism Design for Truthful Combinatorial Auctions  MeanPayoff Games and Propositional Proofs  Session 2Track A2. Security  Online Network Design with Outliers  Efficient Completely Nonmalleable Public Key Encryption  PolynomialSpace Approximation of NoSignaling Provers  From Secrecy to Soundness: Efficient Verification via Secure Computation  Session 3Track A1. Data Structures  Mergeable Dictionaries  Faster Algorithms for Semimatching Problems (Extended Abstract)  Clustering with Diversity  New Data Structures for Subgraph Connectivity  Session 3Track A2. Sorting & Hashing  Tight Thresholds for Cuckoo Hashing via XORSAT  Resource Oblivious Sorting on Multicores  Interval Sorting  Session 4Track A. Graphs, Nets and Optimization  Inapproximability of Hypergraph Vertex Cover and Applications to Scheduling Problems  Thresholded Covering Algorithms for Robust and Maxmin Optimization  Graph Homomorphisms with Complex Values: A Dichotomy Theorem  Metrical Task Systems and the kServer Problem on HSTs  Session 5Track A1. Scheduling  Scheduling Periodic Tasks in a Hard RealTime Environment  Scalably Scheduling PowerHeterogeneous Processors  Better Scalable Algorithms for Broadcast Scheduling  Maxmin Online Allocations with a Reordering Buffer  Session 5Track A2. Graphs & Hypergraphs  Orientability of Random Hypergraphs and the Power of Multiple Choices  On the Inapproximability of Vertex Cover on kPartite kUniform Hypergraphs  Dynamic Programming for Graphs on Surfaces  Interval Graphs: Canonical Representation in Logspace  Session 6Track A. Best Paper Award  Approximating the Partition Function of the Ferromagnetic Potts Model  Session 7Track A. Algebraic Problems  On the Relation between Polynomial Identity Testing and Finding Variable Disjoint Factors  On Sums of Roots of Unity  Exponential Time Complexity of the Permanent and the Tutte Polynomial  On Approximate Horn Formula Minimization  Session 8Track A. Networks & Communication Complexity  Choosing, Agreeing, and Eliminating in Communication Complexity  Additive Spanners in Nearly Quadratic Time  Composition Theorems in Communication Complexity  Network Design via Core Detouring for Problems without a Core  Session 9Track A1. Complexity & Automata  Weak Completeness Notions for Exponential Time  Efficient Evaluation of Nondeterministic Automata Using Factorization Forests  On the Complexity of Searching in Trees: AverageCase Minimization  Session 9Track A2. Finding & Testing  Finding Is as Easy as Detecting for Quantum Walks  Improved Constructions for Nonadaptive Threshold Group Testing  Testing Nonuniform kWise Independent Distributions over Product Spaces  Session 10Track A1. Approximations  A Sublogarithmic Approximation for Highway and Tollbooth Pricing  Maximum Quadratic Assignment Problem: Reduction from Maximum Label Cover and LPBased Approximation Algorithm  Cell Probe Lower Bounds and Approximations for Range Mode  SDP Gaps for 2to1 and Other LabelCover Variants  Session 10Track A2. Streaming & Preprocessing  Data Stream Algorithms for Codeword Testing  Streaming Algorithms for Independent Sets  Preprocessing of Min Ones Problems: A Dichotomy  Holographic Reduction: A Domain Changed Application and Its Partial Converse Theorems  Session 11Track A1. Adaptive, Knowledge & Optimality  Optimal TradeOffs for Succinct String Indexes  Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems  Concurrent Knowledge Extraction in the PublicKey Model  Session 11Track A2. Covering, Graphs & Independence  On the kIndependence Required by Linear Probing and Minwise Independence  Covering and Packing in Linear Space  Testing 2Vertex Connectivity and Computing Pairs of VertexDisjoint st Paths in Digraphs
 Dimensions
 unknown
 Extent
 1 online resource (754 p.)
 File format
 multiple file formats
 Form of item

 online
 electronic
 Isbn
 9783642141652
 Level of compression
 uncompressed
 Quality assurance targets
 absent
 Reformatting quality
 access
 Specific material designation
 remote
 Stock number
 9783642141645
 System control number

 (OCoLC)663093698
 (OCoLC)ocn663093698
Subject
 Artificial intelligence
 Artificial intelligence  Congresses
 Artificial intelligence  Congresses
 Conference proceedings
 Electronic books
 Electronic resources
 Informatique
 Intelligence artificielle  Congrès
 Machine theory
 Machine theory  Congresses
 Machine theory  Congresses
 Théorie des automates  Congrès
Genre
Member of
Library Locations

African Studies LibraryBorrow it771 Commonwealth Avenue, 6th Floor, Boston, MA, 02215, US42.350723 71.108227


Astronomy LibraryBorrow it725 Commonwealth Avenue, 6th Floor, Boston, MA, 02445, US42.350259 71.105717

Fineman and Pappas Law LibrariesBorrow it765 Commonwealth Avenue, Boston, MA, 02215, US42.350979 71.107023

Frederick S. Pardee Management LibraryBorrow it595 Commonwealth Avenue, Boston, MA, 02215, US42.349626 71.099547

Howard Gotlieb Archival Research CenterBorrow it771 Commonwealth Avenue, 5th Floor, Boston, MA, 02215, US42.350723 71.108227


Music LibraryBorrow it771 Commonwealth Avenue, 2nd Floor, Boston, MA, 02215, US42.350723 71.108227

Pikering Educational Resources LibraryBorrow it2 Silber Way, Boston, MA, 02215, US42.349804 71.101425

School of Theology LibraryBorrow it745 Commonwealth Avenue, 2nd Floor, Boston, MA, 02215, US42.350494 71.107235

Science & Engineering LibraryBorrow it38 Cummington Mall, Boston, MA, 02215, US42.348472 71.102257

Embed (Experimental)
Settings
Select options that apply then copy and paste the RDF/HTML data fragment to include in your application
Embed this data in a secure (HTTPS) page:
Layout options:
Include data citation:
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.bu.edu/portal/Automatalanguagesandprogramming37th/z_zDY0N1aO8/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.bu.edu/portal/Automatalanguagesandprogramming37th/z_zDY0N1aO8/">Automata, languages and programming : 37th international colloquium, ICALP 2010, Bordeaux, France, July 610, 2010 ; proceedings, Part I, Samson Abramsky ... [et al.] (eds.), (electronic resource)</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.bu.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.bu.edu/">Boston University Libraries</a></span></span></span></span></div>
Note: Adjust the width and height settings defined in the RDF/HTML code fragment to best match your requirements
Preview
Cite Data  Experimental
Data Citation of the Item Automata, languages and programming : 37th international colloquium, ICALP 2010, Bordeaux, France, July 610, 2010 ; proceedings, Part I, Samson Abramsky ... [et al.] (eds.), (electronic resource)
Copy and paste the following RDF/HTML data fragment to cite this resource
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.bu.edu/portal/Automatalanguagesandprogramming37th/z_zDY0N1aO8/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.bu.edu/portal/Automatalanguagesandprogramming37th/z_zDY0N1aO8/">Automata, languages and programming : 37th international colloquium, ICALP 2010, Bordeaux, France, July 610, 2010 ; proceedings, Part I, Samson Abramsky ... [et al.] (eds.), (electronic resource)</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.bu.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.bu.edu/">Boston University Libraries</a></span></span></span></span></div>