| 000 | 05667nam a22005415i 4500 | ||
|---|---|---|---|
| 001 | 978-3-540-36494-8 | ||
| 003 | DE-He213 | ||
| 005 | 20160624101935.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 121227s2003 gw | s |||| 0|eng d | ||
| 020 |
_a9783540364948 _9978-3-540-36494-8 |
||
| 024 | 7 |
_a10.1007/3-540-36494-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 2003 _h[electronic resource] : _b20th Annual Symposium on Theoretical Aspects of Computer Science Berlin, Germany, February 27 – March 1, 2003 Proceedings / _cedited by Helmut Alt, Michel Habib. |
| 260 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2003. |
|
| 264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2003. |
|
| 300 |
_aXVIII, 706 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 ; _v2607 |
|
| 505 | 0 | _aInvited Papers -- Logic as a Query Language: From Frege to XML -- How Does Computer Science Change Molecular Biology? -- Contributed Papers -- Improved Compact Visibility Representation of Planar Graph via Schnyder’s Realizer -- Rectangle Visibility Graphs: Characterization, Construction, and Compaction -- Approximating Geometric Bottleneck Shortest Paths -- Optimization in Arrangements -- Complete Classifications for the Communication Complexity of Regular Languages -- The Commutation with Codes and Ternary Sets of Words -- On the Confluence of Linear Shallow Term Rewrite Systems -- Wadge Degrees of ?-Languages of Deterministic Turing Machines -- Faster Deterministic Broadcasting in Ad Hoc Radio Networks -- Private Computations in Networks: Topology versus Randomness -- On Shortest-Path All-Optical Networks without Wavelength Conversion Requirements -- Lattice Reduction by Random Sampling and Birthday Methods -- On the Ultimate Complexity of Factorials -- On the Effective Jordan Decomposability -- Fast Algorithms for Extended Regular Expression Matching and Searching -- Algorithms for Transposition Invariant String Matching (Extended Abstract) -- On the Complexity of Finding a Local Maximum of Functions on Discrete Planar Subsets -- Some Results on Derandomization -- On the Representation of Boolean Predicates of the Diffie-Hellman Function -- Quantum Circuits with Unbounded Fan-out -- Analysis of the Harmonic Algorithm for Three Servers -- Non-clairvoyant Scheduling for Minimizing Mean Slowdown -- Space Efficient Hash Tables with Worst Case Constant Access Time -- Randomized Jumplists: A Jump-and-Walk Dictionary Data Structure -- Complexity Theoretical Results on Nondeterministic Graph-Driven Read-Once Branching Programs -- Randomness versus Nondeterminism for Read-Once and Read-k Branching Programs -- Branch-Width, Parse Trees, and Monadic Second-Order Logic for Matroids -- Algebraic Characterizations of Small Classes of Boolean Functions -- On the Difficulty of Some Shortest Path Problems -- Representing Graph Metrics with Fewest Edges -- Computing Shortest Paths with Uncertainty -- Solving Order Constraints in Logarithmic Space -- The Inversion Problem for Computable Linear Operators -- Algebras of Minimal Rank over Arbitrary Fields -- Evolutionary Algorithms and the Maximum Matching Problem -- Alternative Algorithms for Counting All Matchings in Graphs -- Strong Stability in the Hospitals/Residents Problem -- The Inference Problem for Propositional Circumscription of Afine Formulas Is coNP-Complete -- Decidable Theories of Cayley-Graphs -- The Complexity of Resolution with Generalized Symmetry Rules -- Colouring Random Graphs in Expected Polynomial Time -- An Information-Theoretic Upper Bound of Planar Graphs Using Triangulation -- Finding Large Independent Sets in Polynomial Expected Time -- Distributed Soft Path Coloring -- Competing Provers Yield Improved Karp-Lipton Collapse Results -- One Bit of Advice -- Strong Reductions and Immunity for Exponential Time -- The Complexity of Membership Problems for Circuits over Sets of Natural Numbers -- Performance Ratios for the Differencing Method Applied to the Balanced Number Partitioning Problem -- Cake-Cutting Is Not a Piece of Cake -- The Price of Truth: Frugality in Truthful Mechanisms -- Untameable Timed Automata! -- The Intrinsic Universality Problem of One-Dimensional Cellular Automata -- On Sand Automata -- Adaptive Sorting and the Information Theoretic Lower Bound -- A Discrete Subexponential Algorithm for Parity Games -- Cryptographically Sound and Machine-Assisted Verification of Security Protocols -- Durations, Parametric Model-Checking in Timed Automata with Presburger Arithmetic. | |
| 650 | 0 | _aComputer science. | |
| 650 | 0 | _aData structures (Computer science). | |
| 650 | 0 | _aInformation theory. | |
| 650 | 0 | _aComputational complexity. | |
| 650 | 1 | 4 | _aComputer Science. |
| 650 | 2 | 4 | _aTheory of Computation. |
| 650 | 2 | 4 | _aComputer Science, general. |
| 650 | 2 | 4 | _aData Structures. |
| 650 | 2 | 4 | _aDiscrete Mathematics in Computer Science. |
| 700 | 1 |
_aAlt, Helmut. _eeditor. |
|
| 700 | 1 |
_aHabib, Michel. _eeditor. |
|
| 710 | 2 | _aSpringerLink (Online service) | |
| 773 | 0 | _tSpringer eBooks | |
| 776 | 0 | 8 |
_iPrinted edition: _z9783540006237 |
| 786 | _dSpringer | ||
| 830 | 0 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v2607 |
|
| 856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/3-540-36494-3 |
| 942 |
_2EBK4300 _cEBK |
||
| 999 |
_c33594 _d33594 |
||