|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 2054 occurrences of 1145 keywords
|
|
|
|
|
Results
Found 3139 publication records. Showing 3139 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Bhaskar Ray Chaudhury, Jugal Garg, Kurt Mehlhorn |
EFX Exists for Three Agents.  |
J. ACM  |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Dütting, Zhe Feng 0004, Harikrishna Narasimhan, David C. Parkes, Sai Srivatsa Ravindranath |
Optimal Auctions through Deep Learning: Advances in Differentiable Economics. |
J. ACM |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Xiao Hu 0005, Yufei Tao 0001 |
Parallel Acyclic Joins: Optimal Algorithms and Cyclicity Separation. |
J. ACM |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Dario Stein, Sam Staton |
Probabilistic Programming with Exact Conditions. |
J. ACM |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Javier Esparza, Rubén Rubio, Salomon Sickert |
Efficient Normalization of Linear Temporal Logic. |
J. ACM |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Aïna Linn Georges, Armaël Guéneau, Thomas Van Strydonck, Amin Timany, Alix Trieu, Dominique Devriese, Lars Birkedal |
Cerise: Program Verification on a Capability Machine in the Presence of Untrusted Code. |
J. ACM |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Chi-Ning Chou, Alexander Golovnev, Madhu Sudan 0001, Santhoshini Velusamy |
Sketching Approximability of All Finite CSPs. |
J. ACM |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Vincent Neiger, Bruno Salvy, Éric Schost, Gilles Villard |
Faster Modular Composition. |
J. ACM |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Moritz Lichter, Pascal Schweitzer |
Choiceless Polynomial Time with Witnessed Symmetric Choice. |
J. ACM |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Vincent Cohen-Addad, Debarati Das 0001, Evangelos Kipouridis, Nikos Parotsidis, Mikkel Thorup |
Fitting Distances by Tree Metrics Minimizing the Total Error within a Constant Factor. |
J. ACM |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Shang-En Huang, Seth Pettie, Leqi Zhu |
Byzantine Agreement with Optimal Resilience via Statistical Fraud Detection. |
J. ACM |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Sean Ovens |
The Space Complexity of Consensus from Swap. |
J. ACM |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuqing Kong |
Dominantly Truthful Peer Prediction Mechanisms with a Finite Number of Tasks. |
J. ACM |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Maria-Florina Balcan, Travis Dick, Tuomas Sandholm, Ellen Vitercik |
Learning to Branch: Generalization Guarantees and Limits of Data-Independent Discretization. |
J. ACM |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Arthur Oliveira Vale, Zhong Shao, Yixuan Chen 0002 |
A Compositional Theory of Linearizability. |
J. ACM |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Mahmoud Abo Khamis, Hung Q. Ngo 0001, Reinhard Pichler, Dan Suciu, Yisu Remy Wang |
Convergence of datalog over (Pre-) Semirings. |
J. ACM |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Ho-Lin Chen, David Doty, Wyatt Reeves, David Soloveichik |
Rate-independent Computation in Continuous Chemical Reaction Networks. |
J. ACM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Greg Bodwin, Merav Parter |
Restorable Shortest Path Tiebreaking for Edge-Faulty Graphs. |
J. ACM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Bauwens, Marius Zimand |
Universal almost Optimal Compression and Slepian-wolf Coding in Probabilistic Polynomial Time. |
J. ACM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Moran Feldman, Ashkan Norouzi-Fard, Ola Svensson, Rico Zenklusen |
The One-Way Communication Complexity of Submodular Maximization with Applications to Streaming and Robustness. |
J. ACM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Manuel Bodirsky, Jakub Rydval |
On the Descriptive Complexity of Temporal Constraint Satisfaction Problems. |
J. ACM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Graham Cormode, Zohar S. Karnin, Edo Liberty, Justin Thaler, Pavel Veselý 0001 |
Relative Error Streaming Quantiles. |
J. ACM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Allen Liu, Ankur Moitra |
Robustly Learning General Mixtures of Gaussians. |
J. ACM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Dimitrios Los, Thomas Sauerwald |
Balanced Allocations with the Choice of Noise. |
J. ACM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicola Cotumaccio, Giovanna D'Agostino, Alberto Policriti, Nicola Prezza |
Co-lexicographically Ordering Automata and Regular Languages - Part I. |
J. ACM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Panagiotis Charalampopoulos, Pawel Gawrychowski, Yaowei Long, Shay Mozes, Seth Pettie, Oren Weimann, Christian Wulff-Nilsen |
Almost Optimal Exact Distance Oracles for Planar Graphs. |
J. ACM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Gilad Asharov, Ilan Komargodski, Wei-Kai Lin, Kartik Nayak, Enoch Peserico, Elaine Shi |
OptORAMa: Optimal Oblivious RAM. |
J. ACM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Soheil Behnezhad, MohammadTaghi Hajiaghayi, David G. Harris 0001 |
Exponentially Faster Massively Parallel Maximal Matching. |
J. ACM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Vishwas Bhargava, Sumanta Ghosh, Mrinal Kumar 0001, Chandra Kanta Mohapatra |
Fast, Algebraic Multivariate Multipoint Evaluation in Small Characteristic and Applications. |
J. ACM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Ehud Hrushovski, Joël Ouaknine, Amaury Pouly, James Worrell 0001 |
On Strongest Algebraic Program Invariants. |
J. ACM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Nai-Hui Chia, Kai-Min Chung, Ching-Yi Lai |
On the Need for Large Quantum Depth. |
J. ACM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | John Fearnley, Paul Goldberg 0001, Alexandros Hollender, Rahul Savani |
The Complexity of Gradient Descent: CLS = PPAD ∩ PLS. |
J. ACM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Meena Jagadeesan, Alexander Wei 0001, Yixin Wang, Michael I. Jordan, Jacob Steinhardt |
Learning Equilibria in Matching Markets with Bandit Feedback. |
J. ACM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Peyman Afshani, Pingan Cheng |
Lower Bounds for Semialgebraic Range Searching and Stabbing Problems. |
J. ACM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Lijie Chen 0001, Ron D. Rothblum, Roei Tell, Eylon Yogev |
On Exponential-time Hypotheses, Derandomization, and Circuit Lower Bounds. |
J. ACM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Miguel Romero 0001, Marcin Wrochna, Stanislav Zivný |
Pliability and Approximating Max-CSPs. |
J. ACM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Christoph Berkholz, Jakob Nordström |
Near-optimal Lower Bounds on Quantifier Depth and Weisfeiler-Leman Refinement Steps. |
J. ACM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | James B. Orlin, László A. Végh |
Directed Shortest Paths via Approximate Cost Balancing. |
J. ACM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Ivan Geffner, Joseph Y. Halpern |
Lower Bounds on Implementing Mediators in Asynchronous Systems with Rational and Malicious Agents. |
J. ACM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Arik Rinberg, Idit Keidar |
Intermediate Value Linearizability: A Quantitative Correctness Criterion. |
J. ACM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Sébastien Bubeck, Mark Sellke |
A Universal Law of Robustness via Isoperimetry. |
J. ACM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Laurent Doyen 0001 |
Stochastic Games with Synchronization Objectives. |
J. ACM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Jason Gaitonde, Éva Tardos |
The Price of Anarchy of Strategic Queuing Systems. |
J. ACM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexandru Baltag, Nick Bezhanishvili, David Fernández-Duque |
The Topological Mu-Calculus: Completeness and Decidability. |
J. ACM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Roberto Bruni, Roberto Giacobazzi, Roberta Gori, Francesco Ranzato |
A Correctness and Incorrectness Program Logic. |
J. ACM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Moritz Lichter |
Separating Rank Logic from Polynomial Time. |
J. ACM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Xavier Goaoc, Emo Welzl |
Convex Hulls of Random Order Types. |
J. ACM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Haitao Wang 0001 |
A New Algorithm for Euclidean Shortest Paths in the Plane. |
J. ACM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Zhihao Gavin Tang, Xiaowei Wu 0001, Yuhao Zhang 0001 |
Toward a Better Understanding of Randomized Greedy Matching. |
J. ACM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Joachim Kock |
Whole-grain Petri Nets and Processes. |
J. ACM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael A. Bender, Alex Conway, Martin Farach-Colton, William Kuszmaul, Guido Tagliavini |
Iceberg Hashing: Optimizing Many Hash-Table Criteria at Once. |
J. ACM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Haotian Jiang |
Minimizing Convex Functions with Rational Minimizers. |
J. ACM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Shalev Ben-David, Eric Blais |
A New Minimax Theorem for Randomized Algorithms. |
J. ACM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Ventsislav Chonev, Joël Ouaknine, James Worrell 0001 |
On the Zeros of Exponential Polynomials. |
J. ACM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean Goubault-Larrecq, Xiaodong Jia 0002, Clément Théron |
A Domain-theoretic Approach to Statistical Programming Languages. |
J. ACM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Rutschmann, Manuel Wettstein |
Chains, Koch Chains, and Point Sets with Many Triangulations. |
J. ACM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Yaonan Jin, Pinyan Lu |
First Price Auction is 1-1/e2 Efficient. |
J. ACM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Eli Ben-Sasson, Dan Carmon, Yuval Ishai, Swastik Kopparty, Shubhangi Saraf |
Proximity Gaps for Reed-Solomon Codes. |
J. ACM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Noah Fleming, Denis Pankratov, Toniann Pitassi, Robert Robere |
Random \( \Theta (\log n) \) -CNFs are Hard for Cutting Planes. |
J. ACM |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Alessandro Chiesa, Michael A. Forbes 0001, Tom Gur, Nicholas Spooner |
Spatial Isolation Implies Zero Knowledge Even in a Quantum World. |
J. ACM |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Édouard Bonnet, Eun Jung Kim 0002, Stéphan Thomassé, Rémi Watrigant |
Twin-width I: Tractable FO Model Checking. |
J. ACM |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Radoslav Fulek, Csaba D. Tóth |
Atomic Embeddability, Clustered Planarity, and Thickenability. |
J. ACM |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Pranjal Dutta, Nitin Saxena 0001, Amit Sinhababu |
Discovering the Roots: Uniform Closure Results for Algebraic Classes Under Factoring. |
J. ACM |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Mark Braverman, Klim Efremenko, Ran Gelles, Michael A. Yitayew |
Optimal Short-Circuit Resilient Formulas. |
J. ACM |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Kuan Cheng, Zhengzhong Jin, Xin Li 0006, Ke Wu 0001 |
Deterministic Document Exchange Protocols and Almost Optimal Binary Codes for Edit Errors. |
J. ACM |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Michal Dory, Merav Parter |
Exponentially Faster Shortest Paths in the Congested Clique. |
J. ACM |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Ryan O'Donnell, Rocco A. Servedio, Li-Yang Tan |
Fooling Polytopes. |
J. ACM |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Nai-Hui Chia, András Pal Gilyén, Tongyang Li, Han-Hsuan Lin, Ewin Tang, Chunhao Wang |
Sampling-based Sublinear Low-rank Matrix Arithmetic Framework for Dequantizing Quantum Machine Learning. |
J. ACM |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicole Schweikardt, Luc Segoufin, Alexandre Vigny |
Enumeration for FO Queries over Nowhere Dense Graphs. |
J. ACM |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Gabriele Farina, Andrea Celli, Alberto Marchesi 0001, Nicola Gatti 0001 |
Simple Uncoupled No-regret Learning Dynamics for Extensive-form Correlated Equilibrium. |
J. ACM |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Jaroslaw Blasiok, Venkatesan Guruswami, Preetum Nakkiran, Atri Rudra, Madhu Sudan 0001 |
General Strong Polarization. |
J. ACM |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Suman K. Bera 0001, Lior Gishboliner, Yevgeny Levanzov, C. Seshadhri 0001, Asaf Shapira |
Counting Subgraphs in Degenerate Graphs. |
J. ACM |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Grohe, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Peter Lindner 0001 |
Generative Datalog with Continuous Distributions. |
J. ACM |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Éva Tardos |
Invited Article Foreword. |
J. ACM |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Lijie Chen 0001, Shuichi Hirahara, Igor Carboni Oliveira, Ján Pich, Ninad Rajgopal, Rahul Santhanam |
Beyond Natural Proofs: Hardness Magnification and Locality. |
J. ACM |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Mikkel Abrahamsen, Anna Adamaszek, Tillmann Miltzow |
The Art Gallery Problem is ∃ℝ-complete. |
J. ACM |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Abbas Edalat |
Smooth Approximation of Lipschitz Maps and Their Subgradients. |
J. ACM |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Grohe, Peter Lindner 0001 |
Independence in Infinite Probabilistic Databases. |
J. ACM |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | David Harvey, Joris van der Hoeven |
Polynomial Multiplication over Finite Fields in Time \( O (n \log n) \). |
J. ACM |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Ran Raz, Avishay Tal |
Oracle Separation of BQP and PH. |
J. ACM |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthew Fahrbach, Zhiyi Huang 0002, Runzhou Tao, Morteza Zadimoghaddam |
Edge-Weighted Online Bipartite Matching. |
J. ACM |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Leonid Barenboim, Michael Elkin, Uri Goldenberg |
Locally-iterative Distributed (Δ + 1)-coloring and Applications. |
J. ACM |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Eric Balkanski, Aviad Rubinstein, Yaron Singer |
The Limitations of Optimization from Samples. |
J. ACM |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Natan Rubin |
An Improved Bound for Weak Epsilon-nets in the Plane. |
J. ACM |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Naomi Ephraim, Cody Freitag, Ilan Komargodski, Rafael Pass |
SPARKs: Succinct Parallelizable Arguments of Knowledge. |
J. ACM |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Guy Blanc, Jane Lange, Mingda Qiao, Li-Yang Tan |
Properly Learning Decision Trees in almost Polynomial Time. |
J. ACM |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Mark Bun, Roi Livni, Maryanthe Malliaris, Shay Moran |
Private and Online Learnability Are Equivalent. |
J. ACM |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Anupam Gupta 0001, David G. Harris 0001, Euiwoong Lee, Jason Li 0006 |
Optimal Bounds for the k-cut Problem. |
J. ACM |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Dean Doron, Dana Moshkovitz, Justin Oh, David Zuckerman |
Nearly Optimal Pseudorandomness from Hardness. |
J. ACM |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Éva Tardos |
Invited Article Foreword. |
J. ACM |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Mark Kaminski, Egor V. Kostylev, Bernardo Cuenca Grau, Boris Motik, Ian Horrocks 0001 |
The Complexity and Expressive Power of Limit Datalog. |
J. ACM |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Borzoo Bonakdarpour, Pierre Fraigniaud, Sergio Rajsbaum, David A. Rosenblueth, Corentin Travers |
Decentralized Asynchronous Crash-resilient Runtime Verification. |
J. ACM |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Elizabeth Labrada, Matías Toro, Éric Tanter |
Gradual System F. |
J. ACM |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | T.-H. Hubert Chan, Kai-Min Chung, Bruce M. Maggs, Elaine Shi |
Foundations of Differentially Oblivious Algorithms. |
J. ACM |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Gadi Taubenfeld |
Anonymous Shared Memory. |
J. ACM |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Omri Ben-Eliezer, Rajesh Jayaram, David P. Woodruff, Eylon Yogev |
A Framework for Adversarially Robust Streaming Algorithms. |
J. ACM |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Avinatan Hassidim, Haim Kaplan, Yishay Mansour, Yossi Matias, Uri Stemmer |
Adversarially Robust Streaming Algorithms via Differential Privacy. |
J. ACM |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Filippo Bonchi, Fabio Gadducci, Aleks Kissinger, Pawel Sobocinski 0001, Fabio Zanasi |
String Diagram Rewrite Theory I: Rewriting with Frobenius Structure. |
J. ACM |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Sanjam Garg, Akshayaram Srinivasan |
Two-round Multiparty Secure Computation from Minimal Assumptions. |
J. ACM |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Dmitriy Zhuk, Barnaby Martin |
QCSP Monsters and the Demise of the Chen Conjecture. |
J. ACM |
2022 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #100 of 3139 (100 per page; Change: ) Pages: [ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ >>] |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")
data released under the ODC-BY 1.0 license