Alexander R. Block

Generating author description...

All published works

Action	Title	Year	Authors
+	Computationally Relaxed Locally Decodable Codes, Revisited	2023	Alexander R. Block Jeremiah Blocki
+	On Relaxed Locally Decodable Codes for Hamming and Insertion-Deletion Errors	2022	Alexander R. Block Jeremiah Blocki Kuan Cheng Elena Grigorescu Xin Li Yu Zheng Minshen Zhu
+ PDF Chat	Private and Resource-Bounded Locally Decodable Codes for Insertions and Deletions	2021	Alexander R. Block Jeremiah Blocki
+	Time- and Space-Efficient Arguments from Groups of Unknown Order	2021	Alexander R. Block Justin Holmgren Alon Rosen Ron D. Rothblum Pratik Soni
+	Locally Decodable/Correctable Codes for Insertions and Deletions	2020	Alexander R. Block Jeremiah Blocki Elena Grigorescu Shubhang Kulkarni Minshen Zhu
+	P 4 -free Partition and Cover Numbers.	2020	Alexander R. Block Simina Brânzei Hemanta K. Maji Himanshi K. Mehta Tamalika Mukherjee Hai H. Nguyen

Common Coauthors

Coauthor	Papers Together
Jeremiah Blocki	4
Elena Grigorescu	2
Himanshi K. Mehta	1
Justin Holmgren	1
Pratik Soni	1
Ron D. Rothblum	1
Alon Rosen	1
Hemanta K. Maji	1
Shubhang Kulkarni	1
Minshen Zhu	1
Xin Li	1
Kuan Cheng	1
Hai H. Nguyen	1
Yu Zheng	1
Minshen Zhu	1
Simina Brânzei	1
Tamalika Mukherjee	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+ PDF Chat	On single-deletion-correcting codes	2002	N. J. A. Sloane	3
+	Polynomial Time Decodable Codes for the Binary Deletion Channel	2018	Venkatesan Guruswami Ray Li	3
+	On List Decoding of Insertion and Deletion Errors	2019	Shu Liu Ivan Tjuawinata Chaoping Xing	3
+	Deletion Codes in the High-Noise and High-Rate Regimes	2017	Venkatesan Guruswami Carol Wang	3
+	Locally Decodable Codes with Randomized Encoding	2020	Kuan Cheng Xin Li Yu Zheng	3
+ PDF Chat	High-Rate Locally Correctable and Locally Testable Codes with Sub-Polynomial Query Complexity	2017	Swastik Kopparty Or Meir Noga Ron‐Zewi Shubhangi Saraf	3
+ PDF Chat	Optimal Document Exchange and New Codes for Insertions and Deletions	2019	Bernhard Haeupler	3
+ PDF Chat	Efficient Document Exchange and Error Correcting Codes with Asymmetric Information	2021	Kuan Cheng Xin Li	3
+	Synchronization strings: explicit constructions, local decoding, and applications	2018	Bernhard Haeupler Amirbehshad Shahrasbi	3
+	Efficient Low-Redundancy Codes for Correcting Multiple Deletions	2017	Joshua Brakensiek Venkatesan Guruswami Samuel Zbarsky	3
+ PDF Chat	Efficient Linear and Affine Codes for Correcting Insertions/Deletions	2021	Kuan Cheng Venkatesan Guruswami Bernhard Haeupler Xin Li	3
+	Exponential lower bound for 2-query locally decodable codes via a quantum argument	2003	Iordanis Kerenidis Ronald de Wolf	2
+ PDF Chat	Deterministic Document Exchange Protocols, and Almost Optimal Binary Codes for Edit Errors	2018	Kuan Cheng Zhengzhong Jin Xin Li Ke Wu	2
+	Expected length of the longest common subsequence for large alphabets	2004	Marcos Kiwi Martin Loebl Jiřı́ Matoušek	2
+	Expected Length of the Longest Common Subsequence for Large Alphabets	2004	Marcos Kiwi Martin Loebl Jiřı́ Matoušek	2
+	Block Edit Errors with Transpositions: Deterministic Document Exchange Protocols and Almost Optimal Binary Codes	2018	Kuan Cheng Zhengzhong Jin Xin Li Ke Wu	2
+	Optimally resilient codes for list-decoding from insertions and deletions	2020	Venkatesan Guruswami Bernhard Haeupler Amirbehshad Shahrasbi	2
+ PDF Chat	Sustained Space Complexity	2018	Joël Alwen Jeremiah Blocki Krzysztof Pietrzak	2
+	Efficient Document Exchange and Error Correcting Codes with Asymmetric Information	2020	Kuan Cheng Xin Li	2
+	On sparse graphs with dense long paths	1975	P. Erdős Ronald Graham Endre Szemerédi	2
+	Synchronization Strings: List Decoding for Insertions and Deletions	2018	Bernhard Haeupler Amirbehshad Shahrasbi Madhu Sudan	2
+	Near-linear time insertion-deletion codes and (1+ <i>ε</i> )-approximating edit distance via indexing	2019	Bernhard Haeupler Aviad Rubinstein Amirbehshad Shahrasbi	2
+	Synchronization strings: codes for insertions and deletions approaching the Singleton bound	2017	Bernhard Haeupler Amirbehshad Shahrasbi	2
+ PDF Chat	Coding against deletions in oblivious and online models	2018	Venkatesan Guruswami Ray Li	2
+ PDF Chat	Optimal Rate Code Constructions for Computationally Simple Channels	2016	Venkatesan Guruswami Adam C. Smith	2
+	Synchronization strings	2017	Bernhard Haeupler Amirbehshad Shahrasbi	1
+	Deterministic Document Exchange Protocols, and Almost Optimal Binary Codes for Edit Errors	2018	Kuan Cheng Zhengzhong Jin Xin Li Ke Wu	1
+ PDF Chat	Efficient Linear and Affine Codes for Correcting Insertions/Deletions	2023	Kuan Cheng Venkatesan Guruswami Bernhard Haeupler Xin Li	1
+ PDF Chat	Assisted Common Information With an Application to Secure Two-Party Sampling	2014	Vinod M. Prabhakaran Manoj Prabhakaran	1
+ PDF Chat	High-rate locally-correctable and locally-testable codes with sub-polynomial query complexity	2016	Swastik Kopparty Or Meir Noga Ron‐Zewi Shubhangi Saraf	1
+	On Single-Deletion-Correcting Codes	2002	N. J. A. Sloane	1
+	Generic Lower Bounds for Root Extraction and Signature Schemes in General Groups	2002	Ivan Damgård Maciej Koprowski	1
+	The star arboricity of graphs	1989	I. Algor Noga Alon	1
+ PDF Chat	Non-interactive correlation distillation, inhomogeneous Markov chains, and the reverse Bonami-Beckner inequality	2006	Elchanan Mossel Ryan O’Donnell Oded Regev Jeffrey E. Steif Benny Sudakov	1
+ PDF Chat	The Feasibility of Dynamically Granted Permissions: Aligning Mobile Privacy with User Preferences	2017	Primal Wijesekera Arjun Baokar Lynn Tsai Joel Reardon Serge Egelman David Wagner Konstantin Beznosov	1
+ PDF Chat	Synchronization Strings: Codes for Insertions and Deletions Approaching the Singleton Bound	2017	Bernhard Haeupler Amirbehshad Shahrasbi	1
+	Sorting with Recurrent Comparison Errors	2017	Barbara Geissmann Stefano Leucci Chih-Hung Liu Paolo Penna	1
+ PDF Chat	Deterministic Document Exchange Protocols and Almost Optimal Binary Codes for Edit Errors	2022	Kuan Cheng Zhengzhong Jin Xin Li Ke Wu	1
+ PDF Chat	Relaxed Locally Correctable Codes in Computationally Bounded Channels	2019	Jeremiah Blocki Venkata Gandikota Elena Grigorescu Samson Zhou	1
+ PDF Chat	Optimal k-Deletion Correcting Codes	2019	Jin Sima Jehoshua Bruck	1
+ PDF Chat	Coding Against Deletions in Oblivious and Online Models	2020	Venkatesan Guruswami Ray Li	1
+	On Locally Decodable Codes in Resource Bounded Channels	2019	Jeremiah Blocki Shubhang Kulkarni Samson Zhou	1
+	Efficient Linear and Affine Codes for Correcting Insertions/Deletions	2020	Kuan Cheng Venkatesan Guruswami Bernhard Haeupler Xin Li	1
+	Locally Decodable/Correctable Codes for Insertions and Deletions	2020	Alexander R. Block Jeremiah Blocki Elena Grigorescu Shubhang Kulkarni Minshen Zhu	1
+	Dory: Efficient, Transparent arguments for Generalised Inner Products and Polynomial Commitments.	2020	Jonathan Lee	1
+ PDF Chat	Private and Resource-Bounded Locally Decodable Codes for Insertions and Deletions	2021	Alexander R. Block Jeremiah Blocki	1
+	Time- and Space-Efficient Arguments from Groups of Unknown Order	2021	Alexander R. Block Justin Holmgren Alon Rosen Ron D. Rothblum Pratik Soni	1
+	Relaxed Locally Correctable Codes in Computationally Bounded Channels	2021	Jeremiah Blocki Venkata Gandikota Elena Grigorescu Samson Zhou	1
+ PDF Chat	Synchronization Strings: Codes for Insertions and Deletions Approaching the Singleton Bound	2021	Bernhard Haeupler Amirbehshad Shahrasbi	1
+ PDF Chat	Optimally Resilient Codes for List-Decoding From Insertions and Deletions	2021	Venkatesan Guruswami Bernhard Haeupler Amirbehshad Shahrasbi	1