STACS 2007
24th Annual Symposium on Theoretical Aspects of Computer Science, Aachen, Germany, February 22-24, 2007, Proceedings
1 127 kr
Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.
Fler format och utgåvor
Beskrivning
Produktinformation
- Utgivningsdatum:2007-02-08
- Mått:155 x 235 mm
- Format:Häftad
- Språk:Engelska
- Serie:Lecture Notes in Computer Science
- Antal sidor:710
- Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
- ISBN:9783540709176
Utforska kategorier
Innehållsförteckning
- Invited Talks.- A Calculus and Algebra for Distributed Data Management.- The Büchi Complementation Saga.- Speed-Up Techniques for Shortest-Path Computations.- Session 1A.- Compact Forbidden-Set Routing.- A New Bound for Pure Greedy Hot Potato Routing.- Wavelength Management in WDM Rings to Maximize the Number of Connections.- Session 1B.- A First Investigation of Sturmian Trees.- On the Size of the Universal Automaton of a Regular Language.- Correlations of Partial Words.- Session 2A.- Testing Convexity Properties of Tree Colorings.- Why Almost All k-Colorable Graphs Are Easy.- Session 2B.- On Defining Integers in the Counting Hierarchy and Proving Arithmetic Circuit Lower Bounds.- A New Rank Technique for Formula Size Lower Bounds.- Session 3A.- Hard Metrics from Cayley Graphs of Abelian Groups.- Broadcasting vs. Mixing and Information Dissemination on Cayley Graphs.- Light Orthogonal Networks with Constant Geometric Dilation.- Session 3B.- Admissibility in Infinite Games.- Pure Stationary Optimal Strategies in Markov Decision Processes.- Symmetries and the Complexity of Pure Nash Equilibrium.- Session 4A.- Computing Representations of Matroids of Bounded Branch-Width.- Characterizing Minimal Interval Completions.- Session 4B.- The Complexity of Unions of Disjoint Sets.- Kolmogorov-Loveland Stochasticity and Kolmogorov Complexity.- Session 5A.- Bounded-Hop Energy-Efficient Broadcast in Low-Dimensional Metrics Via Coresets.- On the Complexity of Affine Image Matching.- Session 5B.- On Fixed Point Equations over Commutative Semirings.- An Exponential Lower Bound for Prefix Gröbner Bases in Free Monoid Rings.- Session 6A.- A Cubic Kernel for Feedback Vertex Set.- The Union of Minimal Hitting Sets: Parameterized Combinatorial Bounds and Counting.- An Optimal, Edges-OnlyFully Dynamic Algorithm for Distance-Hereditary Graphs.- Session 6B.- A Search Algorithm for the Maximal Attractor of a Cellular Automaton.- Universal Tilings.- On the Complexity of Unary Tiling-Recognizable Picture Languages.- Session 7A.- A Characterization of Strong Learnability in the Statistical Query Model.- On the Consistency of Discrete Bayesian Learning.- Session 7B.- VPSPACE and a Transfer Theorem over the Reals.- On Symmetric Signatures in Holographic Algorithms.- Session 8A.- Randomly Rounding Rationals with Cardinality Constraints and Derandomizations.- Cheating to Get Better Roommates in a Random Stable Matching.- A Deterministic Algorithm for Summarizing Asynchronous Streams over a Sliding Window.- Session 8B.- Arithmetizing Classes Around NC 1 and L.- The Polynomially Bounded Perfect Matching Problem Is in NC 2.- Languages with Bounded Multiparty Communication Complexity.- Session 9A.- New Approximation Algorithms for Minimum Cycle Bases of Graphs.- On Completing Latin Squares.- Small Space Representations for Metric Min-Sum k-Clustering and Their Applications.- Session 9B.- An Optimal Tableau-Based Decision Algorithm for Propositional Neighborhood Logic.- Bounded-Variable Fragments of Hybrid Logics.- Rank-1 Modal Logics Are Coalgebraic.- Session 10A.- An Efficient Quantum Algorithm for the Hidden Subgroup Problem in Extraspecial Groups.- Weak Fourier-Schur Sampling, the Hidden Subgroup Problem, and the Quantum Collision Problem.- Quantum Network Coding.- Session 10B.- Reachability in Unions of Commutative Rewriting Systems Is Decidable.- Associative-Commutative Deducibility Constraints.- On the Automatic Analysis of Recursive Security Protocols with XOR.- Session 11A.- Improved Online Algorithms for the Sorting Buffer Problem.- Cost Sharing Methods forMakespan and Completion Time Scheduling.- Session 11B.- Planar Graphs: Logical Complexity and Parallel Isomorphism Tests.- Enumerating All Solutions for Constraint Satisfaction Problems.
Mer från samma serie
Agent Mediated Electronic Commerce II
Alexandros Moukas, Carles Sierra, Fredrik Ygge
Häftad, 2000
567 kr
Multiobjective Optimization
Jürgen Branke, Kalyanmoy Deb, Kaisa Miettinen, Roman Slowiński
Häftad, 2008
551 kr
Knowledge Graphs
Hideaki Takeda, Yannis Tzitzikas, Giorgos Flouris, Shizhu He, Dimitris Plexousakis, Sébastien Ferré, Ran Yu, Vasilis Efthymiou, Eleni Ilkou, Ernesto Jiménez-Ruiz, Xin Wang
Häftad, 2026
926 kr
Electronic Government
Ida Lindgren, Marijn Janssen, Habin Lee, Andrea Polini, Manuel Pedro Rodríguez Bolívar, Hans Jochen Scholl, Efthimios Tambouris
Häftad, 2019
822 kr
Chromatic Visions
Irina Mihaela Ciortan, Daniele Ferdani, Jon Yngve Hardeberg, Sophia Sotiropoulou, Manuele Veggi
Häftad, 2026
455 kr
Data Quality and Trust in Big Data
Hakim Hacid, Quan Z. Sheng, Tetsuya Yoshida, Azadeh Sarkheyli, Rui Zhou
Häftad, 2019
567 kr
Energy Informatics
Ivo Martinac, Bo Nørregaard Jørgensen, Zheng Grace Ma, Rúnar Unnþórsson, Chiara Bordin
Häftad, 2025
832 kr
Biomimetic and Biohybrid Systems
Alejandro Jiménez Rodríguez, Rafael Mestre, Chaona Chen, Anna Mura, Edmund Barker, Paul Verschure, Tony Prescott
Häftad, 2025
1 010 kr
Du kanske också är intresserad av
Complexity and Randomness in Group Theory
Pascal Weil, Alexander Ushakov, Vladimir Shpilrain, Igor Rivin, Andrey Nikolaev, Cyril Nicaud, Alexei Miasnikov, Markus Lohrey, Ilya Kapovich, Frederique Bassino
2 267 kr
Complexity and Randomness in Group Theory
Pascal Weil, Alexander Ushakov, Vladimir Shpilrain, Igor Rivin, Andrey Nikolaev, Cyril Nicaud, Alexei Miasnikov, Markus Lohrey, Ilya Kapovich, Frederique Bassino
2 195 kr
Complexity and Randomness in Group Theory
Frédérique Bassino, Ilya Kapovich, Markus Lohrey, Alexei Miasnikov, Cyril Nicaud, Andrey Nikolaev, Igor Rivin, Vladimir Shpilrain, Alexander Ushakov, Pascal Weil, Frédérique Bassino, Pascal Weil, Ilya Kapovich, Markus Lohrey, Alexei Miasnikov, Cyril Nicaud, Andrey Nikolaev, Igor Rivin, Vladimir Shpilrain, Alexander Ushakov
Inbunden, 2020
2 239 kr