| 000 | 04510nam a22005415i 4500 | ||
|---|---|---|---|
| 001 | 978-3-540-46691-8 | ||
| 003 | DE-He213 | ||
| 005 | 20160624102017.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 121227s1999 gw | s |||| 0|eng d | ||
| 020 |
_a9783540466918 _9978-3-540-46691-8 |
||
| 024 | 7 |
_a10.1007/3-540-46691-6 _2doi |
|
| 050 | 4 | _aQA75.5-76.95 | |
| 072 | 7 |
_aUY _2bicssc |
|
| 072 | 7 |
_aUYA _2bicssc |
|
| 072 | 7 |
_aCOM014000 _2bisacsh |
|
| 072 | 7 |
_aCOM031000 _2bisacsh |
|
| 082 | 0 | 4 |
_a004.0151 _223 |
| 245 | 1 | 0 |
_aFoundations of Software Technology and Theoretical Computer Science _h[electronic resource] : _b19th Conference Chennai, India, December 13-15, 1999 Proceedings / _cedited by C. Pandu Rangan, V. Raman, R. Ramanujam. |
| 260 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1999. |
|
| 264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1999. |
|
| 300 |
_aXII, 460 p. _bonline resource. |
||
| 336 |
_atext _btxt _2rdacontent |
||
| 337 |
_acomputer _bc _2rdamedia |
||
| 338 |
_aonline resource _bcr _2rdacarrier |
||
| 347 |
_atext file _bPDF _2rda |
||
| 490 | 1 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v1738 |
|
| 505 | 0 | _aInvited Talk 1 -- Recent Developments in the Theory of Arrangements of Surfaces -- Session 1(a) -- Dynamic Compressed Hyperoctrees with Application to the N-body Problem -- Largest Empty Rectangle among a Point Set -- Session 1(b) -- Renaming Is Necessary in Timed Regular Expressions -- Product Interval Automata: A Subclass of Timed Automata -- Session 2(a) -- The Complexity of Rebalancing a Binary Search Tree -- Fast Allocation and Deallocation with an Improved Buddy System -- Session 2(b) -- Optimal Bounds for Transformations of ?-Automata -- CTL+ Is Exponentially More Succinct than CTL -- Invited Talk 2 -- A Top-Down Look at a Secure Message -- Session 3 -- Explaining Updates by Minimal Sums -- A Foundation for Hybrid Knowledge Bases -- Session 4 -- Hoare Logic for Mutual Recursion and Local Variables -- Invited Talk 3 -- Explicit Substitutions and Programming Languages -- Session 5(a) -- Approximation Algorithms for Routing and Call Scheduling in All-Optical Chains and Rings -- A Randomized Algorithm for Flow Shop Scheduling -- Session 5(b) -- Synthesizing Distributed Transition Systems from Global Specifications -- Beyond Region Graphs: Symbolic Forward Analysis of Timed Automata -- Session 6 -- Implicit Temporal Query Languages: Towards Completeness -- On the Undecidability of Some Sub-classical First-Order Logics -- Invited Talk 4 -- How to Compute with DNA -- Session 7(a) -- A High Girth Graph Construction and a Lower Bound for Hitting Set Size for Combinatorial Rectangles -- Protecting Facets in Layered Manufacturing -- Session 7(b) -- The Receptive Distributed ?-Calculus -- Series and Parallel Operations on Pomsets -- Session 8 -- Unreliable Failure Detectors with Limited Scope Accuracy and an Application to Consensus -- Invited Talk 5 -- Graph Isomorphism: Its Complexity and Algorithms -- Session 9(a) -- Computing with Restricted Nondeterminism: The Dependence of the OBDD Size on the Number of Nondeterministic Variables -- Lower Bounds for Linear Transformed OBDDs and FBDDs -- Session 9(b) -- A Unifying Framework for Model Checking Labeled Kripke Structures, Modal Transition Systems, and Interval Transition Systems -- Graded Modalities and Resource Bisimulation -- Session 10(a) -- The Non-recursive Power of Erroneous Computation -- Analysis of Quantum Functions -- Session 10(b) -- On Sets Growing Continuously -- Model Checking Knowledge and Time in Systems with Perfect Recall -- FST&TCS — ISAAC Joint Session Talks -- The Engineering of Some Bipartite Matching Programs. | |
| 650 | 0 | _aComputer science. | |
| 650 | 0 | _aSoftware engineering. | |
| 650 | 0 | _aInformation theory. | |
| 650 | 0 | _aComputational complexity. | |
| 650 | 1 | 4 | _aComputer Science. |
| 650 | 2 | 4 | _aTheory of Computation. |
| 650 | 2 | 4 | _aSoftware Engineering/Programming and Operating Systems. |
| 650 | 2 | 4 | _aDiscrete Mathematics in Computer Science. |
| 700 | 1 |
_aRangan, C. Pandu. _eeditor. |
|
| 700 | 1 |
_aRaman, V. _eeditor. |
|
| 700 | 1 |
_aRamanujam, R. _eeditor. |
|
| 710 | 2 | _aSpringerLink (Online service) | |
| 773 | 0 | _tSpringer eBooks | |
| 776 | 0 | 8 |
_iPrinted edition: _z9783540668367 |
| 786 | _dSpringer | ||
| 830 | 0 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v1738 |
|
| 856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/3-540-46691-6 |
| 942 |
_2EBK5866 _cEBK |
||
| 999 |
_c35160 _d35160 |
||