Skip to main content
main-content

Inhaltsverzeichnis

Frontmatter

Invited Lectures

2009 | OriginalPaper | Buchkapitel

Assigning Papers to Referees

Kurt Mehlhorn

2009 | OriginalPaper | Buchkapitel

Algorithmic Game Theory: A Snapshot

Christos H. Papadimitriou

Contributed Papers

2009 | OriginalPaper | Buchkapitel

SDP-Based Algorithms for Maximum Independent Set Problems on Hypergraphs

Geir Agnarsson, Magnús M. Halldórsson, Elena Losievskaja

2009 | OriginalPaper | Buchkapitel

Correlation Clustering Revisited: The “True” Cost of Error Minimization Problems

Nir Ailon, Edo Liberty

2009 | OriginalPaper | Buchkapitel

Sorting and Selection with Imprecise Comparisons

Miklós Ajtai, Vitaly Feldman, Avinatan Hassidim, Jelani Nelson

2009 | OriginalPaper | Buchkapitel

Fast FAST

Noga Alon, Daniel Lokshtanov, Saket Saurabh

2009 | OriginalPaper | Buchkapitel

Bounds on the Size of Small Depth Circuits for Approximating Majority

Kazuyuki Amano

2009 | OriginalPaper | Buchkapitel

Counting Subgraphs via Homomorphisms

Omid Amini, Fedor V. Fomin, Saket Saurabh

2009 | OriginalPaper | Buchkapitel

External Sampling

Alexandr Andoni, Piotr Indyk, Krzysztof Onak, Ronitt Rubinfeld

2009 | OriginalPaper | Buchkapitel

Functional Monitoring without Monotonicity

Chrisil Arackaparambil, Joshua Brody, Amit Chakrabarti

2009 | OriginalPaper | Buchkapitel

De-amortized Cuckoo Hashing: Provable Worst-Case Performance and Experimental Results

Yuriy Arbitman, Moni Naor, Gil Segev

2009 | OriginalPaper | Buchkapitel

Towards a Study of Low-Complexity Graphs

Sanjeev Arora, David Steurer, Avi Wigderson

2009 | OriginalPaper | Buchkapitel

Decidability of Conjugacy of Tree-Shifts of Finite Type

Nathalie Aubrun, Marie-Pierre Béal

2009 | OriginalPaper | Buchkapitel

Improved Bounds for Speed Scaling in Devices Obeying the Cube-Root Rule

Nikhil Bansal, Ho-Leung Chan, Kirk Pruhs, Dmitriy Katz

2009 | OriginalPaper | Buchkapitel

Competitive Analysis of Aggregate Max in Windowed Streaming

Luca Becchetti, Elias Koutsoupias

2009 | OriginalPaper | Buchkapitel

Faster Regular Expression Matching

Philip Bille, Mikkel Thorup

2009 | OriginalPaper | Buchkapitel

A Fast and Simple Parallel Algorithm for the Monotone Duality Problem

Endre Boros, Kazuhisa Makino

2009 | OriginalPaper | Buchkapitel

Unconditional Lower Bounds against Advice

Harry Buhrman, Lance Fortnow, Rahul Santhanam

2009 | OriginalPaper | Buchkapitel

Approximating Decision Trees with Multiway Branches

Venkatesan T. Chakaravarthy, Vinayaka Pandit, Sambuddha Roy, Yogish Sabharwal

2009 | OriginalPaper | Buchkapitel

Annotations in Data Streams

Amit Chakrabarti, Graham Cormode, Andrew McGregor

2009 | OriginalPaper | Buchkapitel

The Tile Complexity of Linear Assemblies

Harish Chandran, Nikhil Gopalkrishnan, John Reif

2009 | OriginalPaper | Buchkapitel

A Graph Reduction Step Preserving Element-Connectivity and Applications

Chandra Chekuri, Nitish Korula

2009 | OriginalPaper | Buchkapitel

Approximating Matches Made in Heaven

Ning Chen, Nicole Immorlica, Anna R. Karlin, Mohammad Mahdian, Atri Rudra

2009 | OriginalPaper | Buchkapitel

Strong and Pareto Price of Anarchy in Congestion Games

Steve Chien, Alistair Sinclair

2009 | OriginalPaper | Buchkapitel

A Better Algorithm for Random k-SAT

Amin Coja-Oghlan

2009 | OriginalPaper | Buchkapitel

Exact and Approximate Bandwidth

Marek Cygan, Marcin Pilipczuk

2009 | OriginalPaper | Buchkapitel

Approximation Algorithms via Structural Results for Apex-Minor-Free Graphs

Erik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ichi Kawarabayashi

2009 | OriginalPaper | Buchkapitel

Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs

Erik D. Demaine, MohammadTaghi Hajiaghayi, Philip N. Klein

2009 | OriginalPaper | Buchkapitel

On Cartesian Trees and Range Minimum Queries

Erik D. Demaine, Gad M. Landau, Oren Weimann

2009 | OriginalPaper | Buchkapitel

Applications of a Splitting Trick

Martin Dietzfelbinger, Michael Rink

2009 | OriginalPaper | Buchkapitel

Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness

Benjamin Doerr, Tobias Friedrich, Thomas Sauerwald

2009 | OriginalPaper | Buchkapitel

Incompressibility through Colors and IDs

Michael Dom, Daniel Lokshtanov, Saket Saurabh

2009 | OriginalPaper | Buchkapitel

Partition Arguments in Multiparty Communication Complexity

Jan Draisma, Eyal Kushilevitz, Enav Weinreb

2009 | OriginalPaper | Buchkapitel

High Complexity Tilings with Sparse Errors

Bruno Durand, Andrei Romashchenko, Alexander Shen

2009 | OriginalPaper | Buchkapitel

Tight Bounds for the Cover Time of Multiple Random Walks

Robert Elsässer, Thomas Sauerwald

2009 | OriginalPaper | Buchkapitel

Online Computation with Advice

Yuval Emek, Pierre Fraigniaud, Amos Korman, Adi Rosén

2009 | OriginalPaper | Buchkapitel

Dynamic Succinct Ordered Trees

Arash Farzan, J. Ian Munro

2009 | OriginalPaper | Buchkapitel

Universal Succinct Representations of Trees?

Arash Farzan, Rajeev Raman, S. Srinivasa Rao

2009 | OriginalPaper | Buchkapitel

Distortion Is Fixed Parameter Tractable

Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Elena Losievskaja, Frances A. Rosamond, Saket Saurabh

2009 | OriginalPaper | Buchkapitel

Towards Optimal Range Medians

Beat Gfeller, Peter Sanders

2009 | OriginalPaper | Buchkapitel

B-Treaps: A Uniquely Represented Alternative to B-Trees

Daniel Golovin

2009 | OriginalPaper | Buchkapitel

Testing Fourier Dimensionality and Sparsity

Parikshit Gopalan, Ryan O’Donnell, Rocco A. Servedio, Amir Shpilka, Karl Wimmer

2009 | OriginalPaper | Buchkapitel

Revisiting the Direct Sum Theorem and Space Lower Bounds in Random Order Streams

Sudipto Guha, Zhiyi Huang

2009 | OriginalPaper | Buchkapitel

Wireless Communication Is in APX

Magnús M. Halldórsson, Roger Wattenhofer

2009 | OriginalPaper | Buchkapitel

The Ehrenfeucht-Silberger Problem

Štěpán Holub, Dirk Nowotka

2009 | OriginalPaper | Buchkapitel

Applications of Effective Probability Theory to Martin-Löf Randomness

Mathieu Hoyrup, Cristóbal Rojas

2009 | OriginalPaper | Buchkapitel

An EPTAS for Scheduling Jobs on Uniform Processors: Using an MILP Relaxation with a Constant Number of Integral Variables

Klaus Jansen

2009 | OriginalPaper | Buchkapitel

Popular Mixed Matchings

Telikepalli Kavitha, Julián Mestre, Meghana Nasre

2009 | OriginalPaper | Buchkapitel

Factoring Groups Efficiently

Neeraj Kayal, Timur Nezhmetdinov

2009 | OriginalPaper | Buchkapitel

On Finding Dense Subgraphs

Samir Khuller, Barna Saha

2009 | OriginalPaper | Buchkapitel

Learning Halfspaces with Malicious Noise

Adam R. Klivans, Philip M. Long, Rocco A. Servedio

2009 | OriginalPaper | Buchkapitel

General Scheme for Perfect Quantum Network Coding with Free Classical Communication

Hirotada Kobayashi, François Le Gall, Harumichi Nishimura, Martin Rötteler

2009 | OriginalPaper | Buchkapitel

Greedy ${\ensuremath{\Delta}}$ -Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost

Christos Koufogiannakis, Neal E. Young

2009 | OriginalPaper | Buchkapitel

Limits and Applications of Group Algebras for Parameterized Problems

Ioannis Koutis, Ryan Williams

2009 | OriginalPaper | Buchkapitel

Sleep with Guilt and Work Faster to Minimize Flow Plus Energy

Tak-Wah Lam, Lap-Kei Lee, Hing-Fung Ting, Isaac K. K. To, Prudence W. H. Wong

2009 | OriginalPaper | Buchkapitel

Improved Bounds for Flow Shop Scheduling

Monaldo Mastrolilli, Ola Svensson

2009 | OriginalPaper | Buchkapitel

A 3/2-Approximation Algorithm for General Stable Marriage

Eric McDermid

2009 | OriginalPaper | Buchkapitel

Limiting Negations in Formulas

Hiroki Morizumi

2009 | OriginalPaper | Buchkapitel

Fast Polynomial-Space Algorithms Using Möbius Inversion: Improving on Steiner Tree and Related Problems

Jesper Nederlof

2009 | OriginalPaper | Buchkapitel

Superhighness and Strong Jump Traceability

André Nies

2009 | OriginalPaper | Buchkapitel

Amortized Communication Complexity of Distributions

Jérémie Roland, Mario Szegedy

2009 | OriginalPaper | Buchkapitel

The Number of Symbol Comparisons in QuickSort and QuickSelect

Brigitte Vallée, Julien Clément, James Allen Fill, Philippe Flajolet

2009 | OriginalPaper | Buchkapitel

Computing the Girth of a Planar Graph in O(n logn) Time

Oren Weimann, Raphael Yuster

2009 | OriginalPaper | Buchkapitel

Elimination Graphs

Yuli Ye, Allan Borodin

Backmatter

Weitere Informationen

Premium Partner

Neuer Inhalt

BranchenIndex Online

Die B2B-Firmensuche für Industrie und Wirtschaft: Kostenfrei in Firmenprofilen nach Lieferanten, Herstellern, Dienstleistern und Händlern recherchieren.

Whitepaper

- ANZEIGE -

Product Lifecycle Management im Konzernumfeld – Herausforderungen, Lösungsansätze und Handlungsempfehlungen

Für produzierende Unternehmen hat sich Product Lifecycle Management in den letzten Jahrzehnten in wachsendem Maße zu einem strategisch wichtigen Ansatz entwickelt. Forciert durch steigende Effektivitäts- und Effizienzanforderungen stellen viele Unternehmen ihre Product Lifecycle Management-Prozesse und -Informationssysteme auf den Prüfstand. Der vorliegende Beitrag beschreibt entlang eines etablierten Analyseframeworks Herausforderungen und Lösungsansätze im Product Lifecycle Management im Konzernumfeld.
Jetzt gratis downloaden!

Bildnachweise