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 : 27th International Colloquium, ICALP 2000, Geneva, Switzerland, July 915, 2000 Proceedings, edited by Ugo Montanari, Jose D.P. Rolim, Emo Welzl, (electronic resource)
Automata, Languages and Programming : 27th International Colloquium, ICALP 2000, Geneva, Switzerland, July 915, 2000 Proceedings, edited by Ugo Montanari, Jose D.P. Rolim, Emo Welzl, (electronic resource)
Resource Information
The item Automata, Languages and Programming : 27th International Colloquium, ICALP 2000, Geneva, Switzerland, July 915, 2000 Proceedings, edited by Ugo Montanari, Jose D.P. Rolim, Emo Welzl, (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 : 27th International Colloquium, ICALP 2000, Geneva, Switzerland, July 915, 2000 Proceedings, edited by Ugo Montanari, Jose D.P. Rolim, Emo Welzl, (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 27th International Colloquium on Automata, Languages and Programming, ICALP 2000, held in Geneva, Switzerland in July 2000. The 69 revised full papers presented together with nine invited contributions were carefully reviewed and selected from a total of 196 extended abstracts submitted for the two tracks on algorithms, automata, complexity, and games and on logic, semantics, and programming theory. All in all, the volume presents an unique snapshot of the stateoftheart in theoretical computer science
 Language

 eng
 eng
 Edition
 1st ed. 2000.
 Extent
 1 online resource (XVI, 952 p.)
 Note
 Bibliographic Level Mode of Issuance: Monograph
 Contents

 Invited Talk
 Game Semantics: Achievements and Prospects
 Clique Is Hard to Approximate within n 1o(1)
 Approximating the Independence Number and the Chromatic Number in Expected Polynomial Time
 Closed Types as a Simple Approach to Safe Imperative Multistage Programming
 A Statically Allocated Parallel Functional Language
 An Optimal Minimum Spanning Tree Algorithm
 Improved Shortest Paths on the Word RAM
 Improved Algorithms for Finding Level Ancestors in Dynamic Trees
 Lax Logical Relations
 Reasoning about Idealized ALGOL Using Regular Languages
 The Measurement Process in Domain Theory
 Invited Talk
 Graph Transformation as a Conceptual and Formal Framework for System Modeling and Model Evolution
 Monotone Proofs of the Pigeon Hole Principle
 FullyAbstract Statecharts Semantics via Intuitionistic Kripke Models
 Algebraic Models for Contextual Nets
 Asymptotically Optimal Bounds for OBDDs and the Solution of Some Basic OBDD Problems
 Measures of Nondeterminism in Finite Automata
 LTL Is Expressively Complete for Mazurkiewicz Traces
 An AutomataTheoretic Completeness Proof for Interval Temporal Logic
 Invited Talk
 Which NPHard Optimization Problems Admit Nontrivial Efficient Approximation Algorithms?
 Deterministic Algorithms for kSAT Based on Covering Codes and Local Search
 Closest Vectors, Successive Minima, and Dual HKZBases of Lattices
 Variable Independence, Quantifier Elimination, and Constraint Representations
 Constraint Satisfaction Problems and Finite Algebras
 An Optimal Online Algorithm for Bounded Space VariableSized Bin Packing
 Resource Augmentation for Online Bounded Space Bin Packing
 Optimal Projective Algorithms for the List Update Problem
 Efficient Verification Algorithms for OneCounter Processes
 On the Complexity of Bisimulation Problems for Basic Parallel Processes
 Decidable FirstOrder Transition Logics for PAProcesses
 Invited Talk
 Non Interference for the Analysis of Cryptographic Protocols
 Average BitComplexity of Euclidean Algorithms
 Planar Maps and Airy Phenomena
 Analysing Input/OutputCapabilities of Mobile Processes with a Generic Type System
 Information Flow vs. Resource Access in the Asynchronous PiCalculus (Extended Abstract)
 Award Talk
 The Genomics Revolution and Its Challenges for Algorithmic Research
 Invited Talk
 Alternating the Temporal Picture for Safety
 Necessary and Sufficient Assumptions for Noninteractive ZeroKnowledge Proofs of Knowledge for All NP Relations
 Fast Verification of Any Remote Procedure Call: Short WitnessIndistinguishable OneRound Proofs for NP
 A New Unfolding Approach to LTL Model Checking
 Reasoning about Message Passing in Finite State Environments
 Extended Notions of Security for Multicast Public Key Cryptosystems
 OneRound Secure Computation and Secure Autonomous Mobile Agents
 RoundOptimal and AbuseFree Optimistic Multiparty Contract Signing
 On the Centralizer of a Finite Set
 On the Power of TreeWalking Automata
 Determinization of Transducers over Infinite Words
 Invited Talk
 Constraint Programming and Graph Algorithms
 Scalable Secure Storage when Half the System Is Faulty
 Generating Partial and Multiple Transversals of a Hypergraph
 Revisiting the Correspondence between Cut Elimination and Normalisation
 Negation Elimination from Simple Equational Formulae
 Hardness of Set Cover with Intersection 1
 Strong Inapproximability of the Basic kSpanner Problem
 Infinite SeriesParallel Posets: Logic and Languages
 On Deciding if Deterministic Rabin Language Is in Büchi Class
 On Message Sequence Graphs and Finitely Generated Regular MSC Languages
 Invited Talk
 Pseudorandomness
 A Bound on the Capacity of Backoff and AcknowledgementBased Protocols
 Deterministic Radio Broadcasting
 An ?Complete Equational Specification of Interleaving
 A Complete Axiomatization for Observational Congruence of Prioritized FiniteState Behaviors
 Tight Size Bounds for Packet Headers in Narrow Meshes
 Wavelength Assignment Problem on AllOptical Networks with k Fibres per Link
 On the Logical Characterisation of Performability Properties
 On the Representation of Timed Polyhedra
 Invited Talk
 Minwise Independent Permutations: Theory and Practice
 Testing Acyclicity of Directed Graphs in Sublinear Time
 Computing the Girth of a Planar Graph
 Lower Bounds Are Not Easier over the Reals: Inside PH
 Unlearning Helps
 Fast Approximation Schemes for Euclidean Multiconnectivity Problems
 Approximate TSP in Graphs with Forbidden Minors
 Polynomial Time Approximation Schemes for General Multiprocessor Job Shop Scheduling
 The Many Faces of a Translation
 Gales and the Constructive Dimension of Individual Sequences
 The Global Power of Additional Queries to pRandom Oracles
 Homogenization and the Polynomial Calculus
 Isbn
 9783540450221
 Label
 Automata, Languages and Programming : 27th International Colloquium, ICALP 2000, Geneva, Switzerland, July 915, 2000 Proceedings
 Title
 Automata, Languages and Programming
 Title remainder
 27th International Colloquium, ICALP 2000, Geneva, Switzerland, July 915, 2000 Proceedings
 Statement of responsibility
 edited by Ugo Montanari, Jose D.P. Rolim, Emo Welzl
 Language

 eng
 eng
 Summary
 This book constitutes the refereed proceedings of the 27th International Colloquium on Automata, Languages and Programming, ICALP 2000, held in Geneva, Switzerland in July 2000. The 69 revised full papers presented together with nine invited contributions were carefully reviewed and selected from a total of 196 extended abstracts submitted for the two tracks on algorithms, automata, complexity, and games and on logic, semantics, and programming theory. All in all, the volume presents an unique snapshot of the stateoftheart in theoretical computer science
 Dewey number
 004.0151
 http://bibfra.me/vocab/relation/httpidlocgovvocabularyrelatorsedt

 i7RV6H6NoL8
 aN2eGn8N0PU
 KoGwle3pFnU
 Image bit depth
 0
 Language note
 English
 LC call number
 QA75.576.95
 Literary form
 non fiction
 http://bibfra.me/vocab/lite/meetingName
 International Colloquium on Automata, Languages, and Programming
 Nature of contents
 dictionaries
 http://library.link/vocab/relatedWorkOrContributorName

 Montanari, Ugo.
 Rolim, Jose D.P.
 Welzl, Emo.
 Series statement
 Lecture Notes in Computer Science,
 Series volume
 1853
 http://library.link/vocab/subjectName

 Information theory
 Software engineering
 Computer Communication Networks
 Computer science
 Theory of Computation
 Software Engineering/Programming and Operating Systems
 Computer Communication Networks
 Special Purpose and ApplicationBased Systems
 Mathematics of Computing
 Label
 Automata, Languages and Programming : 27th International Colloquium, ICALP 2000, Geneva, Switzerland, July 915, 2000 Proceedings, edited by Ugo Montanari, Jose D.P. Rolim, Emo Welzl, (electronic resource)
 Note
 Bibliographic Level Mode of Issuance: Monograph
 Antecedent source
 mixed
 Bibliography note
 Includes bibliographical references at the end of each chapters and index
 Carrier category
 online resource
 Carrier category code

 cr
 Color
 not applicable
 Content category
 text
 Content type code

 txt
 Contents
 Invited Talk  Game Semantics: Achievements and Prospects  Clique Is Hard to Approximate within n 1o(1)  Approximating the Independence Number and the Chromatic Number in Expected Polynomial Time  Closed Types as a Simple Approach to Safe Imperative Multistage Programming  A Statically Allocated Parallel Functional Language  An Optimal Minimum Spanning Tree Algorithm  Improved Shortest Paths on the Word RAM  Improved Algorithms for Finding Level Ancestors in Dynamic Trees  Lax Logical Relations  Reasoning about Idealized ALGOL Using Regular Languages  The Measurement Process in Domain Theory  Invited Talk  Graph Transformation as a Conceptual and Formal Framework for System Modeling and Model Evolution  Monotone Proofs of the Pigeon Hole Principle  FullyAbstract Statecharts Semantics via Intuitionistic Kripke Models  Algebraic Models for Contextual Nets  Asymptotically Optimal Bounds for OBDDs and the Solution of Some Basic OBDD Problems  Measures of Nondeterminism in Finite Automata  LTL Is Expressively Complete for Mazurkiewicz Traces  An AutomataTheoretic Completeness Proof for Interval Temporal Logic  Invited Talk  Which NPHard Optimization Problems Admit Nontrivial Efficient Approximation Algorithms?  Deterministic Algorithms for kSAT Based on Covering Codes and Local Search  Closest Vectors, Successive Minima, and Dual HKZBases of Lattices  Variable Independence, Quantifier Elimination, and Constraint Representations  Constraint Satisfaction Problems and Finite Algebras  An Optimal Online Algorithm for Bounded Space VariableSized Bin Packing  Resource Augmentation for Online Bounded Space Bin Packing  Optimal Projective Algorithms for the List Update Problem  Efficient Verification Algorithms for OneCounter Processes  On the Complexity of Bisimulation Problems for Basic Parallel Processes  Decidable FirstOrder Transition Logics for PAProcesses  Invited Talk  Non Interference for the Analysis of Cryptographic Protocols  Average BitComplexity of Euclidean Algorithms  Planar Maps and Airy Phenomena  Analysing Input/OutputCapabilities of Mobile Processes with a Generic Type System  Information Flow vs. Resource Access in the Asynchronous PiCalculus (Extended Abstract)  Award Talk  The Genomics Revolution and Its Challenges for Algorithmic Research  Invited Talk  Alternating the Temporal Picture for Safety  Necessary and Sufficient Assumptions for Noninteractive ZeroKnowledge Proofs of Knowledge for All NP Relations  Fast Verification of Any Remote Procedure Call: Short WitnessIndistinguishable OneRound Proofs for NP  A New Unfolding Approach to LTL Model Checking  Reasoning about Message Passing in Finite State Environments  Extended Notions of Security for Multicast Public Key Cryptosystems  OneRound Secure Computation and Secure Autonomous Mobile Agents  RoundOptimal and AbuseFree Optimistic Multiparty Contract Signing  On the Centralizer of a Finite Set  On the Power of TreeWalking Automata  Determinization of Transducers over Infinite Words  Invited Talk  Constraint Programming and Graph Algorithms  Scalable Secure Storage when Half the System Is Faulty  Generating Partial and Multiple Transversals of a Hypergraph  Revisiting the Correspondence between Cut Elimination and Normalisation  Negation Elimination from Simple Equational Formulae  Hardness of Set Cover with Intersection 1  Strong Inapproximability of the Basic kSpanner Problem  Infinite SeriesParallel Posets: Logic and Languages  On Deciding if Deterministic Rabin Language Is in Büchi Class  On Message Sequence Graphs and Finitely Generated Regular MSC Languages  Invited Talk  Pseudorandomness  A Bound on the Capacity of Backoff and AcknowledgementBased Protocols  Deterministic Radio Broadcasting  An ?Complete Equational Specification of Interleaving  A Complete Axiomatization for Observational Congruence of Prioritized FiniteState Behaviors  Tight Size Bounds for Packet Headers in Narrow Meshes  Wavelength Assignment Problem on AllOptical Networks with k Fibres per Link  On the Logical Characterisation of Performability Properties  On the Representation of Timed Polyhedra  Invited Talk  Minwise Independent Permutations: Theory and Practice  Testing Acyclicity of Directed Graphs in Sublinear Time  Computing the Girth of a Planar Graph  Lower Bounds Are Not Easier over the Reals: Inside PH  Unlearning Helps  Fast Approximation Schemes for Euclidean Multiconnectivity Problems  Approximate TSP in Graphs with Forbidden Minors  Polynomial Time Approximation Schemes for General Multiprocessor Job Shop Scheduling  The Many Faces of a Translation  Gales and the Constructive Dimension of Individual Sequences  The Global Power of Additional Queries to pRandom Oracles  Homogenization and the Polynomial Calculus
 Dimensions
 unknown
 Edition
 1st ed. 2000.
 Extent
 1 online resource (XVI, 952 p.)
 File format
 multiple file formats
 Form of item
 online
 Isbn
 9783540450221
 Level of compression
 uncompressed
 Media category
 computer
 Media type code

 c
 Other control number
 10.1007/354045022X
 Quality assurance targets
 absent
 Reformatting quality
 access
 Specific material designation
 remote
 System control number

 (CKB)1000000000211269
 (SSID)ssj0000321496
 (PQKBManifestationID)11246810
 (PQKBTitleCode)TC0000321496
 (PQKBWorkID)10279534
 (PQKB)11560013
 (DEHe213)9783540450221
 (MiAaPQ)EBC3072415
 (EXLCZ)991000000000211269
 Label
 Automata, Languages and Programming : 27th International Colloquium, ICALP 2000, Geneva, Switzerland, July 915, 2000 Proceedings, edited by Ugo Montanari, Jose D.P. Rolim, Emo Welzl, (electronic resource)
 Note
 Bibliographic Level Mode of Issuance: Monograph
 Antecedent source
 mixed
 Bibliography note
 Includes bibliographical references at the end of each chapters and index
 Carrier category
 online resource
 Carrier category code

 cr
 Color
 not applicable
 Content category
 text
 Content type code

 txt
 Contents
 Invited Talk  Game Semantics: Achievements and Prospects  Clique Is Hard to Approximate within n 1o(1)  Approximating the Independence Number and the Chromatic Number in Expected Polynomial Time  Closed Types as a Simple Approach to Safe Imperative Multistage Programming  A Statically Allocated Parallel Functional Language  An Optimal Minimum Spanning Tree Algorithm  Improved Shortest Paths on the Word RAM  Improved Algorithms for Finding Level Ancestors in Dynamic Trees  Lax Logical Relations  Reasoning about Idealized ALGOL Using Regular Languages  The Measurement Process in Domain Theory  Invited Talk  Graph Transformation as a Conceptual and Formal Framework for System Modeling and Model Evolution  Monotone Proofs of the Pigeon Hole Principle  FullyAbstract Statecharts Semantics via Intuitionistic Kripke Models  Algebraic Models for Contextual Nets  Asymptotically Optimal Bounds for OBDDs and the Solution of Some Basic OBDD Problems  Measures of Nondeterminism in Finite Automata  LTL Is Expressively Complete for Mazurkiewicz Traces  An AutomataTheoretic Completeness Proof for Interval Temporal Logic  Invited Talk  Which NPHard Optimization Problems Admit Nontrivial Efficient Approximation Algorithms?  Deterministic Algorithms for kSAT Based on Covering Codes and Local Search  Closest Vectors, Successive Minima, and Dual HKZBases of Lattices  Variable Independence, Quantifier Elimination, and Constraint Representations  Constraint Satisfaction Problems and Finite Algebras  An Optimal Online Algorithm for Bounded Space VariableSized Bin Packing  Resource Augmentation for Online Bounded Space Bin Packing  Optimal Projective Algorithms for the List Update Problem  Efficient Verification Algorithms for OneCounter Processes  On the Complexity of Bisimulation Problems for Basic Parallel Processes  Decidable FirstOrder Transition Logics for PAProcesses  Invited Talk  Non Interference for the Analysis of Cryptographic Protocols  Average BitComplexity of Euclidean Algorithms  Planar Maps and Airy Phenomena  Analysing Input/OutputCapabilities of Mobile Processes with a Generic Type System  Information Flow vs. Resource Access in the Asynchronous PiCalculus (Extended Abstract)  Award Talk  The Genomics Revolution and Its Challenges for Algorithmic Research  Invited Talk  Alternating the Temporal Picture for Safety  Necessary and Sufficient Assumptions for Noninteractive ZeroKnowledge Proofs of Knowledge for All NP Relations  Fast Verification of Any Remote Procedure Call: Short WitnessIndistinguishable OneRound Proofs for NP  A New Unfolding Approach to LTL Model Checking  Reasoning about Message Passing in Finite State Environments  Extended Notions of Security for Multicast Public Key Cryptosystems  OneRound Secure Computation and Secure Autonomous Mobile Agents  RoundOptimal and AbuseFree Optimistic Multiparty Contract Signing  On the Centralizer of a Finite Set  On the Power of TreeWalking Automata  Determinization of Transducers over Infinite Words  Invited Talk  Constraint Programming and Graph Algorithms  Scalable Secure Storage when Half the System Is Faulty  Generating Partial and Multiple Transversals of a Hypergraph  Revisiting the Correspondence between Cut Elimination and Normalisation  Negation Elimination from Simple Equational Formulae  Hardness of Set Cover with Intersection 1  Strong Inapproximability of the Basic kSpanner Problem  Infinite SeriesParallel Posets: Logic and Languages  On Deciding if Deterministic Rabin Language Is in Büchi Class  On Message Sequence Graphs and Finitely Generated Regular MSC Languages  Invited Talk  Pseudorandomness  A Bound on the Capacity of Backoff and AcknowledgementBased Protocols  Deterministic Radio Broadcasting  An ?Complete Equational Specification of Interleaving  A Complete Axiomatization for Observational Congruence of Prioritized FiniteState Behaviors  Tight Size Bounds for Packet Headers in Narrow Meshes  Wavelength Assignment Problem on AllOptical Networks with k Fibres per Link  On the Logical Characterisation of Performability Properties  On the Representation of Timed Polyhedra  Invited Talk  Minwise Independent Permutations: Theory and Practice  Testing Acyclicity of Directed Graphs in Sublinear Time  Computing the Girth of a Planar Graph  Lower Bounds Are Not Easier over the Reals: Inside PH  Unlearning Helps  Fast Approximation Schemes for Euclidean Multiconnectivity Problems  Approximate TSP in Graphs with Forbidden Minors  Polynomial Time Approximation Schemes for General Multiprocessor Job Shop Scheduling  The Many Faces of a Translation  Gales and the Constructive Dimension of Individual Sequences  The Global Power of Additional Queries to pRandom Oracles  Homogenization and the Polynomial Calculus
 Dimensions
 unknown
 Edition
 1st ed. 2000.
 Extent
 1 online resource (XVI, 952 p.)
 File format
 multiple file formats
 Form of item
 online
 Isbn
 9783540450221
 Level of compression
 uncompressed
 Media category
 computer
 Media type code

 c
 Other control number
 10.1007/354045022X
 Quality assurance targets
 absent
 Reformatting quality
 access
 Specific material designation
 remote
 System control number

 (CKB)1000000000211269
 (SSID)ssj0000321496
 (PQKBManifestationID)11246810
 (PQKBTitleCode)TC0000321496
 (PQKBWorkID)10279534
 (PQKB)11560013
 (DEHe213)9783540450221
 (MiAaPQ)EBC3072415
 (EXLCZ)991000000000211269
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/AutomataLanguagesandProgramming27th/eHXhQZSrYW4/" 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/AutomataLanguagesandProgramming27th/eHXhQZSrYW4/">Automata, Languages and Programming : 27th International Colloquium, ICALP 2000, Geneva, Switzerland, July 915, 2000 Proceedings, edited by Ugo Montanari, Jose D.P. Rolim, Emo Welzl, (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 : 27th International Colloquium, ICALP 2000, Geneva, Switzerland, July 915, 2000 Proceedings, edited by Ugo Montanari, Jose D.P. Rolim, Emo Welzl, (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/AutomataLanguagesandProgramming27th/eHXhQZSrYW4/" 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/AutomataLanguagesandProgramming27th/eHXhQZSrYW4/">Automata, Languages and Programming : 27th International Colloquium, ICALP 2000, Geneva, Switzerland, July 915, 2000 Proceedings, edited by Ugo Montanari, Jose D.P. Rolim, Emo Welzl, (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>