STACS 2004

Langue : anglais

Edité par Springer, Springer Mär 2004, 2004

3540212361 / 9783540212362

Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagnebuchversandmimpf2000

Vendeur avec une évaluation de 5 étoiles

Vendeur AbeBooks depuis 23 janvier 2017

Livre broché

Etat: Neuf

EUR 106,99

EUR 60,00 expédition 
Expédition depuis Allemagne vers Etats-Unis

Quantité disponible : 1 disponible

Ajouter au panier
Retours gratuits sous 30 jours

A propos de cet article

This item is printed on demand - Print on Demand Titel. Neuware -Invited Lectures.- Approximation Schemes for Metric Clustering Problems.- Positional Determinacy of Infinite Games.- Structural Complexity (I).- Individual Communication Complexity.- The Complexity of Satisfiability Problems over Finite Lattices.- Constant Width Planar Computation Characterizes ACC0.- Graph Algorithms (I).- A Simple and Fast Approach for Solving Problems on Planar Graphs.- Sum-Multicoloring on Paths.- Matching Algorithms Are Fast in Sparse Random Graphs.- Quantum Computations.- Algebraic Results on Quantum Automata.- Quantum Identification of Boolean Oracles.- Pattern Inference and Statistics.- Local Limit Distributions in Pattern Statistics: Beyond the Markovian Models.- A Discontinuity in Pattern Inference.- Satisfiability - Constraint Satisfaction Problem.- Algorithms for SAT Based on Search in Hamming Balls.- Identifying Efficiently Solvable Cases of Max CSP.- The Complexity of Boolean Constraint Isomorphism.- Scheduling (I).- On Minimizing the Total Weighted Tardiness on a Single Machine.- Online Competitive Algorithms for Maximizing Weighted Throughput of Unit Jobs.- Optimal and Online Preemptive Scheduling on Uniformly Related Machines.- Algorithms.- Parallel Prefetching and Caching Is Hard.- Strongly Stable Matchings in Time O(nm) and Extension to the Hospitals-Residents Problem.- Approximation Algorithms for Minimizing Average Distortion.- Networks (I).- Digraphs Exploration with Little Memory.- Approximate Path Coloring with Applications to Wavelength Assignment in WDM Optical Networks.- An Algorithmic View on OVSF Code Assignment.- Automata Theory and Words.- The Syntactic Graph of a Sofic Shift.- Periodicity and Unbordered Words.- Desert Automata and the Finite Substitution Problem.- Structural Complexity (II).- Satisfiability ProblemsComplete for Deterministic Logarithmic Space.- A Logspace Approximation Scheme for the Shortest Path Problem for Graphs with Bounded Independence Number.- The Minimal Logically-Defined NP-Complete Problem.- Path Algorithms.- Solving the 2-Disjoint Paths Problem in Nearly Linear Time.- Simpler Computation of Single-Source Shortest Paths in Linear Average Time.- Cryptography.- Lattices with Many Cycles Are Dense.- Automata-Based Analysis of Recursive Cryptographic Protocols.- Networks (II).- On Minimum Circular Arrangement.- Integral Symmetric 2-Commodity Flows.- Efficient Algorithms for Low-Energy Bounded-Hop Broadcast in Ad-Hoc Wireless Networks.- Logic and Formal Languages.- On the Expressiveness of Deterministic Transducers over Infinite Trees.- Definability and Regularity in Automatic Structures.- Active Context-Free Games.- Graphs Algorithms (II).- Worst Case Performance of an Approximation Algorithm for Asymmetric TSP.- On Visibility Representation of Plane Graphs.- Topology Matters: Smoothed Competitiveness of Metrical Task Systems.- Game Theory and Complexity.- A Randomized Competitive Algorithm for Evaluating Priced AND/OR Trees.- The Plurality Problem with Three Colors.- A Measured Collapse of the Modal -Calculus Alternation Hierarchy.- Networks (III).- An Information Theoretic Lower Bound for Broadcasting in Radio Networks.- A New Model for Selfish Routing.- Broadcast in the Rendezvous Model.- Structural Complexity (III).- Time-Space Tradeoff in Derandomizing Probabilistic Logspace.- What Can be Efficiently Reduced to the K-Random Strings .- Regular Language Matching and Other Decidable Cases of the Satisfiability Problem for Constraints between Regular Open Terms.- Scheduling (II).- Deterministic Truthful Approximation Mechanisms for Scheduling RelatedMachines.- The Expected Competitive Ratio for Weighted Completion Time Scheduling.- Algorithmic Information.- Effective Strong Dimension in Algorithmic Information and Computational Complexity.- A Lower Bound on the Competitive Ratio of Truthful Auctions.- Errata to STACS 2003.- Errata to Analysis of the Harmonic Algorithm for Three Servers.Sprin.…

N° de réf. du vendeur 9783540212362

Titre
STACS 2004
Auteur
Volker Diekert
Éditeur
Springer, Springer Mär 2004
Année de publication
2004
État de l'article
Neu
Reliure
Taschenbuch
Langue
anglais
ISBN à 10 chiffres
3540212361
ISBN à 13 chiffres
9783540212362
Poids de l'article
1 013 grammes
Dimensions
235x155x37 mm

buchversandmimpf2000

Emtmannsberg, BAYE, Allemagne

Vendeur avec une évaluation de 5 étoiles

Vendeur AbeBooks depuis 23 janvier 2017

Frais d'expédition de Allemagne vers Etats-Unis

Article60 à 60 jours ouvrés60 à 60 jours ouvrés
Premier articleEUR 60,00EUR 75,00
Les délais de livraison sont fixés par les vendeurs et varient en fonction du transporteur et du lieu. Les commandes transitant par les douanes peuvent être retardées et les acheteurs sont responsables de tous les droits ou frais associés. Les vendeurs peuvent vous contacter au sujet de frais supplémentaires afin de couvrir toute augmentation des coûts d'expédition de vos articles.

Modes de paiement

  • Visa
  • Mastercard
  • American Express
  • Carte Bleue
  • Apple Pay
  • Google Pay
  • Chèque
  • Paypal

Description de la boutique

Impressum Thorsten Retsch Buchversand Mimpf2000 Oberölschnitz 16 95517 Emtmannsberg Deutschland Telefon: 09209-2023188 Email: mimpf2000@online.de USt-ID-Nr.: DE 235096871 Wir führen gebrauchte Bücher aus allen Sparten der Literatur

Spécialité

Modernes Antiquariat - Bücher von 1960 bis heute

Profil professionnel du vendeur

buchversandmimpf2000

Allemagne