LEADER 08837nam 22007575 450 001 996465891203316 005 20200704040913.0 010 $a3-540-48224-5 024 7 $a10.1007/3-540-48224-5 035 $a(CKB)1000000000211429 035 $a(SSID)ssj0000321497 035 $a(PQKBManifestationID)11255095 035 $a(PQKBTitleCode)TC0000321497 035 $a(PQKBWorkID)10263277 035 $a(PQKB)10422033 035 $a(DE-He213)978-3-540-48224-6 035 $a(MiAaPQ)EBC3073138 035 $a(PPN)155202774 035 $a(EXLCZ)991000000000211429 100 $a20121227d2001 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aAutomata, Languages and Programming$b[electronic resource] $e28th International Colloquium, ICALP 2001 Crete, Greece, July 8?12, 2001 Proceedings /$fedited by Fernando Orejas, Paul G. Spirakis, Jan van Leeuwen 205 $a1st ed. 2001. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2001. 215 $a1 online resource (XIV, 1086 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v2076 300 $aIncludes index. 311 $a3-540-42287-0 327 $aKeynote Papers -- Algorithms, Games, and the Internet -- Automata, Circuits, and Hybrids: Facets of Continuous Time -- Invited Papers -- Languages, Rewriting Systems, and Verification of Infinite-State 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 Low-Discrepancy Roundings of a Real Sequence -- All-Pairs 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 k-Median, k-Center, and Facility Location for Sparse Graphs -- Complexity -- Parameterized Complexity: Exponential Speed-Up for Planar Graph Problems -- Subexponential Parameterized Algorithms Collapse the W-Hierarchy -- Improved Lower Bounds on the Randomized Complexity of Graph Properties -- New Imperfect Random Source with Applications to Coin-Flipping -- Recognizing More Unsatisfiable Random 3-SAT Instances Efficiently -- Weisfeiler-Lehman 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 -- Visibility-Based Pursuit-Evasion 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 All-Optical 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 Three-Interval 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 Tail-Biting 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 Ping-Pong Protocols -- Fair Simulation Relations, Parity Games, and State Space Reduction for Büchi Automata -- Hypergraphs in Model Checking: Acyclicity and Hypertree-Width versus Clique-Width -- From Finite State Communication Protocols to High-Level Message Sequence Charts -- Networks and Routing -- Fractional Path Coloring with Applications to WDM Networks -- Performance Aspects of Distributed Caches Using TTL-Based 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 Set-Theoretic Framework for Assume-Guarantee 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 Multi-party Contract Signing with Reduced Number of Rounds -- Information-Theoretic 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 -- Knuth-Bendix Constraint Solving Is NP-Complete -- Amalgamation in CASL via Enriched Signatures -- Structural Complexity -- Lower Bounds for the Weak Pigeonhole Principle Beyond Resolution -- Time and Space Bounds for Reversible Simulation -- Finite-State Dimension -- The Complexity of Computing the Size of an Interval -- Communication Gap for Finite Memory Devices -- Separating Quantum and Classical Learning. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v2076 606 $aSoftware engineering 606 $aComputers 606 $aComputer communication systems 606 $aComputer science?Mathematics 606 $aComputer graphics 606 $aCombinatorics 606 $aSoftware Engineering/Programming and Operating Systems$3https://scigraph.springernature.com/ontologies/product-market-codes/I14002 606 $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005 606 $aComputer Communication Networks$3https://scigraph.springernature.com/ontologies/product-market-codes/I13022 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 606 $aCombinatorics$3https://scigraph.springernature.com/ontologies/product-market-codes/M29010 615 0$aSoftware engineering. 615 0$aComputers. 615 0$aComputer communication systems. 615 0$aComputer science?Mathematics. 615 0$aComputer graphics. 615 0$aCombinatorics. 615 14$aSoftware Engineering/Programming and Operating Systems. 615 24$aTheory of Computation. 615 24$aComputer Communication Networks. 615 24$aMathematics of Computing. 615 24$aComputer Graphics. 615 24$aCombinatorics. 676 $a005.1 702 $aOrejas$b Fernando$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aSpirakis$b Paul G$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aLeeuwen$b Jan van$4edt$4http://id.loc.gov/vocabulary/relators/edt 906 $aBOOK 912 $a996465891203316 996 $aAutomata, languages and programming$9339738 997 $aUNISA LEADER 00898nam a2200265 i 4500 001 991001400049707536 005 20020507125357.0 008 011107s1984 it ||| | ita 020 $a8834805909 035 $ab10215347-39ule_inst 035 $aLE02985229$9ExL 040 $aISUFI - Sett. Diritti e Politiche Euromediterranee$bita 082 0 $a510 100 1 $aGuerraggio, Angelo$039397 245 10$aEsercizi di matematica /$cA. Guerraggio 250 $a2nd ed. 260 $aTorino :$bG. Giappichelli,$c1984 300 $a366 p. ;$c24 cm 650 4$aMatematica - esercizi 907 $a.b10215347$b04-10-06$c27-06-02 912 $a991001400049707536 945 $aLE029 510 GUE01.01$g1$iLE029-3063$lle029$o-$pE0.00$q-$rn$so $t0$u0$v0$w0$x0$y.i10264139$z27-06-02 996 $aEsercizi di matematica$9196551 997 $aUNISALENTO 998 $ale029$b01-01-01$cm$da $e-$fita$git $h0$i1 LEADER 01397nas 2200433- 450 001 996404439103316 005 20230123213018.0 011 $a2450-2758 035 $a(DE-599)ZDB2841470-6 035 $a(OCoLC)1004378961 035 $a(CKB)3710000000470342 035 $a(CONSER)--2021233735 035 $a(EXLCZ)993710000000470342 100 $a20170619a20149999 o-- - 101 0 $apol 135 $aur||||||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 00$aForum lingwistyczne 210 1$aKatowice, Polska :$cInstytut J?zyka Polskiego, Uniwersytetu ?l?skiego w Katowicach,$d[2014]- 215 $a1 online resource 300 $aRefereed/Peer-reviewed 311 $a2449-9587 330 $aEmpirical and theoretical research concerning all language and linguistic phenomena. 606 $aPolish language$vPeriodicals 606 $aLinguistics$vPeriodicals 606 $aLinguistics$2fast$3(OCoLC)fst00999202 606 $aPolish language$2fast$3(OCoLC)fst01068925 608 $aPeriodicals.$2fast 615 0$aPolish language 615 0$aLinguistics 615 7$aLinguistics. 615 7$aPolish language. 712 02$aUniwersytet ?l?ski w Katowicach.$bInstytut J?zyka Polskiego, 906 $aJOURNAL 912 $a996404439103316 996 $aForum lingwistyczne$92578545 997 $aUNISA