| 000 | 05359nam a22005295i 4500 | ||
|---|---|---|---|
| 001 | 978-3-540-49116-3 | ||
| 003 | DE-He213 | ||
| 005 | 20160624102039.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 121227s1999 gw | s |||| 0|eng d | ||
| 020 |
_a9783540491163 _9978-3-540-49116-3 |
||
| 024 | 7 |
_a10.1007/3-540-49116-3 _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 |
_aSTACS 99 _h[electronic resource] : _b16th Annual Symposium on Theoretical Aspects of Computer Science Trier, Germany, March 4–6, 1999 Proceedings / _cedited by Christoph Meinel, Sophie Tison. |
| 260 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1999. |
|
| 264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1999. |
|
| 300 |
_aXIV, 590 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 ; _v1563 |
|
| 505 | 0 | _aInvited Talks -- Algorithms for Selfish Agents -- The Reduced Genus of a Multigraph -- Classifying Discrete Temporal Properties -- Complexity 1 -- Circuit Complexity of Testing Square-Free Numbers -- Relating Branching Program Size and Formula Size over the Full Binary Basis -- Theory of Parallel Algorithms 1 -- Memory Organization Schemes for Large Shared Data: A Randomized Solution for Distributed Memory Machines -- The Average Time Complexity to Compute Prefix Functions in Processor Networks -- Complexity 2 -- On the Hardness of Permanent -- One-Sided Versus Two-Sided Error in Probabilistic Computation -- Computational Geometry -- An Optimal Competitive Strategy for Walking in Streets -- An Optimal Strategy for Searching in Unknown Streets -- Parallel Searching on m Rays -- Complexity 3 -- A Logical Characterisation of Linear Time on Nondeterministic Turing Machines -- Descriptive Complexity of Computable Sequences -- Complexity of Some Problems in Universal Algebra -- Algorithms and Data Structures 1 -- New Branchwidth Territories -- Balanced Randomized Tree Splitting with Applications to Evolutionary Tree Constructions -- Treewidth and Minimum Fill-In of Weakly Triangulated Graphs -- Automata and Formal Languages -- Decidability and Undecidability of Marked PCP -- On Quadratic Word Equations -- Some Undecidability Results Related to the Star Problem in Trace Monoids -- Algorithms and Data Structures 2 -- An Approximation Algorithm for Max p-Section -- Approximating Bandwidth by Mixing Layouts of Interval Graphs -- Linear Time 1/2-Approximation Algorithm for Maximum Weighted Matching in General Graphs -- Complexity 4 -- Extending Downward Collapse from 1-versus-2 Queries to j-versus-j + 1 Queries -- Sparse Sets, Approximable Sets, and Parallel Queries to NP -- Algorithms and Data Structures 3 -- External Selection -- Fast Computations of the Exponential Function -- Verification -- A Model of Behaviour Abstraction for Communicating Processes -- Model Checking Lossy Vector Addition Systems -- Algorithms and Data Structures 4 -- Constructing Light Spanning Trees with Small Routing Cost -- Finding Paths with the Right Cost -- Complexity 5 -- In How Many Steps the k Peg Version of the Towers of Hanoi Game Can Be Solved? -- Lower Bounds for Dynamic Algebraic Problems -- An Explicit Lower Bound for TSP with Distances One and Two -- Theory of Parallel Algorithms 2 -- Scheduling Dynamic Graphs -- Supporting Increment and Decrement Operations in Balancing Networks -- Worst-Case Equilibria -- Algorithmic Learning -- A Complete and Tight Average-Case Analysis of Learning Monomials -- Costs of General Purpose Learning -- Universal Distributions and Time-Bounded Kolmogorov Complexity -- Logic in Computer Science -- The Descriptive Complexity Approach to LOGCFL -- The Weakness of Self-Complementation -- On the Difference of Horn Theories -- Complexity 6 -- On Quantum Algorithms for Noncommutative Hidden Subgroups -- On the Size of Randomized OBDDs and Read-Once Branching Programs for k-Stable Functions -- How To Forget a Secret -- Logic in Computer Science 2 -- A Modal Fixpoint Logic with Chop -- Completeness of Neighbourhood Logic -- Eliminating Recursion in the ?-Calculus -- Complexity 7 -- On Optimal Algorithms and Optimal Proof Systems -- Space Bounds for Resolution -- Algorithms and Data Structures 5 -- Upper Bounds for Vertex Cover Further Improved -- Online Matching for Scheduling Problems. | |
| 650 | 0 | _aComputer science. | |
| 650 | 0 | _aData structures (Computer science). | |
| 650 | 0 | _aInformation theory. | |
| 650 | 1 | 4 | _aComputer Science. |
| 650 | 2 | 4 | _aTheory of Computation. |
| 650 | 2 | 4 | _aMathematics of Computing. |
| 650 | 2 | 4 | _aData Structures. |
| 650 | 2 | 4 | _aProgramming Languages, Compilers, Interpreters. |
| 700 | 1 |
_aMeinel, Christoph. _eeditor. |
|
| 700 | 1 |
_aTison, Sophie. _eeditor. |
|
| 710 | 2 | _aSpringerLink (Online service) | |
| 773 | 0 | _tSpringer eBooks | |
| 776 | 0 | 8 |
_iPrinted edition: _z9783540656913 |
| 786 | _dSpringer | ||
| 830 | 0 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v1563 |
|
| 856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/3-540-49116-3 |
| 942 |
_2EBK6668 _cEBK |
||
| 999 |
_c35962 _d35962 |
||