暂无分享,去创建一个
Haim Kaplan | Yishay Mansour | Amos Beimel | Kobbi Nissim | Thatchaphol Saranurak | Uri Stemmer | Y. Mansour | Haim Kaplan | Uri Stemmer | Kobbi Nissim | A. Beimel | Thatchaphol Saranurak
[1] Thomas Steinke,et al. Interactive fingerprinting codes and the hardness of preventing false discovery , 2014, 2016 Information Theory and Applications Workshop (ITA).
[2] Jonathan Ullman,et al. Preventing False Discovery in Interactive Data Analysis Is Hard , 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.
[3] Monika Henzinger,et al. Fully Dynamic Approximate Maximum Matching and Minimum Vertex Cover in O(log3 n) Worst Case Update Time , 2017, SODA.
[4] Giuseppe F. Italiano,et al. Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching , 2014, SODA.
[5] Oded Goldreich,et al. The random oracle methodology, revisited (preliminary version) , 1998, STOC '98.
[6] Thomas Steinke,et al. Tight Lower Bounds for Differentially Private Selection , 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).
[7] Ran Canetti,et al. The random oracle methodology, revisited , 2000, JACM.
[8] Mikkel Thorup,et al. Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity , 2001, JACM.
[9] Sebastian Krinninger,et al. Dynamic low-stretch trees via dynamic low-diameter decompositions , 2018, STOC.
[10] Monika Henzinger,et al. New deterministic approximation algorithms for fully dynamic matching , 2016, STOC.
[11] Thatchaphol Saranurak,et al. Dynamic Matrix Inverse: Improved Algorithms and Matching Conditional Lower Bounds , 2019, 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS).
[12] Krzysztof Onak,et al. Adversarially Robust Streaming via Dense-Sparse Trade-offs , 2022, Symposium on Simplicity in Algorithms (SOSA).
[13] Monika Henzinger,et al. Dynamic Maintenance of Low-Stretch Probabilistic Tree Embeddings with Applications , 2020, SODA.
[14] Julia Chuzhoy,et al. Decremental all-pairs shortest paths in deterministic near-linear time , 2021, STOC.
[15] Konstantinos Panagiotou,et al. Efficient Sampling Methods for Discrete Distributions , 2012, Algorithmica.
[16] Soumojit Sarkar,et al. Fully dynamic randomized algorithms for graph spanners , 2012, TALG.
[17] Virginia Vassilevska Williams,et al. New algorithms and hardness for incremental single-source shortest paths in directed graphs , 2020, STOC.
[18] S. Nakamoto,et al. Bitcoin: A Peer-to-Peer Electronic Cash System , 2008 .
[19] Amos Beimel,et al. Private Learning and Sanitization: Pure vs. Approximate Differential Privacy , 2013, APPROX-RANDOM.
[20] Soheil Behnezhad,et al. Fully Dynamic Maximal Independent Set with Polylogarithmic Update Time , 2019, 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS).
[21] Sayan Bhattacharya,et al. Deterministic Rounding of Dynamic Fractional Matchings , 2021, ICALP.
[22] Shang-Hua Teng,et al. Spectral Sparsification of Graphs , 2008, SIAM J. Comput..
[23] Christian Wulff-Nilsen,et al. Fully-dynamic minimum spanning forest with improved worst-case update time , 2016, STOC.
[24] Christian Wulff-Nilsen,et al. Decremental SSSP in Weighted Digraphs: Faster and Against an Adaptive Adversary , 2020, SODA.
[25] Richard Peng,et al. Fast Dynamic Cuts, Distances and Effective Resistances via Vertex Sparsifiers , 2020, 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS).
[26] Thatchaphol Saranurak,et al. Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary , 2020, ICALP.
[27] Shay Solomon,et al. Fully Dynamic Maximal Matching in Constant Update Time , 2016, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).
[28] Richard Peng,et al. A Deterministic Algorithm for Balanced Cut with Applications to Dynamic Connectivity, Flows, and Beyond , 2019, 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS).
[29] Vladimir Braverman,et al. Adversarial Robustness of Streaming Algorithms through Importance Sampling , 2021, NeurIPS.
[30] Adam O'Neill,et al. Accessing Data while Preserving Privacy , 2017, ArXiv.
[31] David P. Woodruff,et al. A Framework for Adversarially Robust Streaming Algorithms , 2020, SIGMOD Rec..
[32] Raef Bassily,et al. Algorithmic stability for adaptive data analysis , 2015, STOC.
[33] Kobbi Nissim,et al. Differentially Private Release and Learning of Threshold Functions , 2015, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science.
[34] Toniann Pitassi,et al. Preserving Statistical Validity in Adaptive Data Analysis , 2014, STOC.
[35] Janardhan Kulkarni,et al. Deterministically Maintaining a (2+ε)-Approximate Minimum Vertex Cover in O(1/ε2) Amortized Update Time , 2018, SODA.
[36] Richard Peng,et al. On Fully Dynamic Graph Sparsifiers , 2016, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).
[37] Surender Baswana,et al. Dynamic DFS in Undirected Graphs: breaking the O(m) barrier , 2015, SODA.
[38] Thatchaphol Saranurak,et al. Deterministic Algorithms for Decremental Shortest Paths via Layered Core Decomposition , 2020, SODA.
[39] Uri Zwick,et al. Improved dynamic reachability algorithms for directed graphs , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..
[40] Haim Kaplan,et al. Adversarially Robust Streaming Algorithms via Differential Privacy , 2020, NeurIPS.
[41] Christian Wulff-Nilsen,et al. Deterministic Algorithms for Decremental Approximate Shortest Paths: Faster and Simpler , 2020, SODA.
[42] Seth Neel,et al. Adaptive Machine Unlearning , 2021, NeurIPS.
[43] Mikkel Thorup,et al. Fully-Dynamic Min-Cut* , 2007, Comb..
[44] Christian Wulff-Nilsen,et al. Decremental strongly-connected components and single-source reachability in near-linear time , 2019, STOC.
[45] Piotr Sankowski,et al. Fast Dynamic Transitive Closure with Lookahead , 2010, Algorithmica.
[46] S. Chechik,et al. Fully Dynamic Maximal Independent Set in Expected Poly-Log Update Time , 2019, 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS).
[47] Haim Kaplan,et al. Privately Learning Thresholds: Closing the Exponential Gap , 2019, COLT.
[48] Eran Omri,et al. Tighter Bounds on Multi-Party Coin Flipping via Augmented Weak Martingales and Differentially Private Sampling , 2018, 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS).
[49] David R. Karger,et al. Minimum cuts in near-linear time , 1998, JACM.
[50] Mihir Bellare,et al. Random oracles are practical: a paradigm for designing efficient protocols , 1993, CCS '93.
[51] Christian Wulff-Nilsen,et al. Dynamic Minimum Spanning Forest with Subpolynomial Worst-Case Update Time , 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).
[52] Richard Peng,et al. Fully dynamic spectral vertex sparsifiers and applications , 2019, STOC.
[53] Julia Chuzhoy,et al. A new algorithm for decremental single-source shortest paths with applications to vertex-capacitated flow and cut problems , 2019, STOC.
[54] Tight Bounds for Adversarially Robust Streams and Sliding Windows via Difference Estimators , 2020, 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS).
[55] David Wajc,et al. Rounding dynamic matchings against an adaptive adversary , 2019, STOC.
[56] Monika Henzinger,et al. Decremental Single-Source Shortest Paths on Undirected Graphs in Near-Linear Total Update Time , 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.
[57] Amit Chakrabarti,et al. Adversarially Robust Coloring for Graph Streams , 2022, ITCS.
[58] Shiri Chechik,et al. Deterministic Partially Dynamic Single Source Shortest Paths for Sparse Graphs , 2017, SODA.
[59] Cynthia Dwork,et al. Calibrating Noise to Sensitivity in Private Data Analysis , 2006, TCC.
[60] Salil P. Vadhan,et al. Differential Privacy on Finite Computers , 2017, ITCS.
[61] Noga Alon,et al. Adversarial laws of large numbers and optimal regret in online classification , 2021, STOC.
[62] Aaron Bernstein,et al. Deterministic Partially Dynamic Single Source Shortest Paths in Weighted Graphs , 2017, ICALP.
[63] Shiri Chechik,et al. Deterministic decremental single source shortest paths: beyond the o(mn) bound , 2016, STOC.
[64] Edith Cohen,et al. A Framework for Adversarial Streaming via Differential Privacy and Difference Estimators , 2021, ArXiv.
[65] Thatchaphol Saranurak,et al. Dynamic spanning forest with worst-case update time: adaptive, Las Vegas, and O(n1/2 - ε)-time , 2017, STOC.
[66] Kobbi Nissim,et al. Concentration Bounds for High Sensitivity Functions Through Differential Privacy , 2019, J. Priv. Confidentiality.
[67] Guy N. Rothblum,et al. Boosting and Differential Privacy , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.
[68] Kunal Talwar,et al. Mechanism Design via Differential Privacy , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).
[69] Haim Kaplan,et al. Separating Adaptive Streaming from Oblivious Streaming Using the Bounded Storage Model , 2021, CRYPTO.