STACS 99 : 16th Annual Symposium on Theoretical Aspects of Computer Science Trier, Germany, March 4 6, 1999 : proceedings
Gorde:
| Erakunde egilea: | |
|---|---|
| Beste egile batzuk: | , |
| Formatua: | Livre numérique |
| Hizkuntza: | Anglais |
| Argitaratua: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Saila: | Lecture notes in computer science
1563 |
| Gaiak: | |
| Sarrera elektronikoa: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Oharra: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • STACS 99, 16th annual Symposium on Theoretical Aspects of Computer Science, Trier, Germany, March 4-6, 1999, proceedings, Christoph Meinel, Sophie Tison (Eds.), 1999, Berlin, Springer, 1 vol. (XIV-582 p.), Lecture notes in computer science, 3-540-65691-X • STACS 99, Texte imprimé, 9783662208212 |
| LEADER | 05872nam a22003977a 4500 | ||
|---|---|---|---|
| 001 | 972779 | ||
| 008 | 110927q2000 xxe ||| |||| 00| 0 eng d | ||
| 009 | PPN155229842 | ||
| 020 | |a 9783540491163 (PDF) | ||
| 041 | 0 | |a eng | |
| 082 | |a 004 | ||
| 111 | 2 | |a Symposium on Theoretical Aspects of Computer Science |n (16 |d :1999 |c :Trèves, Allemagne). | |
| 245 | 1 | 0 | |a STACS 99 : |b 16th Annual Symposium on Theoretical Aspects of Computer Science Trier, Germany, March 4 6, 1999 : proceedings |c [edited by] Christoph Meinel, Sophie Tison. |
| 260 | |a Berlin [etc.] : |b Springer. | ||
| 260 | |a Cham : |b Springer Nature, |c [20..]. | ||
| 490 | 0 | |a Lecture notes in computer science |v 1563 |x 1611-3349 | |
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 505 | 0 | |a Invited 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. | |
| 506 | |a Accès en ligne pour les établissements français bénéficiaires des licences nationales | ||
| 506 | |a Accès soumis à abonnement pour tout autre établissement | ||
| 506 | |a Conditions particulières de réutilisation pour les bénéficiaires des licences nationales. https://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017 | ||
| 650 | |a Informatique | ||
| 650 | |a Langages de programmation | ||
| 650 | |a Structures de données (informatique) | ||
| 650 | |a Ordinateurs | ||
| 650 | |a Actes de congrès | ||
| 700 | 1 | |a Meinel, Christoph, |d 1949- |4 pbd | |
| 700 | 1 | |a Tison, Sophie, |d 1958- |4 pbd | |
| 776 | 0 | |0 045782148 |t STACS 99 |o 16th annual Symposium on Theoretical Aspects of Computer Science, Trier, Germany, March 4-6, 1999 |o proceedings |f Christoph Meinel, Sophie Tison (Eds.) |d 1999 |c Berlin |n Springer |p 1 vol. (XIV-582 p.) |s Lecture notes in computer science |z 3-540-65691-X | |
| 776 | 0 | |t STACS 99 |b Texte imprimé |z 9783662208212 | |
| 856 | 4 | |q PDF |u https://doi.org/10.1007/3-540-49116-3 |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-LPMPF847-L |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 452349901:750633034 |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/3-540-49116-3 |z Accès Université d'Orléans | |
| 856 | 4 | |5 180339901:75398945X |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/3-540-49116-3 |z Accès INSA CVL | |
| 997 | |0 972779 |1 Livre numérique |a Ressource numérique |b INSA |b ENSA |c 0/Bibliothèque numérique/ |c 1/Bibliothèque numérique/Autre ressource numérique/ | ||