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 : 36th international colloquium, ICALP 2009, Rhodes, Greece, July 512, 2009 ; proceedings, Part I, Susanne Albers [and others] (eds.), (electronic resource)
Automata, languages and programming : 36th international colloquium, ICALP 2009, Rhodes, Greece, July 512, 2009 ; proceedings, Part I, Susanne Albers [and others] (eds.), (electronic resource)
Resource Information
The item Automata, languages and programming : 36th international colloquium, ICALP 2009, Rhodes, Greece, July 512, 2009 ; proceedings, Part I, Susanne Albers [and others] (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 : 36th international colloquium, ICALP 2009, Rhodes, Greece, July 512, 2009 ; proceedings, Part I, Susanne Albers [and others] (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 5555 and LNCS 5556 constitutes the refereed proceedings of the 36th International Colloquium on Automata, Languages and Programming, ICALP 2009, held in Rhodes, Greece, in July 2009. The 126 revised full papers (62 papers for track A, 24 for track B, and 22 for track C) presented were carefully reviewed and selected from a total of 370 submissions. The papers are grouped in three major tracks on algorithms, automata, complexity and games; on logic, semantics, theory of programming; as well as on foundations of networked computation: models, algorithms and information management. LNCS 5555 contains 62 contributions of track A selected from 223 submissions as well as 2 invited lectures. This twovolume set lauches the new subline of Lecture Notes in Computer Science, entitled LNCS Advanced Research in Computing and Software Science (ARCoSS)
 Language
 eng
 Extent
 1 online resource (1 volume).
 Note
 International conference proceedings
 Contents

 Invited Lectures
 Assigning Papers to Referees
 Algorithmic Game Theory: A Snapshot
 Contributed Papers
 SDPBased Algorithms for Maximum Independent Set Problems on Hypergraphs
 Correlation Clustering Revisited: The “True” Cost of Error Minimization Problems
 Sorting and Selection with Imprecise Comparisons
 Fast FAST
 Bounds on the Size of Small Depth Circuits for Approximating Majority
 Counting Subgraphs via Homomorphisms
 External Sampling
 Functional Monitoring without Monotonicity
 Deamortized Cuckoo Hashing: Provable WorstCase Performance and Experimental Results
 Towards a Study of LowComplexity Graphs
 Decidability of Conjugacy of TreeShifts of Finite Type
 Improved Bounds for Speed Scaling in Devices Obeying the CubeRoot Rule
 Competitive Analysis of Aggregate Max in Windowed Streaming
 Faster Regular Expression Matching
 A Fast and Simple Parallel Algorithm for the Monotone Duality Problem
 Unconditional Lower Bounds against Advice
 Approximating Decision Trees with Multiway Branches
 Annotations in Data Streams
 The Tile Complexity of Linear Assemblies
 A Graph Reduction Step Preserving ElementConnectivity and Applications
 Approximating Matches Made in Heaven
 Strong and Pareto Price of Anarchy in Congestion Games
 A Better Algorithm for Random kSAT
 Exact and Approximate Bandwidth
 Approximation Algorithms via Structural Results for ApexMinorFree Graphs
 NodeWeighted Steiner Tree and Group Steiner Tree in Planar Graphs
 On Cartesian Trees and Range Minimum Queries
 Applications of a Splitting Trick
 Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness
 Incompressibility through Colors and IDs
 Partition Arguments in Multiparty Communication Complexity
 High Complexity Tilings with Sparse Errors
 Tight Bounds for the Cover Time of Multiple Random Walks
 Online Computation with Advice
 Dynamic Succinct Ordered Trees
 Universal Succinct Representations of Trees?
 Distortion Is Fixed Parameter Tractable
 Towards Optimal Range Medians
 BTreaps: A Uniquely Represented Alternative to BTrees
 Testing Fourier Dimensionality and Sparsity
 Revisiting the Direct Sum Theorem and Space Lower Bounds in Random Order Streams
 Wireless Communication Is in APX
 The EhrenfeuchtSilberger Problem
 Applications of Effective Probability Theory to MartinLöf Randomness
 An EPTAS for Scheduling Jobs on Uniform Processors: Using an MILP Relaxation with a Constant Number of Integral Variables
 Popular Mixed Matchings
 Factoring Groups Efficiently
 On Finding Dense Subgraphs
 Learning Halfspaces with Malicious Noise
 General Scheme for Perfect Quantum Network Coding with Free Classical Communication
 Greedy Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost
 Limits and Applications of Group Algebras for Parameterized Problems
 Sleep with Guilt and Work Faster to Minimize Flow Plus Energy
 Improved Bounds for Flow Shop Scheduling
 A 3/2Approximation Algorithm for General Stable Marriage
 Limiting Negations in Formulas
 Fast PolynomialSpace Algorithms Using Möbius Inversion: Improving on Steiner Tree and Related Problems
 Superhighness and Strong Jump Traceability
 Amortized Communication Complexity of Distributions
 The Number of Symbol Comparisons in QuickSort and QuickSelect
 Computing the Girth of a Planar Graph in O(n logn) Time
 Elimination Graphs
 Isbn
 9783642029264
 Label
 Automata, languages and programming : 36th international colloquium, ICALP 2009, Rhodes, Greece, July 512, 2009 ; proceedings, Part I
 Title
 Automata, languages and programming
 Title remainder
 36th international colloquium, ICALP 2009, Rhodes, Greece, July 512, 2009 ; proceedings
 Title number
 Part I
 Statement of responsibility
 Susanne Albers [and others] (eds.)
 Title variation
 ICALP 2009
 Subject

 Formal languages
 Machine theory  Congresses
 Machine theory
 Computer programming
 Machine theory  Congresses
 Formal languages  Congresses
 Machine theory  Congresses
 Computer programming  Congresses
 Conference proceedings
 Computer programming  Congresses
 Formal languages  Congresses
 Computer programming  Congresses
 Machine theory
 Electronic resources
 Computer science
 Formal languages
 Formal languages  Congresses
 Informatique
 Electronic books
 Computer programming
 Language
 eng
 Summary
 The twovolume set LNCS 5555 and LNCS 5556 constitutes the refereed proceedings of the 36th International Colloquium on Automata, Languages and Programming, ICALP 2009, held in Rhodes, Greece, in July 2009. The 126 revised full papers (62 papers for track A, 24 for track B, and 22 for track C) presented were carefully reviewed and selected from a total of 370 submissions. The papers are grouped in three major tracks on algorithms, automata, complexity and games; on logic, semantics, theory of programming; as well as on foundations of networked computation: models, algorithms and information management. LNCS 5555 contains 62 contributions of track A selected from 223 submissions as well as 2 invited lectures. This twovolume set lauches the new subline of Lecture Notes in Computer Science, entitled LNCS Advanced Research in Computing and Software Science (ARCoSS)
 Cataloging source
 GW5XE
 Image bit depth
 0
 LC call number
 QA267
 LC item number
 .I58 pt.1
 Literary form
 non fiction
 http://bibfra.me/vocab/lite/meetingDate
 2009
 http://bibfra.me/vocab/lite/meetingName
 International Colloquium on Automata, Languages, and Programming
 Nature of contents
 dictionaries
 http://library.link/vocab/relatedWorkOrContributorName

 SpringerLink
 Albers, Susanne
 Series statement
 Lecture Notes in Computer Science,
 Series volume
 5555
 http://library.link/vocab/subjectName

 Machine theory
 Formal languages
 Computer programming
 Computer science
 Informatique
 Computer programming
 Formal languages
 Machine theory
 Computer programming
 Electronic books
 Machine theory
 Formal languages
 Label
 Automata, languages and programming : 36th international colloquium, ICALP 2009, Rhodes, Greece, July 512, 2009 ; proceedings, Part I, Susanne Albers [and others] (eds.), (electronic resource)
 Note
 International conference proceedings
 Antecedent source
 mixed
 Bibliography note
 Includes bibliographical references and index
 Carrier category
 online resource
 Carrier category code
 cr
 Carrier MARC source
 rdacarrier
 Color
 not applicable
 Content category
 text
 Content type code
 txt
 Content type MARC source
 rdacontent
 Contents
 Invited Lectures  Assigning Papers to Referees  Algorithmic Game Theory: A Snapshot  Contributed Papers  SDPBased Algorithms for Maximum Independent Set Problems on Hypergraphs  Correlation Clustering Revisited: The “True” Cost of Error Minimization Problems  Sorting and Selection with Imprecise Comparisons  Fast FAST  Bounds on the Size of Small Depth Circuits for Approximating Majority  Counting Subgraphs via Homomorphisms  External Sampling  Functional Monitoring without Monotonicity  Deamortized Cuckoo Hashing: Provable WorstCase Performance and Experimental Results  Towards a Study of LowComplexity Graphs  Decidability of Conjugacy of TreeShifts of Finite Type  Improved Bounds for Speed Scaling in Devices Obeying the CubeRoot Rule  Competitive Analysis of Aggregate Max in Windowed Streaming  Faster Regular Expression Matching  A Fast and Simple Parallel Algorithm for the Monotone Duality Problem  Unconditional Lower Bounds against Advice  Approximating Decision Trees with Multiway Branches  Annotations in Data Streams  The Tile Complexity of Linear Assemblies  A Graph Reduction Step Preserving ElementConnectivity and Applications  Approximating Matches Made in Heaven  Strong and Pareto Price of Anarchy in Congestion Games  A Better Algorithm for Random kSAT  Exact and Approximate Bandwidth  Approximation Algorithms via Structural Results for ApexMinorFree Graphs  NodeWeighted Steiner Tree and Group Steiner Tree in Planar Graphs  On Cartesian Trees and Range Minimum Queries  Applications of a Splitting Trick  Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness  Incompressibility through Colors and IDs  Partition Arguments in Multiparty Communication Complexity  High Complexity Tilings with Sparse Errors  Tight Bounds for the Cover Time of Multiple Random Walks  Online Computation with Advice  Dynamic Succinct Ordered Trees  Universal Succinct Representations of Trees?  Distortion Is Fixed Parameter Tractable  Towards Optimal Range Medians  BTreaps: A Uniquely Represented Alternative to BTrees  Testing Fourier Dimensionality and Sparsity  Revisiting the Direct Sum Theorem and Space Lower Bounds in Random Order Streams  Wireless Communication Is in APX  The EhrenfeuchtSilberger Problem  Applications of Effective Probability Theory to MartinLöf Randomness  An EPTAS for Scheduling Jobs on Uniform Processors: Using an MILP Relaxation with a Constant Number of Integral Variables  Popular Mixed Matchings  Factoring Groups Efficiently  On Finding Dense Subgraphs  Learning Halfspaces with Malicious Noise  General Scheme for Perfect Quantum Network Coding with Free Classical Communication  Greedy Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost  Limits and Applications of Group Algebras for Parameterized Problems  Sleep with Guilt and Work Faster to Minimize Flow Plus Energy  Improved Bounds for Flow Shop Scheduling  A 3/2Approximation Algorithm for General Stable Marriage  Limiting Negations in Formulas  Fast PolynomialSpace Algorithms Using Möbius Inversion: Improving on Steiner Tree and Related Problems  Superhighness and Strong Jump Traceability  Amortized Communication Complexity of Distributions  The Number of Symbol Comparisons in QuickSort and QuickSelect  Computing the Girth of a Planar Graph in O(n logn) Time  Elimination Graphs
 Dimensions
 unknown
 Extent
 1 online resource (1 volume).
 File format
 multiple file formats
 Form of item

 online
 electronic
 Isbn
 9783642029264
 Level of compression
 uncompressed
 Media category
 computer
 Media MARC source
 rdamedia
 Media type code
 c
 Quality assurance targets
 absent
 Reformatting quality
 access
 Specific material designation
 remote
 Stock number
 9783642029264
 System control number

 (OCoLC)437345739
 (OCoLC)ocn437345739
 Label
 Automata, languages and programming : 36th international colloquium, ICALP 2009, Rhodes, Greece, July 512, 2009 ; proceedings, Part I, Susanne Albers [and others] (eds.), (electronic resource)
 Note
 International conference proceedings
 Antecedent source
 mixed
 Bibliography note
 Includes bibliographical references and index
 Carrier category
 online resource
 Carrier category code
 cr
 Carrier MARC source
 rdacarrier
 Color
 not applicable
 Content category
 text
 Content type code
 txt
 Content type MARC source
 rdacontent
 Contents
 Invited Lectures  Assigning Papers to Referees  Algorithmic Game Theory: A Snapshot  Contributed Papers  SDPBased Algorithms for Maximum Independent Set Problems on Hypergraphs  Correlation Clustering Revisited: The “True” Cost of Error Minimization Problems  Sorting and Selection with Imprecise Comparisons  Fast FAST  Bounds on the Size of Small Depth Circuits for Approximating Majority  Counting Subgraphs via Homomorphisms  External Sampling  Functional Monitoring without Monotonicity  Deamortized Cuckoo Hashing: Provable WorstCase Performance and Experimental Results  Towards a Study of LowComplexity Graphs  Decidability of Conjugacy of TreeShifts of Finite Type  Improved Bounds for Speed Scaling in Devices Obeying the CubeRoot Rule  Competitive Analysis of Aggregate Max in Windowed Streaming  Faster Regular Expression Matching  A Fast and Simple Parallel Algorithm for the Monotone Duality Problem  Unconditional Lower Bounds against Advice  Approximating Decision Trees with Multiway Branches  Annotations in Data Streams  The Tile Complexity of Linear Assemblies  A Graph Reduction Step Preserving ElementConnectivity and Applications  Approximating Matches Made in Heaven  Strong and Pareto Price of Anarchy in Congestion Games  A Better Algorithm for Random kSAT  Exact and Approximate Bandwidth  Approximation Algorithms via Structural Results for ApexMinorFree Graphs  NodeWeighted Steiner Tree and Group Steiner Tree in Planar Graphs  On Cartesian Trees and Range Minimum Queries  Applications of a Splitting Trick  Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness  Incompressibility through Colors and IDs  Partition Arguments in Multiparty Communication Complexity  High Complexity Tilings with Sparse Errors  Tight Bounds for the Cover Time of Multiple Random Walks  Online Computation with Advice  Dynamic Succinct Ordered Trees  Universal Succinct Representations of Trees?  Distortion Is Fixed Parameter Tractable  Towards Optimal Range Medians  BTreaps: A Uniquely Represented Alternative to BTrees  Testing Fourier Dimensionality and Sparsity  Revisiting the Direct Sum Theorem and Space Lower Bounds in Random Order Streams  Wireless Communication Is in APX  The EhrenfeuchtSilberger Problem  Applications of Effective Probability Theory to MartinLöf Randomness  An EPTAS for Scheduling Jobs on Uniform Processors: Using an MILP Relaxation with a Constant Number of Integral Variables  Popular Mixed Matchings  Factoring Groups Efficiently  On Finding Dense Subgraphs  Learning Halfspaces with Malicious Noise  General Scheme for Perfect Quantum Network Coding with Free Classical Communication  Greedy Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost  Limits and Applications of Group Algebras for Parameterized Problems  Sleep with Guilt and Work Faster to Minimize Flow Plus Energy  Improved Bounds for Flow Shop Scheduling  A 3/2Approximation Algorithm for General Stable Marriage  Limiting Negations in Formulas  Fast PolynomialSpace Algorithms Using Möbius Inversion: Improving on Steiner Tree and Related Problems  Superhighness and Strong Jump Traceability  Amortized Communication Complexity of Distributions  The Number of Symbol Comparisons in QuickSort and QuickSelect  Computing the Girth of a Planar Graph in O(n logn) Time  Elimination Graphs
 Dimensions
 unknown
 Extent
 1 online resource (1 volume).
 File format
 multiple file formats
 Form of item

 online
 electronic
 Isbn
 9783642029264
 Level of compression
 uncompressed
 Media category
 computer
 Media MARC source
 rdamedia
 Media type code
 c
 Quality assurance targets
 absent
 Reformatting quality
 access
 Specific material designation
 remote
 Stock number
 9783642029264
 System control number

 (OCoLC)437345739
 (OCoLC)ocn437345739
Subject
 Computer programming
 Computer programming
 Computer programming  Congresses
 Computer programming  Congresses
 Computer programming  Congresses
 Computer science
 Conference proceedings
 Electronic books
 Electronic resources
 Formal languages
 Formal languages
 Formal languages  Congresses
 Formal languages  Congresses
 Formal languages  Congresses
 Informatique
 Machine theory
 Machine theory
 Machine theory  Congresses
 Machine theory  Congresses
 Machine theory  Congresses
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/Automatalanguagesandprogramming36th/xa9xju1c7PQ/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.bu.edu/portal/Automatalanguagesandprogramming36th/xa9xju1c7PQ/">Automata, languages and programming : 36th international colloquium, ICALP 2009, Rhodes, Greece, July 512, 2009 ; proceedings, Part I, Susanne Albers [and others] (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 : 36th international colloquium, ICALP 2009, Rhodes, Greece, July 512, 2009 ; proceedings, Part I, Susanne Albers [and others] (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/Automatalanguagesandprogramming36th/xa9xju1c7PQ/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.bu.edu/portal/Automatalanguagesandprogramming36th/xa9xju1c7PQ/">Automata, languages and programming : 36th international colloquium, ICALP 2009, Rhodes, Greece, July 512, 2009 ; proceedings, Part I, Susanne Albers [and others] (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>