UB Paderborn / Katalog / Suche / in CDI

Sortiert nach

Einfacher Volltextzugriff von (fast) überall

Installieren Sie die LibKey Nomad-Browsererweiterung und erhalten Sie von vielen Webseiten einfachen Zugriff auf lizenzierte Volltexte oder Open Access Publikationen. Mehr erfahren...

Linear-Time Approximation for Maximum Weight Matching

Journal of the ACM, 2014-01, Vol.61 (1), p.1-23, Article 1

2014

Volltextzugriff (PDF)

On the (Im)possibility of Obfuscating Programs

Journal of the ACM, 2012-04, Vol.59 (2), p.1-48

2012

Volltextzugriff (PDF)

Steiner Tree Approximation via Iterative Randomized Rounding

Journal of the ACM, 2013-02, Vol.60 (1), p.1-33

2013

Volltextzugriff (PDF)

Nonuniform ACC Circuit Lower Bounds

Journal of the ACM, 2014-01, Vol.61 (1), p.1-32, Article 2

Williams, Ryan

2014

Volltextzugriff (PDF)

Persistence-Based Clustering in Riemannian Manifolds

Journal of the ACM, 2013-11, Vol.60 (6), p.1-38

2013

Volltextzugriff (PDF)

The Effectiveness of Lloyd-Type Methods for the k-Means Problem

Journal of the ACM, 2012-12, Vol.59 (6), p.1-22

2012

Volltextzugriff (PDF)

Satisfiability Allows No Nontrivial Sparsification unless the Polynomial-Time Hierarchy Collapses

Journal of the ACM, 2014-07, Vol.61 (4), p.1-27

2014

Volltextzugriff (PDF)

Expander Flows, Geometric Embeddings and Graph Partitioning

Journal of the ACM, 2009-04, Vol.56 (2), p.1-37

2009

Volltextzugriff (PDF)

Compositional Shape Analysis by Means of Bi-Abduction

Journal of the ACM, 2011-12, Vol.58 (6), p.1-66

2011

Volltextzugriff (PDF)

Testing First-Order Properties for Subclasses of Sparse Graphs

Journal of the ACM, 2013-10, Vol.60 (5), p.1-24

2013

Volltextzugriff (PDF)

Adding Nesting Structure to Words

Journal of the ACM, 2009-05, Vol.56 (3), p.1-43

2009

Volltextzugriff (PDF)

Unbalanced Expanders and Randomness Extractors from Parvaresh-Vardy Codes

Journal of the ACM, 2009-06, Vol.56 (4), p.1-34

2009

Volltextzugriff (PDF)

Indexing compressed text

Journal of the ACM, 2005-07, Vol.52 (4), p.552-581

2005

Volltextzugriff (PDF)

The Complexity of the Counting Constraint Satisfaction Problem

Journal of the ACM, 2013-10, Vol.60 (5), p.1-41

BULATOV, Andrei A

2013

Volltextzugriff (PDF)

When are elections with few candidates hard to manipulate?

Journal of the ACM, 2007-06, Vol.54 (3), p.14-14

2007

Volltextzugriff (PDF)

Deterministic Distributed Vertex Coloring in Polylogarithmic Time

Journal of the ACM, 2011-10, Vol.58 (5), p.1-25

2011

Volltextzugriff (PDF)

The Complexity of Temporal Constraint Satisfaction Problems

Journal of the ACM, 2010, Vol.57 (2), p.1-41

2010

Volltextzugriff (PDF)

Linear-Time Approximation Schemes for Clustering Problems in Any Dimensions

Journal of the ACM, 2010, Vol.57 (2), p.1-32

2010

Volltextzugriff (PDF)

A Learning Theory Approach to Noninteractive Database Privacy

Journal of the ACM, 2013-04, Vol.60 (2), p.1-25

2013

Volltextzugriff (PDF)

Tensor-Rank and Lower Bounds for Arithmetic Formulas

Journal of the ACM, 2013-11, Vol.60 (6), p.1-15

RAZ, Ran

2013

Volltextzugriff (PDF)

Clustering under Approximation Stability

Journal of the ACM, 2013-04, Vol.60 (2), p.1-34

2013

Volltextzugriff (PDF)

Recursive Markov Chains, Stochastic Grammars, and Monotone Systems of Nonlinear Equations

Journal of the ACM, 2009, Vol.56 (1), p.1-66

2009

Volltextzugriff (PDF)

Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth

Journal of the ACM, 2011-10, Vol.58 (5), p.1-37

2011

Volltextzugriff (PDF)

A Discriminative Model for Semi-Supervised Learning

Journal of the ACM, 2010-03, Vol.57 (3), p.1-46

2010

Volltextzugriff (PDF)

Adaptive Simulated Annealing: A Near-Optimal Connection between Sampling and Counting

Journal of the ACM, 2009-05, Vol.56 (3), p.1-36

2009

Volltextzugriff (PDF)

1 – 25 von 1.581

Menü

Weitere Dienste

Einstellungen

Linear-Time Approximation for Maximum Weight Matching

On the (Im)possibility of Obfuscating Programs

Steiner Tree Approximation via Iterative Randomized Rounding

Nonuniform ACC Circuit Lower Bounds

Persistence-Based Clustering in Riemannian Manifolds

The Effectiveness of Lloyd-Type Methods for the k-Means Problem

Satisfiability Allows No Nontrivial Sparsification unless the Polynomial-Time Hierarchy Collapses

Expander Flows, Geometric Embeddings and Graph Partitioning

Compositional Shape Analysis by Means of Bi-Abduction

Testing First-Order Properties for Subclasses of Sparse Graphs

Adding Nesting Structure to Words

Unbalanced Expanders and Randomness Extractors from Parvaresh-Vardy Codes

Indexing compressed text

The Complexity of the Counting Constraint Satisfaction Problem

When are elections with few candidates hard to manipulate?

Deterministic Distributed Vertex Coloring in Polylogarithmic Time

The Complexity of Temporal Constraint Satisfaction Problems

Linear-Time Approximation Schemes for Clustering Problems in Any Dimensions

A Learning Theory Approach to Noninteractive Database Privacy

Tensor-Rank and Lower Bounds for Arithmetic Formulas

Clustering under Approximation Stability

Recursive Markov Chains, Stochastic Grammars, and Monotone Systems of Nonlinear Equations

Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth

A Discriminative Model for Semi-Supervised Learning

Adaptive Simulated Annealing: A Near-Optimal Connection between Sampling and Counting

Aktive Filter

Suchergebnisse filtern