Borrow it
 Albert D. Cohen Management Library
 Architecture/Fine Arts Library
 Archives and Special Collections
 Bibliothèque AlfredMonnin (Université de SaintBoniface)
 Bill Larson Library (Grace Hospital)
 Carolyn Sifton  Helene Fuld Library (St. Boniface General Hospital)
 Concordia Hospital Library
 Donald W. Craik Engineering Library
 E.K. Williams Law Library
 EckhardtGramatté Music Library
 Elizabeth Dafoe Library
 Fr. H. Drake Library (St. Paul's College)
 J.W. Crane Memorial Library (Deer Lodge Centre)
 Libraries Annex (not open to the public; please see web page for details)
 Neil John Maclean Health Sciences Library
 Sciences and Technology Library
 Seven Oaks General Hospital Library
 Sister St. Odilon Library (Misericordia Health Centre)
 St. John's College Library
 Victoria General Hospital Library
 William R Newman Library (Agriculture)
The Resource Automata, Languages, and Programming : 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 610, 2015, Proceedings, Part I, edited by Magnús M. Halldórsson, Kazuo Iwama, Naoki Kobayashi, Bettina Speckmann, (electronic resource)
Automata, Languages, and Programming : 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 610, 2015, Proceedings, Part I, edited by Magnús M. Halldórsson, Kazuo Iwama, Naoki Kobayashi, Bettina Speckmann, (electronic resource)
Resource Information
The item Automata, Languages, and Programming : 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 610, 2015, Proceedings, Part I, edited by Magnús M. Halldórsson, Kazuo Iwama, Naoki Kobayashi, Bettina Speckmann, (electronic resource) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Manitoba Libraries.This item is available to borrow from all library branches.
Resource Information
The item Automata, Languages, and Programming : 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 610, 2015, Proceedings, Part I, edited by Magnús M. Halldórsson, Kazuo Iwama, Naoki Kobayashi, Bettina Speckmann, (electronic resource) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Manitoba Libraries.
This item is available to borrow from all library branches.
 Summary
 The twovolume set LNCS 9134 and LNCS 9135 constitutes the refereed proceedings of the 42nd International Colloquium on Automata, Languages and Programming, ICALP 2015, held in Kyoto, Japan, in July 2015. The 143 revised full papers presented were carefully reviewed and selected from 507 submissions. The papers are organized in the following three tracks: algorithms, complexity, and games; logic, semantics, automata, and theory of programming; and foundations of networked computation: models, algorithms, and information management
 Language

 eng
 eng
 Edition
 1st ed. 2015.
 Extent
 1 online resource (XXXI, 1111 p. 78 illus.)
 Note
 Bibliographic Level Mode of Issuance: Monograph
 Contents

 Statistical Randomized Encodings: A Complexity Theoretic View
 Tighter Fourier Transform Lower Bounds
 Quantifying Competitiveness in Paging with Locality of Reference
 Approximation Algorithms for Computing Maximin Share Allocations
 EnvyFree Pricing in Large Markets: Approximating Revenue and Welfare
 Batched Point Location in SINR Diagrams via Algebraic Tools
 On the Randomized Competitive Ratio of Reordering Buffer Management with Nonuniform Costs
 Serving in the Dark Should Be Done Nonuniformly
 Finding the Median (Obliviously) with Bounded Space
 Approximation Algorithms for MinSum kClustering
 Solving Linear Programming with Constraints Unknown
 Deterministic Randomness Extraction from Generalized and Distributed SanthaVazirani Sources
 Limitations of Algebraic Approaches to Graph Isomorphism Testing
 Fully Dynamic Matching in Bipartite Graphs
 Feasible Interpolation for QBF Resolution Calculi
 Simultaneous Approximation of Constraint Satisfaction Problems
 Design of Dynamic Algorithms via PrimalDual Method
 What Percentage of Programs Halt?
 The Parity of Set Systems Under Random Restrictions with Applications to Exponential Time Problems
 Spotting Trees with Few Leaves
 Constraint Satisfaction Problems over the Integers with Successor
 Hardness Amplification and the Approximate Degree of ConstantDepth Circuits
 Algorithms and Complexity for TuraevViro Invariants
 Big Data on the Rise? – Testing Monotonicity of Distributions
 Unit Interval Editing Is FixedParameter Tractable
 Streaming Algorithms for Submodular Function Maximization
 Multilinear Pseudorandom Functions
 ZeroFixing Extractors for SubLogarithmic Entropy
 Interactive Proofs with Approximately Commuting Provers
 Popular Matchings with TwoSided Preferences and OneSided Ties
 Block Interpolation: A Framework for Tight ExponentialTime Counting Complexity
 On Convergence and Threshold Properties of Discrete LotkaVolterra Population Protocols
 Scheduling Bidirectional Traffic on a Path
 On the Problem of Approximating the Eigenvalues of Undirected Graphs in Probabilistic Logspace
 On Planar Boolean CSP
 On Temporal Graph Exploration
 Mind Your Coins: Fully LeakageResilient Signatures with Graceful Degradation
 A (1+e)Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs
 Lower Bounds for the Graph Homomorphism Problem
 Parameterized SingleExponential Time Polynomial Space Algorithm for Steiner Tree
 Relative Discrepancy Does not Separate Information and Communication Complexity
 A Galois Connection for Valued Constraint Languages of Infinite Size
 Approximately Counting H Colourings Is #BISHard
 Taylor Polynomial Estimator for Estimating Frequency Moments
 ETRCompleteness for Decision Versions of Multiplayer (Symmetric) Nash Equilibria
 Separate, Measure and Conquer: Faster PolynomialSpace Algorithms for Max 2CSP and Counting Dominating Sets
 Submatrix Maximum Queries in Monge Matrices Are Equivalent to Predecessor Search
 Optimal Encodings for Range Topk, Selection, and MinMax
 2Vertex Connectivity in Directed Graphs
 Ground State Connectivity of Local Hamiltonians
 Uniform Kernelization Complexity of Hitting Forbidden Minors
 Counting Homomorphisms to SquareFree Graphs, Modulo 2
 Approximately Counting LocallyOptimal Structures
 Proofs of Proximity for ContextFree Languages and ReadOnce Branching Programs (Extended Abstract)
 Fast Algorithms for DiameterOptimally Augmenting Paths
 Hollow Heaps
 LinearTime List Recovery of HighRate Expander Codes
 Finding 2Edge and 2Vertex Strongly Connected Components in Quadratic Time
 Improved Algorithms for Decremental SingleSource Reachability on Directed Graphs
 Weighted Reordering Buffer Improved via Variants of Knapsack Covering Inequalities
 Local Reductions
 Query Complexity in Expectation
 NearLinear Query Complexity for Graph Inference
 A QPTAS for the Base of the Number of CrossingFree Structures on a Planar Point Set
 Finding a Path in GroupLabeled Graphs with Two Labels Forbidden
 Lower Bounds for Sums of Powers of Low Degree Univariates
 Approximating CSPs Using LP Relaxation
 Comparator Circuits over Finite Bounded Posets
 Algebraic Properties of Valued Constraint Satisfaction Problem
 Towards Understanding the Smoothed Approximation Ratio of the 2Opt Heuristic
 On the Hardest Problem Formulations for the 0/1 Lasserre Hierarchy
 Replacing Mark Bits with Randomness in Fibonacci Heaps
 A PTAS for the Weighted Unit Disk Cover Problem
 Approximating the Expected Values for Combinatorial Optimization Problems Over Stochastic Points
 Deterministic Truncation of Linear Matroids
 Linear Time Parameterized Algorithms for Subset Feedback Vertex Set
 An Optimal Algorithm for MinimumLink Rectilinear Paths in Triangulated Rectilinear Domains
 Amplification of OneWay Information Complexity via Codes and Noise Sensitivity
 A (2+e)Approximation Algorithm for the Storage Allocation Problem
 Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas
 Computing the Fréchet Distance Between Polygons with Holes
 An Improved Private Mechanism for Small Databases
 Binary Pattern Tile Set Synthesis Is NPHard
 NearOptimal Upper Bound on Fourier Dimension of Boolean Functions in Terms of Fourier Sparsity
 Condensed Unpredictability
 SheraliAdams Relaxations for Valued CSPs
 TwoSided Online Bipartite Matching and Vertex Cover: Beating the Greedy Algorithm
 The Simultaneous Communication of Disjointness with Applications to Data Streams
 An Improved Combinatorial Algorithm for Boolean Matrix Multiplication
 Isbn
 9783662476727
 Label
 Automata, Languages, and Programming : 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 610, 2015, Proceedings, Part I
 Title
 Automata, Languages, and Programming
 Title remainder
 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 610, 2015, Proceedings, Part I
 Statement of responsibility
 edited by Magnús M. Halldórsson, Kazuo Iwama, Naoki Kobayashi, Bettina Speckmann
 Subject

 Computer Communication Networks
 Computer science
 Computer software
 Discrete Mathematics in Computer Science
 Information Storage and Retrieval
 Information Systems Applications (incl. Internet)
 Information storage and retrieval systems
 Algorithm Analysis and Problem Complexity
 Computation by Abstract Devices
 Computational complexity
 Computer Communication Networks
 Language

 eng
 eng
 Summary
 The twovolume set LNCS 9134 and LNCS 9135 constitutes the refereed proceedings of the 42nd International Colloquium on Automata, Languages and Programming, ICALP 2015, held in Kyoto, Japan, in July 2015. The 143 revised full papers presented were carefully reviewed and selected from 507 submissions. The papers are organized in the following three tracks: algorithms, complexity, and games; logic, semantics, automata, and theory of programming; and foundations of networked computation: models, algorithms, and information management
 Dewey number
 005.1
 http://bibfra.me/vocab/relation/httpidlocgovvocabularyrelatorsedt

 Br7lOL0mZg
 fvEMMRA1Eg
 t8A_OjrnX88
 _dAq6sYVjz4
 Image bit depth
 0
 Language note
 English
 LC call number
 QA76.9.A43
 Literary form
 non fiction
 http://library.link/vocab/relatedWorkOrContributorName

 Halldórsson, Magnús M.
 Iwama, Kazuo.
 Kobayashi, Naoki.
 Speckmann, Bettina.
 Series statement
 Theoretical Computer Science and General Issues
 Series volume
 9134
 http://library.link/vocab/subjectName

 Computer software
 Computer science
 Computer Communication Networks
 Information storage and retrieval systems
 Computational complexity
 Algorithm Analysis and Problem Complexity
 Computation by Abstract Devices
 Computer Communication Networks
 Information Storage and Retrieval
 Information Systems Applications (incl. Internet)
 Discrete Mathematics in Computer Science
 Label
 Automata, Languages, and Programming : 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 610, 2015, Proceedings, Part I, edited by Magnús M. Halldórsson, Kazuo Iwama, Naoki Kobayashi, Bettina Speckmann, (electronic resource)
 Note
 Bibliographic Level Mode of Issuance: Monograph
 Antecedent source
 mixed
 Carrier category
 online resource
 Carrier category code

 cr
 Color
 not applicable
 Content category
 text
 Content type code

 txt
 Contents
 Statistical Randomized Encodings: A Complexity Theoretic View  Tighter Fourier Transform Lower Bounds  Quantifying Competitiveness in Paging with Locality of Reference  Approximation Algorithms for Computing Maximin Share Allocations  EnvyFree Pricing in Large Markets: Approximating Revenue and Welfare  Batched Point Location in SINR Diagrams via Algebraic Tools  On the Randomized Competitive Ratio of Reordering Buffer Management with Nonuniform Costs  Serving in the Dark Should Be Done Nonuniformly  Finding the Median (Obliviously) with Bounded Space  Approximation Algorithms for MinSum kClustering  Solving Linear Programming with Constraints Unknown  Deterministic Randomness Extraction from Generalized and Distributed SanthaVazirani Sources  Limitations of Algebraic Approaches to Graph Isomorphism Testing  Fully Dynamic Matching in Bipartite Graphs  Feasible Interpolation for QBF Resolution Calculi  Simultaneous Approximation of Constraint Satisfaction Problems  Design of Dynamic Algorithms via PrimalDual Method  What Percentage of Programs Halt?  The Parity of Set Systems Under Random Restrictions with Applications to Exponential Time Problems  Spotting Trees with Few Leaves  Constraint Satisfaction Problems over the Integers with Successor  Hardness Amplification and the Approximate Degree of ConstantDepth Circuits  Algorithms and Complexity for TuraevViro Invariants  Big Data on the Rise? – Testing Monotonicity of Distributions  Unit Interval Editing Is FixedParameter Tractable  Streaming Algorithms for Submodular Function Maximization  Multilinear Pseudorandom Functions  ZeroFixing Extractors for SubLogarithmic Entropy  Interactive Proofs with Approximately Commuting Provers  Popular Matchings with TwoSided Preferences and OneSided Ties  Block Interpolation: A Framework for Tight ExponentialTime Counting Complexity  On Convergence and Threshold Properties of Discrete LotkaVolterra Population Protocols  Scheduling Bidirectional Traffic on a Path  On the Problem of Approximating the Eigenvalues of Undirected Graphs in Probabilistic Logspace  On Planar Boolean CSP  On Temporal Graph Exploration  Mind Your Coins: Fully LeakageResilient Signatures with Graceful Degradation  A (1+e)Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs  Lower Bounds for the Graph Homomorphism Problem  Parameterized SingleExponential Time Polynomial Space Algorithm for Steiner Tree  Relative Discrepancy Does not Separate Information and Communication Complexity  A Galois Connection for Valued Constraint Languages of Infinite Size  Approximately Counting H Colourings Is #BISHard  Taylor Polynomial Estimator for Estimating Frequency Moments  ETRCompleteness for Decision Versions of Multiplayer (Symmetric) Nash Equilibria  Separate, Measure and Conquer: Faster PolynomialSpace Algorithms for Max 2CSP and Counting Dominating Sets  Submatrix Maximum Queries in Monge Matrices Are Equivalent to Predecessor Search  Optimal Encodings for Range Topk, Selection, and MinMax  2Vertex Connectivity in Directed Graphs  Ground State Connectivity of Local Hamiltonians  Uniform Kernelization Complexity of Hitting Forbidden Minors  Counting Homomorphisms to SquareFree Graphs, Modulo 2  Approximately Counting LocallyOptimal Structures  Proofs of Proximity for ContextFree Languages and ReadOnce Branching Programs (Extended Abstract)  Fast Algorithms for DiameterOptimally Augmenting Paths  Hollow Heaps  LinearTime List Recovery of HighRate Expander Codes  Finding 2Edge and 2Vertex Strongly Connected Components in Quadratic Time  Improved Algorithms for Decremental SingleSource Reachability on Directed Graphs  Weighted Reordering Buffer Improved via Variants of Knapsack Covering Inequalities  Local Reductions  Query Complexity in Expectation  NearLinear Query Complexity for Graph Inference  A QPTAS for the Base of the Number of CrossingFree Structures on a Planar Point Set  Finding a Path in GroupLabeled Graphs with Two Labels Forbidden  Lower Bounds for Sums of Powers of Low Degree Univariates  Approximating CSPs Using LP Relaxation  Comparator Circuits over Finite Bounded Posets  Algebraic Properties of Valued Constraint Satisfaction Problem  Towards Understanding the Smoothed Approximation Ratio of the 2Opt Heuristic  On the Hardest Problem Formulations for the 0/1 Lasserre Hierarchy  Replacing Mark Bits with Randomness in Fibonacci Heaps  A PTAS for the Weighted Unit Disk Cover Problem  Approximating the Expected Values for Combinatorial Optimization Problems Over Stochastic Points  Deterministic Truncation of Linear Matroids  Linear Time Parameterized Algorithms for Subset Feedback Vertex Set  An Optimal Algorithm for MinimumLink Rectilinear Paths in Triangulated Rectilinear Domains  Amplification of OneWay Information Complexity via Codes and Noise Sensitivity  A (2+e)Approximation Algorithm for the Storage Allocation Problem  Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas  Computing the Fréchet Distance Between Polygons with Holes  An Improved Private Mechanism for Small Databases  Binary Pattern Tile Set Synthesis Is NPHard  NearOptimal Upper Bound on Fourier Dimension of Boolean Functions in Terms of Fourier Sparsity  Condensed Unpredictability  SheraliAdams Relaxations for Valued CSPs  TwoSided Online Bipartite Matching and Vertex Cover: Beating the Greedy Algorithm  The Simultaneous Communication of Disjointness with Applications to Data Streams  An Improved Combinatorial Algorithm for Boolean Matrix Multiplication
 Dimensions
 unknown
 Edition
 1st ed. 2015.
 Extent
 1 online resource (XXXI, 1111 p. 78 illus.)
 File format
 multiple file formats
 Form of item
 online
 Isbn
 9783662476727
 Level of compression
 uncompressed
 Media category
 computer
 Media type code

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

 (CKB)3710000000437005
 (SSID)ssj0001558444
 (PQKBManifestationID)16182672
 (PQKBTitleCode)TC0001558444
 (PQKBWorkID)14819271
 (PQKB)11216220
 (DEHe213)9783662476727
 (EXLCZ)993710000000437005
 Label
 Automata, Languages, and Programming : 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 610, 2015, Proceedings, Part I, edited by Magnús M. Halldórsson, Kazuo Iwama, Naoki Kobayashi, Bettina Speckmann, (electronic resource)
 Note
 Bibliographic Level Mode of Issuance: Monograph
 Antecedent source
 mixed
 Carrier category
 online resource
 Carrier category code

 cr
 Color
 not applicable
 Content category
 text
 Content type code

 txt
 Contents
 Statistical Randomized Encodings: A Complexity Theoretic View  Tighter Fourier Transform Lower Bounds  Quantifying Competitiveness in Paging with Locality of Reference  Approximation Algorithms for Computing Maximin Share Allocations  EnvyFree Pricing in Large Markets: Approximating Revenue and Welfare  Batched Point Location in SINR Diagrams via Algebraic Tools  On the Randomized Competitive Ratio of Reordering Buffer Management with Nonuniform Costs  Serving in the Dark Should Be Done Nonuniformly  Finding the Median (Obliviously) with Bounded Space  Approximation Algorithms for MinSum kClustering  Solving Linear Programming with Constraints Unknown  Deterministic Randomness Extraction from Generalized and Distributed SanthaVazirani Sources  Limitations of Algebraic Approaches to Graph Isomorphism Testing  Fully Dynamic Matching in Bipartite Graphs  Feasible Interpolation for QBF Resolution Calculi  Simultaneous Approximation of Constraint Satisfaction Problems  Design of Dynamic Algorithms via PrimalDual Method  What Percentage of Programs Halt?  The Parity of Set Systems Under Random Restrictions with Applications to Exponential Time Problems  Spotting Trees with Few Leaves  Constraint Satisfaction Problems over the Integers with Successor  Hardness Amplification and the Approximate Degree of ConstantDepth Circuits  Algorithms and Complexity for TuraevViro Invariants  Big Data on the Rise? – Testing Monotonicity of Distributions  Unit Interval Editing Is FixedParameter Tractable  Streaming Algorithms for Submodular Function Maximization  Multilinear Pseudorandom Functions  ZeroFixing Extractors for SubLogarithmic Entropy  Interactive Proofs with Approximately Commuting Provers  Popular Matchings with TwoSided Preferences and OneSided Ties  Block Interpolation: A Framework for Tight ExponentialTime Counting Complexity  On Convergence and Threshold Properties of Discrete LotkaVolterra Population Protocols  Scheduling Bidirectional Traffic on a Path  On the Problem of Approximating the Eigenvalues of Undirected Graphs in Probabilistic Logspace  On Planar Boolean CSP  On Temporal Graph Exploration  Mind Your Coins: Fully LeakageResilient Signatures with Graceful Degradation  A (1+e)Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs  Lower Bounds for the Graph Homomorphism Problem  Parameterized SingleExponential Time Polynomial Space Algorithm for Steiner Tree  Relative Discrepancy Does not Separate Information and Communication Complexity  A Galois Connection for Valued Constraint Languages of Infinite Size  Approximately Counting H Colourings Is #BISHard  Taylor Polynomial Estimator for Estimating Frequency Moments  ETRCompleteness for Decision Versions of Multiplayer (Symmetric) Nash Equilibria  Separate, Measure and Conquer: Faster PolynomialSpace Algorithms for Max 2CSP and Counting Dominating Sets  Submatrix Maximum Queries in Monge Matrices Are Equivalent to Predecessor Search  Optimal Encodings for Range Topk, Selection, and MinMax  2Vertex Connectivity in Directed Graphs  Ground State Connectivity of Local Hamiltonians  Uniform Kernelization Complexity of Hitting Forbidden Minors  Counting Homomorphisms to SquareFree Graphs, Modulo 2  Approximately Counting LocallyOptimal Structures  Proofs of Proximity for ContextFree Languages and ReadOnce Branching Programs (Extended Abstract)  Fast Algorithms for DiameterOptimally Augmenting Paths  Hollow Heaps  LinearTime List Recovery of HighRate Expander Codes  Finding 2Edge and 2Vertex Strongly Connected Components in Quadratic Time  Improved Algorithms for Decremental SingleSource Reachability on Directed Graphs  Weighted Reordering Buffer Improved via Variants of Knapsack Covering Inequalities  Local Reductions  Query Complexity in Expectation  NearLinear Query Complexity for Graph Inference  A QPTAS for the Base of the Number of CrossingFree Structures on a Planar Point Set  Finding a Path in GroupLabeled Graphs with Two Labels Forbidden  Lower Bounds for Sums of Powers of Low Degree Univariates  Approximating CSPs Using LP Relaxation  Comparator Circuits over Finite Bounded Posets  Algebraic Properties of Valued Constraint Satisfaction Problem  Towards Understanding the Smoothed Approximation Ratio of the 2Opt Heuristic  On the Hardest Problem Formulations for the 0/1 Lasserre Hierarchy  Replacing Mark Bits with Randomness in Fibonacci Heaps  A PTAS for the Weighted Unit Disk Cover Problem  Approximating the Expected Values for Combinatorial Optimization Problems Over Stochastic Points  Deterministic Truncation of Linear Matroids  Linear Time Parameterized Algorithms for Subset Feedback Vertex Set  An Optimal Algorithm for MinimumLink Rectilinear Paths in Triangulated Rectilinear Domains  Amplification of OneWay Information Complexity via Codes and Noise Sensitivity  A (2+e)Approximation Algorithm for the Storage Allocation Problem  Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas  Computing the Fréchet Distance Between Polygons with Holes  An Improved Private Mechanism for Small Databases  Binary Pattern Tile Set Synthesis Is NPHard  NearOptimal Upper Bound on Fourier Dimension of Boolean Functions in Terms of Fourier Sparsity  Condensed Unpredictability  SheraliAdams Relaxations for Valued CSPs  TwoSided Online Bipartite Matching and Vertex Cover: Beating the Greedy Algorithm  The Simultaneous Communication of Disjointness with Applications to Data Streams  An Improved Combinatorial Algorithm for Boolean Matrix Multiplication
 Dimensions
 unknown
 Edition
 1st ed. 2015.
 Extent
 1 online resource (XXXI, 1111 p. 78 illus.)
 File format
 multiple file formats
 Form of item
 online
 Isbn
 9783662476727
 Level of compression
 uncompressed
 Media category
 computer
 Media type code

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

 (CKB)3710000000437005
 (SSID)ssj0001558444
 (PQKBManifestationID)16182672
 (PQKBTitleCode)TC0001558444
 (PQKBWorkID)14819271
 (PQKB)11216220
 (DEHe213)9783662476727
 (EXLCZ)993710000000437005
Subject
 Computer Communication Networks
 Computer science
 Computer software
 Discrete Mathematics in Computer Science
 Information Storage and Retrieval
 Information Systems Applications (incl. Internet)
 Information storage and retrieval systems
 Algorithm Analysis and Problem Complexity
 Computation by Abstract Devices
 Computational complexity
 Computer Communication Networks
Member of
Library Locations

Albert D. Cohen Management LibraryBorrow it181 Freedman Crescent, Winnipeg, MB, R3T 5V4, CA49.807878 97.129961


Archives and Special CollectionsBorrow it25 Chancellors Circle (Elizabeth Dafoe Library), Room 330, Winnipeg, MB, R3T 2N2, CA49.809961 97.131878

Bibliothèque AlfredMonnin (Université de SaintBoniface)Borrow it200, avenue de la Cathédrale, Local 2110, Winnipeg, MB, R2H 0H7, CA49.888861 97.119735

Bill Larson Library (Grace Hospital)Borrow it300 Booth Drive, G227, Winnipeg, MB, R3J 3M7, CA49.882400 97.276436

Carolyn Sifton  Helene Fuld Library (St. Boniface General Hospital)Borrow it409 Tache Avenue, Winnipeg, MB, R2H 2A6, CA49.883388 97.126050

Concordia Hospital LibraryBorrow it1095 Concordia Avenue, Winnipeg, MB, R2K 3S8, CA49.913252 97.064683

Donald W. Craik Engineering LibraryBorrow it75B Chancellors Circle (Engineering Building E3), Room 361, Winnipeg, MB, R3T 2N2, CA49.809053 97.133292


EckhardtGramatté Music LibraryBorrow it136 Dafoe Road (Taché Arts Complex), Room 257, Winnipeg, MB, R3T 2N2, CA49.807964 97.132222

Elizabeth Dafoe LibraryBorrow it25 Chancellors Circle, Winnipeg, MB, R3T 2N2, CA49.809961 97.131878

Fr. H. Drake Library (St. Paul's College)Borrow it70 Dysart Road, Winnipeg, MB, R3T 2M6, CA49.810605 97.138184

J.W. Crane Memorial Library (Deer Lodge Centre)Borrow it2109 Portage Avenue, Winnipeg, MB, R3J 0L3, CA49.878000 97.235520

Libraries Annex (not open to the public; please see web page for details)Borrow it25 Chancellors Circle (in the Elizabeth Dafoe Library), Winnipeg, MB, R3T 2N2, CA49.809961 97.131878

Neil John Maclean Health Sciences LibraryBorrow it727 McDermot Avenue (Brodie Centre), 200 Level, Winnipeg, MB, R3E 3P5, CA49.903563 97.160554

Sciences and Technology LibraryBorrow it186 Dysart Road, Winnipeg, MB, R3T 2M8, CA49.811526 97.133257

Seven Oaks General Hospital LibraryBorrow it2300 McPhillips Street, Winnipeg, MB, R2V 3M3, CA49.955177 97.148865

Sister St. Odilon Library (Misericordia Health Centre)Borrow it99 Cornish Avenue, Winnipeg, MB, R3C 1A2, CA49.879592 97.160425


Victoria General Hospital LibraryBorrow it2340 Pembina Highway, Winnipeg, MB, R3T 2E8, CA49.806755 97.152739

William R Newman Library (Agriculture)Borrow it66 Dafoe Road, Winnipeg, MB, R3T 2R3, CA49.806936 97.135525
Library Links
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.lib.umanitoba.ca/portal/AutomataLanguagesandProgramming42nd/iu4Mj7_x8A/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.lib.umanitoba.ca/portal/AutomataLanguagesandProgramming42nd/iu4Mj7_x8A/">Automata, Languages, and Programming : 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 610, 2015, Proceedings, Part I, edited by Magnús M. Halldórsson, Kazuo Iwama, Naoki Kobayashi, Bettina Speckmann, (electronic resource)</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.lib.umanitoba.ca/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.lib.umanitoba.ca/">University of Manitoba 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 : 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 610, 2015, Proceedings, Part I, edited by Magnús M. Halldórsson, Kazuo Iwama, Naoki Kobayashi, Bettina Speckmann, (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.lib.umanitoba.ca/portal/AutomataLanguagesandProgramming42nd/iu4Mj7_x8A/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.lib.umanitoba.ca/portal/AutomataLanguagesandProgramming42nd/iu4Mj7_x8A/">Automata, Languages, and Programming : 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 610, 2015, Proceedings, Part I, edited by Magnús M. Halldórsson, Kazuo Iwama, Naoki Kobayashi, Bettina Speckmann, (electronic resource)</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.lib.umanitoba.ca/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.lib.umanitoba.ca/">University of Manitoba Libraries</a></span></span></span></span></div>