|
|
|
|
| LEADER |
00000nam a22000005i 4500 |
| 001 |
b3333854 |
| 003 |
MWH |
| 005 |
20191027121525.0 |
| 007 |
cr nn 008mamaa |
| 008 |
100301s2007 gw | s |||| 0|eng d |
| 020 |
|
|
|a 9783540734208
|
| 024 |
7 |
|
|a 10.1007/978-3-540-73420-8
|2 doi
|
| 035 |
|
|
|a (DE-He213)978-3-540-73420-8
|
| 050 |
|
4 |
|a E-Book
|
| 072 |
|
7 |
|a UMZ
|2 bicssc
|
| 072 |
|
7 |
|a COM051230
|2 bisacsh
|
| 072 |
|
7 |
|a UMZ
|2 thema
|
| 072 |
|
7 |
|a UL
|2 thema
|
| 245 |
1 |
0 |
|a Automata, Languages and Programming
|h [electronic resource] :
|b 34th International Colloquium, ICALP 2007, Wroclaw, Poland, July 9-13, 2007, Proceedings /
|c edited by Lars Arge, Christian Cachin, Tomasz Jurdzinski.
|
| 250 |
|
|
|a 1st ed. 2007.
|
| 264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg :
|b Imprint: Springer,
|c 2007.
|
| 300 |
|
|
|a XVII, 958 p.
|b online resource.
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a computer
|b c
|2 rdamedia
|
| 338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
| 347 |
|
|
|a text file
|b PDF
|2 rda
|
| 490 |
1 |
|
|a Theoretical Computer Science and General Issues ;
|v 4596
|
| 490 |
1 |
|
|a Springer eBook Collection
|
| 505 |
0 |
|
|a Invited Lectures -- Ushering in a New Era of Algorithm Design -- A “proof-reading” of Some Issues in Cryptography -- Credentials-Based Authorization: Evaluation and Implementation -- Subexponential Parameterized Algorithms -- Session A1 -- Competitive Algorithms for Due Date Scheduling -- Mechanism Design for Fractional Scheduling on Unrelated Machines -- Session A2 -- Estimating Sum by Weighted Sampling -- Sampling Methods for Shortest Vectors, Closest Vectors and Successive Minima -- Session A3 -- Low Distortion Spanners -- Minimum Weight 2-Edge-Connected Spanning Subgraphs in Planar Graphs -- Labeling Schemes for Vertex Connectivity -- Session A4 -- Unbounded-Error One-Way Classical and Quantum Communication Complexity -- A Lower Bound on Entanglement-Assisted Quantum Communication Complexity -- Separating Deterministic from Nondeterministic NOF Multiparty Communication Complexity -- Session A5 -- An Optimal Decomposition Algorithm for Tree Edit Distance -- On Commutativity Based Edge Lean Search -- Commitment Under Uncertainty: Two-Stage Stochastic Matching Problems -- Session A6 -- On the Complexity of Hard-Core Set Constructions -- Approximation by DNF: Examples and Counterexamples -- Exotic Quantifiers, Complexity Classes, and Complete Problems -- Session A7 -- Online Conflict-Free Colorings for Hypergraphs -- Distributed Computing with Advice: Information Sensitivity of Graph Coloring -- Session C1 -- Private Multiparty Sampling and Approximation of Vector Combinations -- Constant-Round Private Database Queries -- Session A8 -- Universal Algebra and Hardness Results for Constraint Satisfaction Problems -- On the Power of k-Consistency -- Complexity of Propositional Proofs Under a Promise -- Session C2 -- Deterministic History-Independent Strategies for Storing Information on Write-Once Memories -- Trading Static for Adaptive Security in Universally Composable Zero-Knowledge -- A Characterization of Non-interactive Instance-Dependent Commitment-Schemes (NIC) -- Session A9 -- Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs -- Parameterized Algorithms for Directed Maximum Leaf Problems -- Parameterized Approximability of the Disjoint Cycle Problem -- Linear Problem Kernels for NP-Hard Problems on Planar Graphs -- Session C3 -- Private Locally Decodable Codes -- Hash Functions in the Dedicated-Key Setting: Design Choices and MPP Transforms -- Unrestricted Aggregate Signatures -- Ring Signatures of Sub-linear Size Without Random Oracles -- Session A10 -- Balanced Families of Perfect Hash Functions and Their Applications -- An Exponential Improvement on the MST Heuristic for Minimum Energy Broadcasting in Ad Hoc Wireless Networks -- Session B1 -- Modular Algorithms for Heterogeneous Modal Logics -- Co-Logic Programming: Extending Logic Programming with Coinduction -- Session C4 -- Offline/Online Mixing -- Fully Collusion Resistant Black-Box Traitor Revocable Broadcast Encryption with Short Private Keys -- Session A11 -- Succinct Ordinal Trees Based on Tree Covering -- A Framework for Dynamizing Succinct Data Structures -- In-Place Suffix Sorting -- Session B2 -- Maximal Infinite-Valued Constraint Languages -- Affine Systems of Equations and Counting Infinitary Logic -- Boundedness of Monadic FO over Acyclic Structures -- Session A12 -- Strong Price of Anarchy for Machine Load Balancing -- Efficient Algorithms for Constant Well Supported Approximate Equilibria in Bimatrix Games -- Session B3 -- Equational Systems and Free Constructions (Extended Abstract) -- Categorical Views on Computations on Trees (Extended Abstract) -- Session A13 -- Holographic Algorithms: The Power of Dimensionality Resolved -- Reconciling Data Compression and Kolmogorov Complexity -- Size Competitive Meshing Without Large Angles -- Session B4 -- A Fully Abstract Trace Semantics for General References -- Aliased Register Allocation for Straight-Line Programs Is NP-Complete -- Conservative Ambiguity Detection in Context-Free Grammars -- Session A14 -- Lower Bounds for Quantile Estimation in Random-Order and Multi-pass Streaming -- Streaming and Fully Dynamic Centralized Algorithms for Constructing and Maintaining Sparse Spanners -- Checking and Spot-Checking the Correctness of Priority Queues -- Session B5 -- Undecidability of 2-Label BPP Equivalences and Behavioral Type Systems for the ?-Calculus -- Ready Simulation for Concurrency: It’s Logical! -- Continuous Capacities on Continuous State Spaces -- Session A15 -- On the Chromatic Number of Random Graphs -- Quasi-randomness and Algorithmic Regularity for Graphs with General Degree Distributions -- Complexity of the Cover Polynomial -- Session B6 -- A Generalization of Cobham’s Theorem to Automata over Real Numbers -- Minimum-Time Reachability in Timed Games -- Reachability-Time Games on Timed Automata -- Perfect Information Stochastic Priority Games -- Session B7 -- Bounded Depth Data Trees -- Unranked Tree Automata with Sibling Equalities and Disequalities -- Regular Languages of Nested Words: Fixed Points, Automata, and Synchronization -- A Combinatorial Theorem for Trees -- Session B8 -- Model Theory Makes Formulas Large -- Decision Problems for Lower/Upper Bound Parametric Timed Automata -- On the Complexity of Ltl Model-Checking of Recursive State Machines -- Paper Retraction -- Paper Retraction: On the Hardness of Embeddings Between Two Finite Metrics.
|
| 590 |
|
|
|a Loaded electronically.
|
| 590 |
|
|
|a Electronic access restricted to members of the Holy Cross Community.
|
| 650 |
|
0 |
|a Software engineering.
|
| 650 |
|
0 |
|a Computers.
|
| 650 |
|
0 |
|a Computer science—Mathematics.
|
| 650 |
|
0 |
|a Numerical analysis.
|
| 650 |
|
0 |
|a Data structures (Computer science).
|
| 690 |
|
|
|a Electronic resources (E-books)
|
| 700 |
1 |
|
|a Arge, Lars.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
| 700 |
1 |
|
|a Cachin, Christian.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
| 700 |
1 |
|
|a Jurdzinski, Tomasz.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 773 |
0 |
|
|t Springer eBooks
|
| 830 |
|
0 |
|a Theoretical Computer Science and General Issues ;
|v 4596
|
| 830 |
|
0 |
|a Springer eBook Collection.
|
| 856 |
4 |
0 |
|u https://holycross.idm.oclc.org/login?auth=cas&url=https://doi.org/10.1007/978-3-540-73420-8
|3 Click to view e-book
|t 0
|
| 907 |
|
|
|a .b33338541
|b 04-18-22
|c 02-26-20
|
| 998 |
|
|
|a he
|b 02-26-20
|c m
|d @
|e -
|f eng
|g gw
|h 0
|i 1
|
| 912 |
|
|
|a ZDB-2-SCS
|
| 912 |
|
|
|a ZDB-2-LNC
|
| 950 |
|
|
|a Computer Science (Springer-11645)
|
| 902 |
|
|
|a springer purchased ebooks
|
| 903 |
|
|
|a SEB-COLL
|
| 945 |
|
|
|f - -
|g 1
|h 0
|j - -
|k - -
|l he
|o -
|p $0.00
|q -
|r -
|s b
|t 38
|u 0
|v 0
|w 0
|x 0
|y .i22470165
|z 02-26-20
|
| 999 |
f |
f |
|i 9564aeb2-7bb7-5052-b023-7d8a4ffa8126
|s 8cb70a9c-5ae5-5826-bcc5-e815bf110b4b
|t 0
|
| 952 |
f |
f |
|p Online
|a College of the Holy Cross
|b Main Campus
|c E-Resources
|d Online
|t 0
|e E-Book
|h Library of Congress classification
|i Elec File
|