Borrow it
 Architecture Library
 Bizzell Memorial Library
 Boorstin Collection
 Chinese Literature Translation Archive
 Engineering Library
 Fine Arts Library
 Harry W. Bass Business History Collection
 History of Science Collections
 John and Mary Nichols Rare Books and Special Collections
 Library Service Center
 Price College Digital Library
 Western History Collections
The Resource Automata, languages and programming : 28th international colloquium, ICALP 2001, Crete, Greece, July 812, 2001 : proceedings, Fernando Orejas, Paul G. Spirakis, Jan van Leeuwen (eds.), (electronic resource)
Automata, languages and programming : 28th international colloquium, ICALP 2001, Crete, Greece, July 812, 2001 : proceedings, Fernando Orejas, Paul G. Spirakis, Jan van Leeuwen (eds.), (electronic resource)
Resource Information
The item Automata, languages and programming : 28th international colloquium, ICALP 2001, Crete, Greece, July 812, 2001 : proceedings, Fernando Orejas, Paul G. Spirakis, Jan van Leeuwen (eds.), (electronic resource) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Oklahoma Libraries.This item is available to borrow from all library branches.
Resource Information
The item Automata, languages and programming : 28th international colloquium, ICALP 2001, Crete, Greece, July 812, 2001 : proceedings, Fernando Orejas, Paul G. Spirakis, Jan van Leeuwen (eds.), (electronic resource) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Oklahoma Libraries.
This item is available to borrow from all library branches.
 Summary
 This book constitutes the refereed proceedings of the 28th International Colloquium on Automata, Languages and Programming, ICALP 2001, held in Crete, Greece in July 2001. The 80 revised papers presented together with two keynote contributions and four invited papers were carefully reviewed and selected from a total of 208 submissions. The papers are organized in topical sections on algebraic and circuit complexity, algorithm analysis, approximation and optimization, complexity, concurrency, efficient data structures, graph algorithms, language theory, codes and automata, model checking and protocol analysis, networks and routing, reasoning and verification, scheduling, secure computation, specification and deduction, and structural complexity
 Language
 eng
 Extent
 1 online resource (xiv, 1083 p.)
 Contents

 Keynote Papers
 Algorithms, Games, and the Internet
 Automata, Circuits, and Hybrids: Facets of Continuous Time
 Invited Papers
 Languages, Rewriting Systems, and Verification of InfiniteState Systems
 Integrating Semantics for Object
 Oriented System Models
 Modelling with Partial Orders
 Why and Why Not?
 Theoretical Aspects of Evolutionary Algorithms
 Algebraic and Circuit Complexity
 Improvements of the Alder
 Strassen Bound: Algebras with Nonzero Radical
 On Generating All Minimal Integer Solutions for a Monotone System of Linear Inequalities
 Division Is In Uniform TC0
 Algorithm Analysis
 A Framework for Index Bulk Loading and Dynamization
 A Characterization of Temporal Locality and Its Portability across Memory Hierarchies
 The Complexity of Constructing Evolutionary Trees Using Experiments
 Hidden Pattern Statistics
 Combinatorics and Algorithms on LowDiscrepancy Roundings of a Real Sequence
 AllPairs Shortest Paths Computation in the BSP Model
 Approximation and Optimization
 Approximating the Minimum Spanning Tree Weight in Sublinear Time
 Approximation Hardness of TSP with Bounded Metrics
 The RPR 2 Rounding Technique for Semidefinite Programs
 Approximation Algorithms for Partial Covering Problems
 On the Online Bin Packing Problem
 Quick kMedian, kCenter, and Facility Location for Sparse Graphs
 Complexity
 Parameterized Complexity: Exponential SpeedUp for Planar Graph Problems
 Subexponential Parameterized Algorithms Collapse the WHierarchy
 Improved Lower Bounds on the Randomized Complexity of Graph Properties
 New Imperfect Random Source with Applications to CoinFlipping
 Recognizing More Unsatisfiable Random 3SAT Instances Efficiently
 WeisfeilerLehman Refinement Requires at Least a Linear Number of Iterations
 On Interactive Proofs with a Laconic Prover
 Quantum Complexities of Ordered Searching, Sorting, and Element Distinctness
 Lower Bounds in the Quantum Cell Probe Model
 Concurrency
 Axiomatizations for Probabilistic Bisimulation
 Noninterference for Concurrent Programs
 Distributed Controller Synthesis for Local Specifications
 A Distributed Abstract Machine for Safe Ambients
 Towards Quantitative Verification of Probabilistic Transition Systems
 Efficient Datastructures
 Efficient Generation of Plane Triangulations without Repetitions
 The Longest Common Subsequence Problem for Sequences with Nested Arc Annotations
 VisibilityBased PursuitEvasion in a Polygonal Region by a Searcher
 A New Method for Balancing Binary Search Trees
 Graph Algorithms
 Permutation Editing and Matching via Embeddings
 Testing Hypergraph Coloring
 Total Colorings of Degenerated Graphs
 Decidable Properties of Graphs of AllOptical Networks
 Majority Consensus and the Local Majority Rule
 Language Theory, Codes, and Automata
 Solvability of Equations in Free Partially Commutative Groups Is decidable
 Rational Transformations of Formal Power Series
 Combinatorics of ThreeInterval Exchanges
 Decision Questions Concerning Semilinearity, Morphisms, and Commutation of Languages
 The Star Problem in Trace Monoids: Reductions Beyond C4
 The Trace Coding Problem Is Undecidable
 Combinatorics of Periods in Strings
 Minimal TailBiting Trellises for Certain Cyclic Block Codes Are Easy to Construct
 Model Checking and Protocol Analysis
 Effective Lossy Queue Languages
 Model Checking of Unrestricted Hierarchical State Machines
 Symbolic Trace Analysis of Cryptographic Protocols
 Tree Automata with One Memory, Set Constraints, and PingPong Protocols
 Fair Simulation Relations, Parity Games, and State Space Reduction for Büchi Automata
 Hypergraphs in Model Checking: Acyclicity and HypertreeWidth versus CliqueWidth
 From Finite State Communication Protocols to HighLevel Message Sequence Charts
 Networks and Routing
 Fractional Path Coloring with Applications to WDM Networks
 Performance Aspects of Distributed Caches Using TTLBased Consistency
 Routing in Trees
 Online Packet Routing on Linear Arrays and Rings
 Faster Gossiping on Butterflies
 Reasoning and Verification
 Realizability and Verification of MSC Graphs
 Reasoning about Sequential and Branching Behaviours of Message Sequence Graphs
 A SetTheoretic Framework for AssumeGuarantee Reasoning
 Foundations for Circular Compositional Reasoning
 Scheduling
 A PTAS for Minimizing Weighted Completion Time on Uniformly Related Machines
 The Buffer Minimization Problem for Multiprocessor Scheduling with Conflicts
 On Minimizing Average Weighted Completion Time of Multiprocessor Tasks with Release Dates
 On the Approximability of Average Completion Time Scheduling under Precedence Constraints
 Secure Computation
 Optimistic Asynchronous Multiparty Contract Signing with Reduced Number of Rounds
 InformationTheoretic Private Information Retrieval: A Unified Construction
 Secure Multiparty Computation of Approximations
 Secure Games with Polynomial Expressions
 Specification and Deduction
 On the Completeness of Arbitrary Selection Strategies for Paramodulation
 An Axiomatic Approach to Metareasoning on Nominal Algebras in HOAS
 KnuthBendix Constraint Solving Is NPComplete
 Amalgamation in CASL via Enriched Signatures
 Structural Complexity
 Lower Bounds for the Weak Pigeonhole Principle Beyond Resolution
 Time and Space Bounds for Reversible Simulation
 FiniteState Dimension
 The Complexity of Computing the Size of an Interval
 Communication Gap for Finite Memory Devices
 Separating Quantum and Classical Learning
 Isbn
 9783540482246
 Label
 Automata, languages and programming : 28th international colloquium, ICALP 2001, Crete, Greece, July 812, 2001 : proceedings
 Title
 Automata, languages and programming
 Title remainder
 28th international colloquium, ICALP 2001, Crete, Greece, July 812, 2001 : proceedings
 Statement of responsibility
 Fernando Orejas, Paul G. Spirakis, Jan van Leeuwen (eds.)
 Title variation
 ICALP 2001
 Language
 eng
 Summary
 This book constitutes the refereed proceedings of the 28th International Colloquium on Automata, Languages and Programming, ICALP 2001, held in Crete, Greece in July 2001. The 80 revised papers presented together with two keynote contributions and four invited papers were carefully reviewed and selected from a total of 208 submissions. The papers are organized in topical sections on algebraic and circuit complexity, algorithm analysis, approximation and optimization, complexity, concurrency, efficient data structures, graph algorithms, language theory, codes and automata, model checking and protocol analysis, networks and routing, reasoning and verification, scheduling, secure computation, specification and deduction, and structural complexity
 Cataloging source
 CUT
 Dewey number
 005.131
 Illustrations
 illustrations
 Index
 index present
 LC call number
 QA267
 LC item number
 .I23 2001eb
 Literary form
 non fiction
 http://bibfra.me/vocab/lite/meetingDate
 2001
 http://bibfra.me/vocab/lite/meetingName
 International Colloquium on Automata, Languages, and Programming
 Nature of contents

 dictionaries
 bibliography
 http://library.link/vocab/relatedWorkOrContributorDate
 1955
 http://library.link/vocab/relatedWorkOrContributorName

 Orejas, F.
 Spirakis, P. G.
 Leeuwen, J. van
 LINK (Online service)
 Series statement
 Lecture notes in computer science,
 Series volume
 2076
 http://library.link/vocab/subjectName

 Machine theory
 Formal languages
 Computer programming
 Computer programming
 Formal languages
 Machine theory
 Label
 Automata, languages and programming : 28th international colloquium, ICALP 2001, Crete, Greece, July 812, 2001 : proceedings, Fernando Orejas, Paul G. Spirakis, Jan van Leeuwen (eds.), (electronic resource)
 Bibliography note
 Includes bibliographical references and index
 Carrier category
 online bron
 Carrier category code

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

 txt
 Content type MARC source
 rdacontent/dut
 Contents
 Keynote Papers  Algorithms, Games, and the Internet  Automata, Circuits, and Hybrids: Facets of Continuous Time  Invited Papers  Languages, Rewriting Systems, and Verification of InfiniteState Systems  Integrating Semantics for Object  Oriented System Models  Modelling with Partial Orders  Why and Why Not?  Theoretical Aspects of Evolutionary Algorithms  Algebraic and Circuit Complexity  Improvements of the Alder  Strassen Bound: Algebras with Nonzero Radical  On Generating All Minimal Integer Solutions for a Monotone System of Linear Inequalities  Division Is In Uniform TC0  Algorithm Analysis  A Framework for Index Bulk Loading and Dynamization  A Characterization of Temporal Locality and Its Portability across Memory Hierarchies  The Complexity of Constructing Evolutionary Trees Using Experiments  Hidden Pattern Statistics  Combinatorics and Algorithms on LowDiscrepancy Roundings of a Real Sequence  AllPairs Shortest Paths Computation in the BSP Model  Approximation and Optimization  Approximating the Minimum Spanning Tree Weight in Sublinear Time  Approximation Hardness of TSP with Bounded Metrics  The RPR 2 Rounding Technique for Semidefinite Programs  Approximation Algorithms for Partial Covering Problems  On the Online Bin Packing Problem  Quick kMedian, kCenter, and Facility Location for Sparse Graphs  Complexity  Parameterized Complexity: Exponential SpeedUp for Planar Graph Problems  Subexponential Parameterized Algorithms Collapse the WHierarchy  Improved Lower Bounds on the Randomized Complexity of Graph Properties  New Imperfect Random Source with Applications to CoinFlipping  Recognizing More Unsatisfiable Random 3SAT Instances Efficiently  WeisfeilerLehman Refinement Requires at Least a Linear Number of Iterations  On Interactive Proofs with a Laconic Prover  Quantum Complexities of Ordered Searching, Sorting, and Element Distinctness  Lower Bounds in the Quantum Cell Probe Model  Concurrency  Axiomatizations for Probabilistic Bisimulation  Noninterference for Concurrent Programs  Distributed Controller Synthesis for Local Specifications  A Distributed Abstract Machine for Safe Ambients  Towards Quantitative Verification of Probabilistic Transition Systems  Efficient Datastructures  Efficient Generation of Plane Triangulations without Repetitions  The Longest Common Subsequence Problem for Sequences with Nested Arc Annotations  VisibilityBased PursuitEvasion in a Polygonal Region by a Searcher  A New Method for Balancing Binary Search Trees  Graph Algorithms  Permutation Editing and Matching via Embeddings  Testing Hypergraph Coloring  Total Colorings of Degenerated Graphs  Decidable Properties of Graphs of AllOptical Networks  Majority Consensus and the Local Majority Rule  Language Theory, Codes, and Automata  Solvability of Equations in Free Partially Commutative Groups Is decidable  Rational Transformations of Formal Power Series  Combinatorics of ThreeInterval Exchanges  Decision Questions Concerning Semilinearity, Morphisms, and Commutation of Languages  The Star Problem in Trace Monoids: Reductions Beyond C4  The Trace Coding Problem Is Undecidable  Combinatorics of Periods in Strings  Minimal TailBiting Trellises for Certain Cyclic Block Codes Are Easy to Construct  Model Checking and Protocol Analysis  Effective Lossy Queue Languages  Model Checking of Unrestricted Hierarchical State Machines  Symbolic Trace Analysis of Cryptographic Protocols  Tree Automata with One Memory, Set Constraints, and PingPong Protocols  Fair Simulation Relations, Parity Games, and State Space Reduction for Büchi Automata  Hypergraphs in Model Checking: Acyclicity and HypertreeWidth versus CliqueWidth  From Finite State Communication Protocols to HighLevel Message Sequence Charts  Networks and Routing  Fractional Path Coloring with Applications to WDM Networks  Performance Aspects of Distributed Caches Using TTLBased Consistency  Routing in Trees  Online Packet Routing on Linear Arrays and Rings  Faster Gossiping on Butterflies  Reasoning and Verification  Realizability and Verification of MSC Graphs  Reasoning about Sequential and Branching Behaviours of Message Sequence Graphs  A SetTheoretic Framework for AssumeGuarantee Reasoning  Foundations for Circular Compositional Reasoning  Scheduling  A PTAS for Minimizing Weighted Completion Time on Uniformly Related Machines  The Buffer Minimization Problem for Multiprocessor Scheduling with Conflicts  On Minimizing Average Weighted Completion Time of Multiprocessor Tasks with Release Dates  On the Approximability of Average Completion Time Scheduling under Precedence Constraints  Secure Computation  Optimistic Asynchronous Multiparty Contract Signing with Reduced Number of Rounds  InformationTheoretic Private Information Retrieval: A Unified Construction  Secure Multiparty Computation of Approximations  Secure Games with Polynomial Expressions  Specification and Deduction  On the Completeness of Arbitrary Selection Strategies for Paramodulation  An Axiomatic Approach to Metareasoning on Nominal Algebras in HOAS  KnuthBendix Constraint Solving Is NPComplete  Amalgamation in CASL via Enriched Signatures  Structural Complexity  Lower Bounds for the Weak Pigeonhole Principle Beyond Resolution  Time and Space Bounds for Reversible Simulation  FiniteState Dimension  The Complexity of Computing the Size of an Interval  Communication Gap for Finite Memory Devices  Separating Quantum and Classical Learning
 Dimensions
 unknown
 Extent
 1 online resource (xiv, 1083 p.)
 Form of item
 online
 Isbn
 9783540482246
 Isbn Type
 (electronic bk.)
 Media category
 computer
 Media MARC source
 rdamedia/dut
 Media type code

 c
 Other physical details
 ill.
 Sound
 unknown sound
 Specific material designation
 remote
 System control number

 (OCoLC)213933829
 (OCoLC)ocn213933829
 Label
 Automata, languages and programming : 28th international colloquium, ICALP 2001, Crete, Greece, July 812, 2001 : proceedings, Fernando Orejas, Paul G. Spirakis, Jan van Leeuwen (eds.), (electronic resource)
 Bibliography note
 Includes bibliographical references and index
 Carrier category
 online bron
 Carrier category code

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

 txt
 Content type MARC source
 rdacontent/dut
 Contents
 Keynote Papers  Algorithms, Games, and the Internet  Automata, Circuits, and Hybrids: Facets of Continuous Time  Invited Papers  Languages, Rewriting Systems, and Verification of InfiniteState Systems  Integrating Semantics for Object  Oriented System Models  Modelling with Partial Orders  Why and Why Not?  Theoretical Aspects of Evolutionary Algorithms  Algebraic and Circuit Complexity  Improvements of the Alder  Strassen Bound: Algebras with Nonzero Radical  On Generating All Minimal Integer Solutions for a Monotone System of Linear Inequalities  Division Is In Uniform TC0  Algorithm Analysis  A Framework for Index Bulk Loading and Dynamization  A Characterization of Temporal Locality and Its Portability across Memory Hierarchies  The Complexity of Constructing Evolutionary Trees Using Experiments  Hidden Pattern Statistics  Combinatorics and Algorithms on LowDiscrepancy Roundings of a Real Sequence  AllPairs Shortest Paths Computation in the BSP Model  Approximation and Optimization  Approximating the Minimum Spanning Tree Weight in Sublinear Time  Approximation Hardness of TSP with Bounded Metrics  The RPR 2 Rounding Technique for Semidefinite Programs  Approximation Algorithms for Partial Covering Problems  On the Online Bin Packing Problem  Quick kMedian, kCenter, and Facility Location for Sparse Graphs  Complexity  Parameterized Complexity: Exponential SpeedUp for Planar Graph Problems  Subexponential Parameterized Algorithms Collapse the WHierarchy  Improved Lower Bounds on the Randomized Complexity of Graph Properties  New Imperfect Random Source with Applications to CoinFlipping  Recognizing More Unsatisfiable Random 3SAT Instances Efficiently  WeisfeilerLehman Refinement Requires at Least a Linear Number of Iterations  On Interactive Proofs with a Laconic Prover  Quantum Complexities of Ordered Searching, Sorting, and Element Distinctness  Lower Bounds in the Quantum Cell Probe Model  Concurrency  Axiomatizations for Probabilistic Bisimulation  Noninterference for Concurrent Programs  Distributed Controller Synthesis for Local Specifications  A Distributed Abstract Machine for Safe Ambients  Towards Quantitative Verification of Probabilistic Transition Systems  Efficient Datastructures  Efficient Generation of Plane Triangulations without Repetitions  The Longest Common Subsequence Problem for Sequences with Nested Arc Annotations  VisibilityBased PursuitEvasion in a Polygonal Region by a Searcher  A New Method for Balancing Binary Search Trees  Graph Algorithms  Permutation Editing and Matching via Embeddings  Testing Hypergraph Coloring  Total Colorings of Degenerated Graphs  Decidable Properties of Graphs of AllOptical Networks  Majority Consensus and the Local Majority Rule  Language Theory, Codes, and Automata  Solvability of Equations in Free Partially Commutative Groups Is decidable  Rational Transformations of Formal Power Series  Combinatorics of ThreeInterval Exchanges  Decision Questions Concerning Semilinearity, Morphisms, and Commutation of Languages  The Star Problem in Trace Monoids: Reductions Beyond C4  The Trace Coding Problem Is Undecidable  Combinatorics of Periods in Strings  Minimal TailBiting Trellises for Certain Cyclic Block Codes Are Easy to Construct  Model Checking and Protocol Analysis  Effective Lossy Queue Languages  Model Checking of Unrestricted Hierarchical State Machines  Symbolic Trace Analysis of Cryptographic Protocols  Tree Automata with One Memory, Set Constraints, and PingPong Protocols  Fair Simulation Relations, Parity Games, and State Space Reduction for Büchi Automata  Hypergraphs in Model Checking: Acyclicity and HypertreeWidth versus CliqueWidth  From Finite State Communication Protocols to HighLevel Message Sequence Charts  Networks and Routing  Fractional Path Coloring with Applications to WDM Networks  Performance Aspects of Distributed Caches Using TTLBased Consistency  Routing in Trees  Online Packet Routing on Linear Arrays and Rings  Faster Gossiping on Butterflies  Reasoning and Verification  Realizability and Verification of MSC Graphs  Reasoning about Sequential and Branching Behaviours of Message Sequence Graphs  A SetTheoretic Framework for AssumeGuarantee Reasoning  Foundations for Circular Compositional Reasoning  Scheduling  A PTAS for Minimizing Weighted Completion Time on Uniformly Related Machines  The Buffer Minimization Problem for Multiprocessor Scheduling with Conflicts  On Minimizing Average Weighted Completion Time of Multiprocessor Tasks with Release Dates  On the Approximability of Average Completion Time Scheduling under Precedence Constraints  Secure Computation  Optimistic Asynchronous Multiparty Contract Signing with Reduced Number of Rounds  InformationTheoretic Private Information Retrieval: A Unified Construction  Secure Multiparty Computation of Approximations  Secure Games with Polynomial Expressions  Specification and Deduction  On the Completeness of Arbitrary Selection Strategies for Paramodulation  An Axiomatic Approach to Metareasoning on Nominal Algebras in HOAS  KnuthBendix Constraint Solving Is NPComplete  Amalgamation in CASL via Enriched Signatures  Structural Complexity  Lower Bounds for the Weak Pigeonhole Principle Beyond Resolution  Time and Space Bounds for Reversible Simulation  FiniteState Dimension  The Complexity of Computing the Size of an Interval  Communication Gap for Finite Memory Devices  Separating Quantum and Classical Learning
 Dimensions
 unknown
 Extent
 1 online resource (xiv, 1083 p.)
 Form of item
 online
 Isbn
 9783540482246
 Isbn Type
 (electronic bk.)
 Media category
 computer
 Media MARC source
 rdamedia/dut
 Media type code

 c
 Other physical details
 ill.
 Sound
 unknown sound
 Specific material designation
 remote
 System control number

 (OCoLC)213933829
 (OCoLC)ocn213933829
Library Locations

Architecture LibraryBorrow itGould Hall 830 Van Vleet Oval Rm. 105, Norman, OK, 73019, US35.205706 97.445050



Chinese Literature Translation ArchiveBorrow it401 W. Brooks St., RM 414, Norman, OK, 73019, US35.207487 97.447906

Engineering LibraryBorrow itFelgar Hall 865 Asp Avenue, Rm. 222, Norman, OK, 73019, US35.205706 97.445050

Fine Arts LibraryBorrow itCatlett Music Center 500 West Boyd Street, Rm. 20, Norman, OK, 73019, US35.210371 97.448244

Harry W. Bass Business History CollectionBorrow it401 W. Brooks St., Rm. 521NW, Norman, OK, 73019, US35.207487 97.447906

History of Science CollectionsBorrow it401 W. Brooks St., Rm. 521NW, Norman, OK, 73019, US35.207487 97.447906

John and Mary Nichols Rare Books and Special CollectionsBorrow it401 W. Brooks St., Rm. 509NW, Norman, OK, 73019, US35.207487 97.447906


Price College Digital LibraryBorrow itAdams Hall 102 307 West Brooks St., Norman, OK, 73019, US35.210371 97.448244

Western History CollectionsBorrow itMonnet Hall 630 Parrington Oval, Rm. 300, Norman, OK, 73019, US35.209584 97.445414
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.libraries.ou.edu/portal/Automatalanguagesandprogramming28th/FZDltLOMnsE/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.libraries.ou.edu/portal/Automatalanguagesandprogramming28th/FZDltLOMnsE/">Automata, languages and programming : 28th international colloquium, ICALP 2001, Crete, Greece, July 812, 2001 : proceedings, Fernando Orejas, Paul G. Spirakis, Jan van Leeuwen (eds.), (electronic resource)</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.libraries.ou.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.libraries.ou.edu/">University of Oklahoma 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 : 28th international colloquium, ICALP 2001, Crete, Greece, July 812, 2001 : proceedings, Fernando Orejas, Paul G. Spirakis, Jan van Leeuwen (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.libraries.ou.edu/portal/Automatalanguagesandprogramming28th/FZDltLOMnsE/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.libraries.ou.edu/portal/Automatalanguagesandprogramming28th/FZDltLOMnsE/">Automata, languages and programming : 28th international colloquium, ICALP 2001, Crete, Greece, July 812, 2001 : proceedings, Fernando Orejas, Paul G. Spirakis, Jan van Leeuwen (eds.), (electronic resource)</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.libraries.ou.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.libraries.ou.edu/">University of Oklahoma Libraries</a></span></span></span></span></div>