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)

Computing the Homology of Basic Semialgebraic Sets in Weak Exponential Time

Journal of the ACM, 2019-01, Vol.66 (1), p.1-30

2019

Volltextzugriff (PDF)

Expander Flows, Geometric Embeddings and Graph Partitioning

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

2009

Volltextzugriff (PDF)

Stochastic Games with Synchronization Objectives

Journal of the ACM, 2023-05, Vol.70 (3), p.1-35, Article 23

Doyen, Laurent

2023

Volltextzugriff (PDF)

A Universal Law of Robustness via Isoperimetry

Journal of the ACM, 2023-04, Vol.70 (2), p.1-18, Article 10

2023

Volltextzugriff (PDF)

Faster Modular Composition

Journal of the ACM, 2024-04, Vol.71 (2), p.1-79, Article 11

2024

Volltextzugriff (PDF)

On Strongest Algebraic Program Invariants

Journal of the ACM, 2023-10, Vol.70 (5), p.1-22, Article 29

2023

Volltextzugriff (PDF)

Intermediate Value Linearizability: A Quantitative Correctness Criterion

Journal of the ACM, 2023-04, Vol.70 (2), p.1-21, Article 17

2023

Volltextzugriff (PDF)

Exponentially Faster Massively Parallel Maximal Matching

Journal of the ACM, 2023-10, Vol.70 (5), p.1-18, Article 34

2023

Volltextzugriff (PDF)

On the Zeros of Exponential Polynomials

Journal of the ACM, 2023-08, Vol.70 (4), p.1-26, Article 26

2023

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)

Optimal Auctions through Deep Learning: Advances in Differentiable Economics

Journal of the ACM, 2024-02, Vol.71 (1), p.1-53, Article 5

2024

Volltextzugriff (PDF)

Robustly Learning General Mixtures of Gaussians

Journal of the ACM, 2023-06, Vol.70 (3), p.1-53, Article 21

2023

Volltextzugriff (PDF)

Restorable Shortest Path Tiebreaking for Edge-Faulty Graphs

Journal of the ACM, 2023-10, Vol.70 (5), p.1-24, Article 28

2023

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)

Signature-Free Asynchronous Binary Byzantine Consensus with t < n/3, O(n2) Messages, and O(1) Expected Time

Journal of the ACM, 2015-08, Vol.62 (4), p.1-21, Article 31

2015

Volltextzugriff (PDF)

Revocable Quantum Timed-Release Encryption

Journal of the ACM, 2015-12, Vol.62 (6), p.1-76

Unruh, Dominique

2015

Volltextzugriff (PDF)

Sparse Higher Order Čech Filtrations

Journal of the ACM, 2024-08, Vol.71 (4), p.1-23, Article 28

2024

Volltextzugriff (PDF)

Intrinsic Robustness of the Price of Anarchy

Journal of the ACM, 2015-11, Vol.62 (5), p.1-42

Roughgarden, Tim

2015

Volltextzugriff (PDF)

1 – 25 von 30.902

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

Computing the Homology of Basic Semialgebraic Sets in Weak Exponential Time

Expander Flows, Geometric Embeddings and Graph Partitioning

Stochastic Games with Synchronization Objectives

A Universal Law of Robustness via Isoperimetry

Faster Modular Composition

On Strongest Algebraic Program Invariants

Intermediate Value Linearizability: A Quantitative Correctness Criterion

Exponentially Faster Massively Parallel Maximal Matching

On the Zeros of Exponential Polynomials

Compositional Shape Analysis by Means of Bi-Abduction

Optimal Auctions through Deep Learning: Advances in Differentiable Economics

Robustly Learning General Mixtures of Gaussians

Restorable Shortest Path Tiebreaking for Edge-Faulty Graphs

Testing First-Order Properties for Subclasses of Sparse Graphs

Signature-Free Asynchronous Binary Byzantine Consensus with t < n/3, O(n2) Messages, and O(1) Expected Time

Revocable Quantum Timed-Release Encryption

Sparse Higher Order Čech Filtrations

Intrinsic Robustness of the Price of Anarchy

Aktive Filter

Suchergebnisse filtern