| 1 |
Guarantees for Greedy Maximization of Non-submodular Functions with Applications
Andrew An Bian, Joachim M. Buhmann, ... (+2 more)
|
🔮
The Ethereal
|
cs.DM
|
254 |
9 years ago |
| 2 |
On Unbalanced Optimal Transport: An Analysis of Sinkhorn Algorithm
Khiem Pham, Khang Le, ... (+3 more)
|
🔮
The Ethereal
|
cs.CC
|
98 |
6 years ago |
| 3 |
DEEP-FRI: Sampling outside the box improves soundness
Eli Ben-Sasson, Lior Goldberg, ... (+2 more)
|
🔮
The Ethereal
|
cs.CC
|
84 |
7 years ago |
| 4 |
On a conjecture of Sokal concerning roots of the independence polynomial
Han Peters, Guus Regts
|
🔮
The Ethereal
|
math.CO
|
83 |
9 years ago |
| 5 |
A Zero Knowledge Sumcheck and its Applications
Alessandro Chiesa, Michael A. Forbes, Nicholas Spooner
|
🔮
The Ethereal
|
cs.CC
|
65 |
8 years ago |
| 6 |
Non-Malleable Extractors and Non-Malleable Codes: Partially Optimal Constructions
Xin Li
|
🔮
The Ethereal
|
cs.CC
|
54 |
7 years ago |
| 7 |
Improving Viterbi is Hard: Better Runtimes Imply Faster Clique Algorithms
Arturs Backurs, Christos Tzamos
|
🔮
The Ethereal
|
cs.CC
|
48 |
9 years ago |
| 8 |
Weakly Submodular Maximization Beyond Cardinality Constraints: Does Randomization Help Greedy?
Lin Chen, Moran Feldman, Amin Karbasi
|
🔮
The Ethereal
|
cs.DM
|
48 |
8 years ago |
| 9 |
The Advantage of Truncated Permutations
Shoni Gilboa, Shay Gueron
|
🔮
The Ethereal
|
math.CO
|
30 |
9 years ago |
| 10 |
Faster Greedy MAP Inference for Determinantal Point Processes
Insu Han, Prabhanjan Kambadur, ... (+2 more)
|
🔮
The Ethereal
|
cs.DM
|
27 |
9 years ago |
| 11 |
Deep Packet Inspection in FPGAs via Approximate Nondeterministic Automata
Milan Češka, Vojtěch Havlena, ... (+7 more)
|
🔮
The Ethereal
|
cs.FL
|
20 |
6 years ago |
| 12 |
Hardness of RNA Folding Problem with Four Symbols
Yi-Jun Chang
|
🔮
The Ethereal
|
cs.CC
|
17 |
10 years ago |
| 13 |
On Probabilistic Checking in Perfect Zero Knowledge
Eli Ben-Sasson, Alessandro Chiesa, ... (+4 more)
|
🔮
The Ethereal
|
cs.CC
|
17 |
9 years ago |
| 14 |
A Tree Clock Data Structure for Causal Orderings in Concurrent Executions
Umang Mathur, Andreas Pavlogiannis, ... (+2 more)
|
🔮
The Ethereal
|
cs.LO
|
17 |
4 years ago |
| 15 |
Clique-Based Lower Bounds for Parsing Tree-Adjoining Grammars
Karl Bringmann, Philip Wellnitz
|
🔮
The Ethereal
|
cs.CC
|
13 |
8 years ago |
| 16 |
Best-of-Three Voting on Dense Graphs
Nan Kang, Nicolas Rivera
|
🔮
The Ethereal
|
cs.DM
|
13 |
7 years ago |
| 17 |
Average Shortest Path Length of Graphs of Diameter 3
Nobutaka Shimizu, Ryuhei Mori
|
🔮
The Ethereal
|
cs.DM
|
10 |
9 years ago |
| 18 |
Faster Binary Mean Computation Under Dynamic Time Warping
Nathan Schaar, Vincent Froese, Rolf Niedermeier
|
🔮
The Ethereal
|
cs.DM
|
9 |
6 years ago |
| 19 |
Rotational analysis of ChaCha permutation
Stefano Barbero, Emanuele Bellini, Rusydi Makarim
|
🔮
The Ethereal
|
math.CO
|
9 |
5 years ago |
| 20 |
Schwartz-Zippel for multilinear polynomials mod N
Benedikt Bünz, Ben Fisch
|
🔮
The Ethereal
|
cs.DM
|
8 |
3 years ago |
| 21 |
Some intriguing upper bounds for separating hash families
Gennian Ge, Chong Shangguan, Xin Wang
|
🔮
The Ethereal
|
math.CO
|
7 |
8 years ago |
| 22 |
Balanced Allocations in Batches: Simplified and Generalized
Dimitrios Los, Thomas Sauerwald
|
🔮
The Ethereal
|
cs.DM
|
7 |
4 years ago |
| 23 |
Graph Motif Problems Parameterized by Dual
Guillaume Fertin, Christian Komusiewicz
|
🔮
The Ethereal
|
cs.CC
|
5 |
6 years ago |
| 24 |
On the Inner Product Predicate and a Generalization of Matching Vector Families
Balthazar Bauer, Jevgēnijs Vihrovs, Hoeteck Wee
|
🔮
The Ethereal
|
cs.CC
|
3 |
7 years ago |
| 25 |
Quantum and Classical Algorithms for Bounded Distance Decoding
Richard Allen, Ratip Emin Berker, ... (+2 more)
|
🔮
The Ethereal
|
cs.CC
|
3 |
4 years ago |
| 26 |
Permutation rotation-symmetric S-boxes, liftings and affine equivalence
Tron Omland, Pantelimon Stanica
|
🔮
The Ethereal
|
math.CO
|
2 |
4 years ago |
| 27 |
On the compressiveness of the Burrows-Wheeler transform
Hideo Bannai, Tomohiro I, Yuto Nakashima
|
🔮
The Ethereal
|
cs.DM
|
2 |
1 year ago |
| 28 |
Hardness of Range Avoidance and Proof Complexity Generators from Demi-Bits
Hanlin Ren, Yichuan Wang, Yan Zhong
|
🔮
The Ethereal
|
cs.CC
|
2 |
4 months ago |
| 29 |
Longest Common Subsequence on Weighted Sequences
Evangelos Kipouridis, Kostas Tsichlas
|
🔮
The Ethereal
|
cs.CC
|
1 |
7 years ago |
| 30 |
Perfect Zero-Knowledge PCPs for #P
Tom Gur, Jack O'Connor, Nicholas Spooner
|
🔮
The Ethereal
|
cs.CC
|
1 |
2 years ago |
| 31 |
Tightening I/O Lower Bounds through the Hourglass Dependency Pattern
Lionel Eyraud-Dubois, Guillaume Iooss, ... (+2 more)
|
🔮
The Ethereal
|
cs.CC
|
0 |
1 year ago |
| 32 |
A Zero-Knowledge PCP Theorem
Tom Gur, Jack O'Connor, Nicholas Spooner
|
🔮
The Ethereal
|
cs.CC
|
0 |
1 year ago |
| 33 |
The Planted Orthogonal Vectors Problem
David Kühnemann, Adam Polak, Alon Rosen
|
🔮
The Ethereal
|
cs.CC
|
0 |
11 months ago |
| 34 |
Decoding Balanced Linear Codes With Preprocessing
Andrej Bogdanov, Rohit Chatterjee, ... (+2 more)
|
🔮
The Ethereal
|
cs.CC
|
0 |
5 months ago |