LEADER 02132oam 2200589 450 001 9910708607103321 005 20180514152316.0 035 $a(CKB)5470000002471160 035 $a(OCoLC)896811471 035 $a(EXLCZ)995470000002471160 100 $a20141123d1987 ua 0 101 0 $aeng 135 $aurn|||||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aNew interpretations of Paleozoic stratigraphy and history in the northern Laramie Range and vicinity, southeast Wyoming /$fby William J. Sando and Charles A. Sandberg 210 1$aWashington :$cUnited States Government Printing Office,$d1987. 215 $a1 online resource (iv, 39 pages) $cillustrations, maps 225 1 $aU.S. Geological Survey professional paper ;$v1450 300 $a"A revision of Paleozoic stratigraphy based on biostratigraphic analysis." 320 $aIncludes bibliographical references (pages 37-39). 606 $aGeology, Stratigraphic$yPaleozoic 606 $aPaleontology$yPaleozoic 606 $aGeology$zLaramie Mountains (Wyo. and Colo.) 606 $aPaleontology$zLaramie Mountains (Wyo. and Colo.) 606 $aGeology$2fast 606 $aGeology, Stratigraphic$2fast 606 $aPaleontology$2fast 606 $aPaleozoic Geologic Period$2fast 607 $aUnited States$zLaramie Mountains$2fast 615 0$aGeology, Stratigraphic 615 0$aPaleontology 615 0$aGeology 615 0$aPaleontology 615 7$aGeology. 615 7$aGeology, Stratigraphic. 615 7$aPaleontology. 615 7$aPaleozoic Geologic Period. 700 $aSando$b William Jasper$01388705 702 $aSandberg$b Charles A$g(Charles Albert),$f1929- 712 02$aGeological Survey (U.S.), 801 0$bCOP 801 1$bCOP 801 2$bOCLCO 801 2$bOCLCF 801 2$bCUS 801 2$bGPO 906 $aBOOK 912 $a9910708607103321 996 $aNew interpretations of Paleozoic stratigraphy and history in the northern Laramie Range and vicinity, southeast Wyoming$93465104 997 $aUNINA LEADER 09589nam 22008775 450 001 9910143899903321 005 20251116234306.0 010 $a3-540-45465-9 024 7 $a10.1007/3-540-45465-9 035 $a(CKB)1000000000211783 035 $a(SSID)ssj0000321498 035 $a(PQKBManifestationID)11227081 035 $a(PQKBTitleCode)TC0000321498 035 $a(PQKBWorkID)10279574 035 $a(PQKB)10551590 035 $a(DE-He213)978-3-540-45465-6 035 $a(MiAaPQ)EBC3072620 035 $a(PPN)155223275 035 $a(BIP)13638535 035 $a(BIP)7980155 035 $a(EXLCZ)991000000000211783 100 $a20121227d2002 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aAutomata, Languages and Programming $e29th International Colloquium, ICALP 2002, Malaga, Spain, July 8-13, 2002. Proceedings /$fedited by Peter Widmayer, Francisco Triguero, Rafael Morales, Matthew Hennessy, Stephan Eidenbenz, Ricardo Conejo 205 $a1st ed. 2002. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2002. 215 $a1 online resource (XLII, 1072 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v2380 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$a3-540-43864-5 320 $aIncludes bibliographical references at the end of each chapters and index. 327 $aInvited Talks -- Molecular Assembly and Computation: From Theory to Experimental Demonstrations -- Towards a Predictive Computational Complexity Theory -- Equivariant Syntax and Semantics -- L(A) = L(B)? Decidability Results from Complete Formal Systems -- Discrete Tomography: Reconstruction under Periodicity Constraints -- Local and Global Methods in Data Mining: Basic Techniques and Open Problems -- Program Debugging and Validation Using Semantic Approximations and Partial Specifications -- Best Papers -- Inapproximability Results for Equations over Finite Groups -- A Faster All-Pairs Shortest Path Algorithm for Real-Weighted Sparse Graphs -- On Families of Graphs Having a Decidable First Order Theory with Reachability -- Contributions -- Heuristically Optimized Trade-Offs: A New Paradigm for Power Laws in the Internet -- The Structure and Complexity of Nash Equilibria for a Selfish Routing Game -- Control Message Aggregation in Group Communication Protocols -- Church-Rosser Languages vs. UCFL -- Intersection of Regular Languages and Star Hierarchy -- On the Construction of Reversible Automata for Reversible Languages -- Priority Queues, Pairing, and Adaptive Sorting -- Exponential Structures for Efficient Cache-Oblivious Algorithms -- Bounded-Depth Frege Systems with Counting Axioms Polynomially Simulate Nullstellensatz Refutations -- On the Complexity of Resolution with Bounded Conjunctions -- Cryptographic Hardness Based on the Decoding of Reed-Solomon Codes -- Perfect Constant-Round Secure Computation via Perfect Randomizing Polynomials -- Exponential Lower Bound for Static Semi-algebraic Proofs -- Paths Problems in Symmetric Logarithmic Space -- Scheduling Search Procedures -- Removable Online Knapsack Problems -- New Bounds for Variable-Sized and Resource Augmented Online Bin Packing -- The Quest for Small Universal Cellular Automata -- Hyperbolic Recognition by Graph Automata -- Quantum and Stochastic Branching Programs of Bounded Width -- Spanning Trees with Bounded Number of Branch Vertices -- Energy Optimal Routing in Radio Networks Using Geometric Data Structures -- Gossiping with Bounded Size Messages in ad hoc Radio Networks -- The Kolmogorov-Loveland Stochastic Sequences Are Not Closed under Selecting Subsequences -- The Nondeterministic Constraint Logic Model of Computation: Reductions and Applications -- Constraint Satisfaction Problems in Non-deterministic Logarithmic Space -- Cache Oblivious Distribution Sweeping -- One-Probe Search -- New Algorithms for Subset Query, Partial Match, Orthogonal Range Searching, and Related Problems -- Measuring the Probabilistic Powerdomain -- Games Characterizing Levy-Longo Trees -- Comparing Functional Paradigms for Exact Real-Number Computation -- Random Sampling from Boltzmann Principles -- On the Average Performance of Orthogonal Range Search in Multidimensional Data Structures -- Bialgebraic Modelling of Timed Processes -- Testing Labelled Markov Processes -- Why Computational Complexity Requires Stricter Martingales -- Correspondence Principles for Effective Dimensions -- A Total Approach to Partial Algebraic Specification -- Axiomatising Divergence -- A Spatial Logic for Querying Graphs -- Improving Time Bounds on Maximum Generalised Flow Computations by Contracting the Network -- Approximation Hardness of Bounded Degree MIN-CSP and MIN-BISECTION -- Improved Bounds and New Trade-Offs for Dynamic All Pairs Shortest Paths -- Synthesis of Uninitialized Systems -- Infinite-State High-Level MSCs: Model-Checking and Realizability -- Universal Inherence of Cycle-Free Context-Free Ambiguity Functions -- Histogramming Data Streams with Fast Per-Item Processing -- Finding Frequent Items in Data Streams -- Symbolic Strategy Synthesis for Games on Pushdown Graphs -- Strong Bisimilarity and Regularity of Basic Process Algebra Is PSPACE-Hard -- Solving the String Statistics Problem in Time (nlogn) -- A PTAS for Distinguishing (Sub)string Selection -- On the Theory of One-Step Rewriting in Trace Monoids -- Navigating with a Browser -- Improved Results for Stackelberg Scheduling Strategies -- Call Control in Rings -- Preemptive Scheduling in Overloaded Systems -- The Equivalence Problem of Finite Substitutions on ab*c, with Applications -- Deciding DPDA Equivalence Is Primitive Recursive -- Two-Way Alternating Automata and Finite Models -- Approximating Huffman Codes in Parallel -- Seamless Integration of Parallelism and Memory Hierarchy -- The Communication Complexity of Approximate Set Packing and Covering -- Antirandomizing the Wrong Game -- Fast Universalization of Investment Strategies with Provably Good Relative Returns -- Randomized Pursuit-Evasion in Graphs -- The Essence of Principal Typings -- Complete and Tractable Local Linear Time Temporal Logics over Traces -- An Elementary Expressively Complete Temporal Logic for Mazurkiewicz Traces -- Random Numbers and an Incomplete Immune Recursive Set -- A Banach-Mazur Computable But Not Markov Computable Function on the Computable Real Numbers -- Polynomial-Time Approximation Schemes for the Euclidean Survivable Network Design Problem -- Finding a Path of Superlogarithmic Length -- Linear Time Algorithms on Chordal Bipartite and Strongly Chordal Graphs -- Improved Inapproximability Results for Vertex Cover on k-Uniform Hypergraphs -- Efficient Testing of Hypergraphs -- Optimal Net Surface Problems with Applications -- Wagner?s Theorem on Realizers -- Circular Arrangements. 330 $aThis book constitutes the refereed proceedings of the 29th International Colloquium on Automata, Languages and Programming, ICALP 2002, held in Malaga, Spain, in July 2002.The 83 revised full papers presented together with 7 invited papers were carefully reviewed and selected from a total of 269 submissions. All current aspects of theoretical computer science are addressed and major new results are presented. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v2380 606 $aArtificial intelligence 606 $aSoftware engineering 606 $aAutomatic control 606 $aComputers 606 $aComputer science?Mathematics 606 $aComputer graphics 606 $aArtificial Intelligence$3https://scigraph.springernature.com/ontologies/product-market-codes/I21000 606 $aSoftware Engineering/Programming and Operating Systems$3https://scigraph.springernature.com/ontologies/product-market-codes/I14002 606 $aControl and Systems Theory$3https://scigraph.springernature.com/ontologies/product-market-codes/T19010 606 $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005 606 $aMathematics of Computing$3https://scigraph.springernature.com/ontologies/product-market-codes/I17001 606 $aComputer Graphics$3https://scigraph.springernature.com/ontologies/product-market-codes/I22013 615 0$aArtificial intelligence. 615 0$aSoftware engineering. 615 0$aAutomatic control. 615 0$aComputers. 615 0$aComputer science?Mathematics. 615 0$aComputer graphics. 615 14$aArtificial Intelligence. 615 24$aSoftware Engineering/Programming and Operating Systems. 615 24$aControl and Systems Theory. 615 24$aTheory of Computation. 615 24$aMathematics of Computing. 615 24$aComputer Graphics. 676 $a511.3 702 $aWidmayer$b Peter$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aTriguero$b Francisco$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aMorales$b Rafael$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aHennessy$b Matthew$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aEidenbenz$b Stephan$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aConejo$b Ricardo$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910143899903321 996 $aAutomata, languages and programming$9339738 997 $aUNINA