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...

Functional Programming Languages and Computer Architecture: 5th ACM Conference Cambridge, MA, USA, August 26–30, 1991 Proceedings

Hughes, John

1991

Volltextzugriff (PDF)

Association for Computing Machinery

A Dictionary of the Internet, 2019

Darrel Ince

4, 2019

Volltextzugriff (PDF)

Logic, Automata, and Computational Complexity: The Works Of Stephen A. Cook . Edited by Bruce M. Kapron, ACM Books, vol. 43. Association for Computing Machinery, New York, xxvi + 398 pp.—therein: - Michelle Waitzman. Stephen Cook: Complexity’s Humble Hero , pp. 3–28. - Bruce M. Kapron and Stephen A. Cook, ACM Interview of Stephen A. Cook by Bruce M. Kapron , pp. 29–44. - Stephen A. Cook, Overview of Computational Complexity , pp. 47–70. - Christos H. Papadimitriou, Cook’s NP-Completeness Paper a

The bulletin of symbolic logic, 2023-12, Vol.29 (4), p.657-660

Pudlák, Pavel

2023

Volltextzugriff (PDF)

Association for Computing Machinery (ACM)

Encyclopædia Britannica Online, 2020

William L. Hosch

2020

Volltextzugriff (PDF)

Exponential Lower Bounds for Polytopes in Combinatorial Optimization

Journal of the ACM, 2015-05, Vol.62 (2), p.1-23, Article 17

2015

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)

Killing a Vortex

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

2024

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)

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)

On Strongest Algebraic Program Invariants

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

2023

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)

Multiparty Asynchronous Session Types

Journal of the ACM, 2016-03, Vol.63 (1), p.1-67

2016

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)

Sparse Higher Order Čech Filtrations

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

2024

Volltextzugriff (PDF)

Revocable Quantum Timed-Release Encryption

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

Unruh, Dominique

2015

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)

Proximity Gaps for Reed–Solomon Codes

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

2023

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)

Distribution-free, Risk-controlling Prediction Sets

Journal of the ACM, 2021-12, Vol.68 (6), p.1-34

2021

Volltextzugriff (PDF)

Twin-width I: Tractable FO Model Checking

Journal of the ACM, 2022-02, Vol.69 (1), p.1-46

2022

Volltextzugriff (PDF)

1 – 25 von 249.546

Menü

Weitere Dienste

Einstellungen

Functional Programming Languages and Computer Architecture: 5th ACM Conference Cambridge, MA, USA, August 26–30, 1991 Proceedings

Association for Computing Machinery

Association for Computing Machinery (ACM)

Exponential Lower Bounds for Polytopes in Combinatorial Optimization

Computing the Homology of Basic Semialgebraic Sets in Weak Exponential Time

Killing a Vortex

Stochastic Games with Synchronization Objectives

A Universal Law of Robustness via Isoperimetry

Faster Modular Composition

Intermediate Value Linearizability: A Quantitative Correctness Criterion

Exponentially Faster Massively Parallel Maximal Matching

On the Zeros of Exponential Polynomials

On Strongest Algebraic Program Invariants

Optimal Auctions through Deep Learning: Advances in Differentiable Economics

Robustly Learning General Mixtures of Gaussians

Multiparty Asynchronous Session Types

Restorable Shortest Path Tiebreaking for Edge-Faulty Graphs

Sparse Higher Order Čech Filtrations

Revocable Quantum Timed-Release Encryption

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

Proximity Gaps for Reed–Solomon Codes

Intrinsic Robustness of the Price of Anarchy

Distribution-free, Risk-controlling Prediction Sets

Twin-width I: Tractable FO Model Checking

Aktive Filter

Suchergebnisse filtern