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 : 35th international colloquium, ICALP 2008, Reykjavik, Iceland, July 711, 2008 ; proceedings, Part II, Luca Aceto ... [et al.] (eds.), (electronic resource)
Automata, languages and programming : 35th international colloquium, ICALP 2008, Reykjavik, Iceland, July 711, 2008 ; proceedings, Part II, Luca Aceto ... [et al.] (eds.), (electronic resource)
Resource Information
The item Automata, languages and programming : 35th international colloquium, ICALP 2008, Reykjavik, Iceland, July 711, 2008 ; proceedings, Part II, Luca Aceto ... [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 : 35th international colloquium, ICALP 2008, Reykjavik, Iceland, July 711, 2008 ; proceedings, Part II, Luca Aceto ... [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 5125 and LNCS 5126 constitutes the refereed proceedings of the 35th International Colloquium on Automata, Languages and Programming, ICALP 2008, held in Reykjavik, Iceland, in July 2008. The 126 revised full papers presented together with 4 invited lectures were carefully reviewed and selected from a total of 407 submissions. The papers are grouped in three major tracks on algorithms, automata, complexity and games, on logic, semantics, and theory of programming, and on security and cryptography foundations. LNCS 5126 contains 56 contributions of track B and track C selected from 208 submissions and 2 invited lectures. The papers for track B are organized in topical sections on bounds, distributed computation, realtime and probabilistic systems, logic and complexity, words and trees, nonstandard models of computation, reasoning about computation, and verification. The papers of track C cover topics in security and cryptography such as theory, secure computation, twoparty protocols and zeroknowledge, encryption with special properties/quantum cryptography, various types of hashing, as well as publickey cryptography and authentication
 Language
 eng
 Extent
 1 online resource (730 p.)
 Note
 International conference proceedings
 Contents

 Invited Lectures
 Composable Formal Security Analysis: Juggling Soundness, Simplicity and Efficiency
 Newtonâ€™s Method for ?Continuous Semirings
 Track B: Logic, Semantics, and Theory of Programming
 The Tractability Frontier for NFA Minimization
 Finite Automata, Digraph Connectivity, and Regular Expression Size
 Leftist Grammars Are Nonprimitive Recursive
 On the Computational Completeness of Equations over Sets of Natural Numbers
 Placement Inference for a ClientServer Calculus
 Extended piCalculi
 Completeness and Logical Full Abstraction in Modal Logics for Typed Mobile Processes
 On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases
 On Expressiveness and Complexity in RealTime Model Checking
 STORMED Hybrid Systems
 Controller Synthesis and Verification for Markov Decision Processes with Qualitative Branching Time Objectives
 On Datalog vs. LFP
 Directed stConnectivity Is Not Expressible in Symmetric Datalog
 Nondichotomies in Constraint Satisfaction Complexity
 Quantified Constraint Satisfaction and the Polynomially Generated Powers Property
 When Does Partial Commutative Closure Preserve Regularity?
 Weighted Logics for Nested Words and Algebraic Formal Power Series
 Tree Languages Defined in FirstOrder Logic with One Quantifier Alternation
 Duality and Equational Theory of Regular Languages
 Reversible Flowchart Languages and the Structured Reversible Program Theorem
 Attribute Grammars and Categorical Semantics
 A Domain Theoretic Model of Qubit Channels
 Interacting Quantum Observables
 Perpetuality for Full and Safe Composition (in a Constructive Setting)
 A System F with CallbyName Exceptions
 Linear Logical Algorithms
 A Simple Model of Separation Logic for HigherOrder Store
 Open Implication
 ATL* Satisfiability Is 2EXPTIMEComplete
 Visibly Pushdown Transducers
 The Nondeterministic Mostowski Hierarchy and DistanceParity Automata
 Analyzing ContextFree Grammars Using an Incremental SAT Solver
 Track C: Security and Cryptography Foundations
 Weak Pseudorandom Functions in Minicrypt
 On BlackBox Ring Extraction and Integer Factorization
 Extractable Perfectly OneWay Functions
 ErrorTolerant Combiners for Oblivious Primitives
 Asynchronous MultiParty Computation with Quadratic Communication
 Improved Garbled Circuit: Free XOR Gates and Applications
 Improving the Round Complexity of VSS in PointtoPoint Networks
 How to Protect Yourself without Perfect Shredding
 Universally Composable Undeniable Signature
 Interactive PCP
 ConstantRound Concurrent Nonmalleable Zero Knowledge in the Bare PublicKey Model
 Delegating Capabilities in Predicate Encryption Systems
 Bounded Ciphertext Policy Attribute Based Encryption
 Making Classical Honest Verifier Zero Knowledge Protocols Secure against Quantum Attacks
 Composable Security in the BoundedQuantumStorage Model
 On the Strength of the Concatenated Hash Combiner When All the Hash Functions Are Weak
 HistoryIndependent Cuckoo Hashing
 Building a CollisionResistant Compression Function from Noncompressing Primitives
 Robust Multiproperty Combiners for Hash Functions Revisited
 Homomorphic Encryption with CCA Security
 How to Encrypt with the LPN Problem
 Could SFLASH be Repaired?
 Password Mistyping in TwoFactorAuthenticated Key Exchange
 AffiliationHiding Envelope and Authentication Schemes with Efficient Support for Multiple Credentials
 Isbn
 9783540705833
 Label
 Automata, languages and programming : 35th international colloquium, ICALP 2008, Reykjavik, Iceland, July 711, 2008 ; proceedings, Part II
 Title
 Automata, languages and programming
 Title remainder
 35th international colloquium, ICALP 2008, Reykjavik, Iceland, July 711, 2008 ; proceedings
 Title number
 Part II
 Statement of responsibility
 Luca Aceto ... [et al.] (eds.)
 Subject

 Computational complexity
 Computational complexity
 Computer Science
 Data Structures
 Data Structures, Cryptology and Information Theory
 Data structures (Computer science)
 Data structures (Computer science)
 Discrete Mathematics in Computer Science
 Electronic data processing
 Electronic data processing
 Electronic resources
 Information theory
 Information theory
 Informatique
 Numeric Computing
 Software Engineering/Programming and Operating Systems
 Software engineering
 Software engineering
 Theory of Computation
 Language
 eng
 Summary
 The twovolume set LNCS 5125 and LNCS 5126 constitutes the refereed proceedings of the 35th International Colloquium on Automata, Languages and Programming, ICALP 2008, held in Reykjavik, Iceland, in July 2008. The 126 revised full papers presented together with 4 invited lectures were carefully reviewed and selected from a total of 407 submissions. The papers are grouped in three major tracks on algorithms, automata, complexity and games, on logic, semantics, and theory of programming, and on security and cryptography foundations. LNCS 5126 contains 56 contributions of track B and track C selected from 208 submissions and 2 invited lectures. The papers for track B are organized in topical sections on bounds, distributed computation, realtime and probabilistic systems, logic and complexity, words and trees, nonstandard models of computation, reasoning about computation, and verification. The papers of track C cover topics in security and cryptography such as theory, secure computation, twoparty protocols and zeroknowledge, encryption with special properties/quantum cryptography, various types of hashing, as well as publickey cryptography and authentication
 Cataloging source
 GW5XE
 Image bit depth
 0
 LC call number
 QA267
 LC item number
 .I58 2008eb
 Literary form
 non fiction
 Nature of contents
 dictionaries
 http://library.link/vocab/relatedWorkOrContributorName
 SpringerLink
 Series statement
 Lecture Notes in Computer Science,
 Series volume
 5126
 http://library.link/vocab/subjectName

 Computational complexity
 Data structures (Computer science)
 Electronic data processing
 Information theory
 Software engineering
 Computer Science
 Data Structures
 Data Structures, Cryptology and Information Theory
 Discrete Mathematics in Computer Science
 Numeric Computing
 Software Engineering/Programming and Operating Systems
 Theory of Computation
 Computational complexity
 Data structures (Computer science)
 Electronic data processing
 Information theory
 Software engineering
 Informatique
 Label
 Automata, languages and programming : 35th international colloquium, ICALP 2008, Reykjavik, Iceland, July 711, 2008 ; proceedings, Part II, Luca Aceto ... [et al.] (eds.), (electronic resource)
 Note
 International conference proceedings
 Antecedent source
 mixed
 Bibliography note
 Includes bibliographical references
 Carrier category
 online bron
 Carrier category code

 cr
 Carrier MARC source
 rdacarrier/dut
 Color
 not applicable
 Content category
 tekst
 Content type code

 txt
 Content type MARC source
 rdacontent/dut
 Contents
 Invited Lectures  Composable Formal Security Analysis: Juggling Soundness, Simplicity and Efficiency  Newtonâ€™s Method for ?Continuous Semirings  Track B: Logic, Semantics, and Theory of Programming  The Tractability Frontier for NFA Minimization  Finite Automata, Digraph Connectivity, and Regular Expression Size  Leftist Grammars Are Nonprimitive Recursive  On the Computational Completeness of Equations over Sets of Natural Numbers  Placement Inference for a ClientServer Calculus  Extended piCalculi  Completeness and Logical Full Abstraction in Modal Logics for Typed Mobile Processes  On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases  On Expressiveness and Complexity in RealTime Model Checking  STORMED Hybrid Systems  Controller Synthesis and Verification for Markov Decision Processes with Qualitative Branching Time Objectives  On Datalog vs. LFP  Directed stConnectivity Is Not Expressible in Symmetric Datalog  Nondichotomies in Constraint Satisfaction Complexity  Quantified Constraint Satisfaction and the Polynomially Generated Powers Property  When Does Partial Commutative Closure Preserve Regularity?  Weighted Logics for Nested Words and Algebraic Formal Power Series  Tree Languages Defined in FirstOrder Logic with One Quantifier Alternation  Duality and Equational Theory of Regular Languages  Reversible Flowchart Languages and the Structured Reversible Program Theorem  Attribute Grammars and Categorical Semantics  A Domain Theoretic Model of Qubit Channels  Interacting Quantum Observables  Perpetuality for Full and Safe Composition (in a Constructive Setting)  A System F with CallbyName Exceptions  Linear Logical Algorithms  A Simple Model of Separation Logic for HigherOrder Store  Open Implication  ATL* Satisfiability Is 2EXPTIMEComplete  Visibly Pushdown Transducers  The Nondeterministic Mostowski Hierarchy and DistanceParity Automata  Analyzing ContextFree Grammars Using an Incremental SAT Solver  Track C: Security and Cryptography Foundations  Weak Pseudorandom Functions in Minicrypt  On BlackBox Ring Extraction and Integer Factorization  Extractable Perfectly OneWay Functions  ErrorTolerant Combiners for Oblivious Primitives  Asynchronous MultiParty Computation with Quadratic Communication  Improved Garbled Circuit: Free XOR Gates and Applications  Improving the Round Complexity of VSS in PointtoPoint Networks  How to Protect Yourself without Perfect Shredding  Universally Composable Undeniable Signature  Interactive PCP  ConstantRound Concurrent Nonmalleable Zero Knowledge in the Bare PublicKey Model  Delegating Capabilities in Predicate Encryption Systems  Bounded Ciphertext Policy Attribute Based Encryption  Making Classical Honest Verifier Zero Knowledge Protocols Secure against Quantum Attacks  Composable Security in the BoundedQuantumStorage Model  On the Strength of the Concatenated Hash Combiner When All the Hash Functions Are Weak  HistoryIndependent Cuckoo Hashing  Building a CollisionResistant Compression Function from Noncompressing Primitives  Robust Multiproperty Combiners for Hash Functions Revisited  Homomorphic Encryption with CCA Security  How to Encrypt with the LPN Problem  Could SFLASH be Repaired?  Password Mistyping in TwoFactorAuthenticated Key Exchange  AffiliationHiding Envelope and Authentication Schemes with Efficient Support for Multiple Credentials
 Dimensions
 unknown
 Extent
 1 online resource (730 p.)
 File format
 multiple file formats
 Form of item

 online
 electronic
 Isbn
 9783540705833
 Level of compression
 uncompressed
 Media category
 computer
 Media MARC source
 rdamedia/dut
 Media type code

 c
 Quality assurance targets
 absent
 Reformatting quality
 access
 Specific material designation
 remote
 Stock number
 9783540705826
 System control number

 (OCoLC)272306958
 (OCoLC)ocn272306958
 (DEHe213)9783540705833
 Label
 Automata, languages and programming : 35th international colloquium, ICALP 2008, Reykjavik, Iceland, July 711, 2008 ; proceedings, Part II, Luca Aceto ... [et al.] (eds.), (electronic resource)
 Note
 International conference proceedings
 Antecedent source
 mixed
 Bibliography note
 Includes bibliographical references
 Carrier category
 online bron
 Carrier category code

 cr
 Carrier MARC source
 rdacarrier/dut
 Color
 not applicable
 Content category
 tekst
 Content type code

 txt
 Content type MARC source
 rdacontent/dut
 Contents
 Invited Lectures  Composable Formal Security Analysis: Juggling Soundness, Simplicity and Efficiency  Newtonâ€™s Method for ?Continuous Semirings  Track B: Logic, Semantics, and Theory of Programming  The Tractability Frontier for NFA Minimization  Finite Automata, Digraph Connectivity, and Regular Expression Size  Leftist Grammars Are Nonprimitive Recursive  On the Computational Completeness of Equations over Sets of Natural Numbers  Placement Inference for a ClientServer Calculus  Extended piCalculi  Completeness and Logical Full Abstraction in Modal Logics for Typed Mobile Processes  On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases  On Expressiveness and Complexity in RealTime Model Checking  STORMED Hybrid Systems  Controller Synthesis and Verification for Markov Decision Processes with Qualitative Branching Time Objectives  On Datalog vs. LFP  Directed stConnectivity Is Not Expressible in Symmetric Datalog  Nondichotomies in Constraint Satisfaction Complexity  Quantified Constraint Satisfaction and the Polynomially Generated Powers Property  When Does Partial Commutative Closure Preserve Regularity?  Weighted Logics for Nested Words and Algebraic Formal Power Series  Tree Languages Defined in FirstOrder Logic with One Quantifier Alternation  Duality and Equational Theory of Regular Languages  Reversible Flowchart Languages and the Structured Reversible Program Theorem  Attribute Grammars and Categorical Semantics  A Domain Theoretic Model of Qubit Channels  Interacting Quantum Observables  Perpetuality for Full and Safe Composition (in a Constructive Setting)  A System F with CallbyName Exceptions  Linear Logical Algorithms  A Simple Model of Separation Logic for HigherOrder Store  Open Implication  ATL* Satisfiability Is 2EXPTIMEComplete  Visibly Pushdown Transducers  The Nondeterministic Mostowski Hierarchy and DistanceParity Automata  Analyzing ContextFree Grammars Using an Incremental SAT Solver  Track C: Security and Cryptography Foundations  Weak Pseudorandom Functions in Minicrypt  On BlackBox Ring Extraction and Integer Factorization  Extractable Perfectly OneWay Functions  ErrorTolerant Combiners for Oblivious Primitives  Asynchronous MultiParty Computation with Quadratic Communication  Improved Garbled Circuit: Free XOR Gates and Applications  Improving the Round Complexity of VSS in PointtoPoint Networks  How to Protect Yourself without Perfect Shredding  Universally Composable Undeniable Signature  Interactive PCP  ConstantRound Concurrent Nonmalleable Zero Knowledge in the Bare PublicKey Model  Delegating Capabilities in Predicate Encryption Systems  Bounded Ciphertext Policy Attribute Based Encryption  Making Classical Honest Verifier Zero Knowledge Protocols Secure against Quantum Attacks  Composable Security in the BoundedQuantumStorage Model  On the Strength of the Concatenated Hash Combiner When All the Hash Functions Are Weak  HistoryIndependent Cuckoo Hashing  Building a CollisionResistant Compression Function from Noncompressing Primitives  Robust Multiproperty Combiners for Hash Functions Revisited  Homomorphic Encryption with CCA Security  How to Encrypt with the LPN Problem  Could SFLASH be Repaired?  Password Mistyping in TwoFactorAuthenticated Key Exchange  AffiliationHiding Envelope and Authentication Schemes with Efficient Support for Multiple Credentials
 Dimensions
 unknown
 Extent
 1 online resource (730 p.)
 File format
 multiple file formats
 Form of item

 online
 electronic
 Isbn
 9783540705833
 Level of compression
 uncompressed
 Media category
 computer
 Media MARC source
 rdamedia/dut
 Media type code

 c
 Quality assurance targets
 absent
 Reformatting quality
 access
 Specific material designation
 remote
 Stock number
 9783540705826
 System control number

 (OCoLC)272306958
 (OCoLC)ocn272306958
 (DEHe213)9783540705833
Subject
 Computational complexity
 Computational complexity
 Computer Science
 Data Structures
 Data Structures, Cryptology and Information Theory
 Data structures (Computer science)
 Data structures (Computer science)
 Discrete Mathematics in Computer Science
 Electronic data processing
 Electronic data processing
 Electronic resources
 Information theory
 Information theory
 Informatique
 Numeric Computing
 Software Engineering/Programming and Operating Systems
 Software engineering
 Software engineering
 Theory of Computation
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
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/Automatalanguagesandprogramming35th/s4ydpbRHVI0/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.bu.edu/portal/Automatalanguagesandprogramming35th/s4ydpbRHVI0/">Automata, languages and programming : 35th international colloquium, ICALP 2008, Reykjavik, Iceland, July 711, 2008 ; proceedings, Part II, Luca Aceto ... [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 : 35th international colloquium, ICALP 2008, Reykjavik, Iceland, July 711, 2008 ; proceedings, Part II, Luca Aceto ... [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/Automatalanguagesandprogramming35th/s4ydpbRHVI0/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.bu.edu/portal/Automatalanguagesandprogramming35th/s4ydpbRHVI0/">Automata, languages and programming : 35th international colloquium, ICALP 2008, Reykjavik, Iceland, July 711, 2008 ; proceedings, Part II, Luca Aceto ... [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>