Search
Add filters:
Use filters to refine the search results.
Item hits:
| Publication Date | Article Title | Author(s) |
|---|---|---|
| 2014 | Nested Set Union | Larkin, Daniel H; Tarjan, Robert E |
| 2018 | The menu complexity of “one-and-a-half-dimensional” mechanism design | Saxena, Raghuvansh R; Schvartzman, Ariel; Weinberg, S Matthew |
| Dec-2018 | Cutting-edge cryptography through the lens of secret sharing | Komargodski, Ilan; Zhandry, Mark |
| 2018 | The Sample Complexity of Up-to-ε Multi-Dimensional Revenue Maximization | Gonczarowski, Yannai A; Weinberg, S Matthew |
| 2016 | How to Generate and Use Universal Samplers | Hofheinz, Dennis; Jager, Tibor; Khurana, Dakshita; Sahai, Amit; Waters, Brent, et al |
| 2019 | Efficient Verification of Network Fault Tolerance via Counterexample-Guided Refinement | Giannarakis, Nick; Beckett, Ryan; Mahajan, Ratul; Walker, David |
| 2018 | Digital Museum of Retinal Ganglion Cells with Dense Anatomy and Physiology | Bae, J Alexander; Mu, Shang; Kim, Jinseop S; Turner, Nicholas L; Tartavull, Ignacio, et al |
| 14-May-2018 | A loop-counting method for covariate-corrected low-rank biclustering of gene-expression and genome-wide association study data | Rangan, Aaditya V; McGrouther, Caroline C; Kelsoe, John; Schork, Nicholas; Stahl, Eli, et al |
| May-2014 | Smoothed analysis of tensor decompositions | Bhaskara, Aditya; Charikar, Moses; Moitra, Ankur; Vijayaraghavan, Aravindan |
| Jun-2017 | Compositional recurrence analysis revisited | Kincaid, Zachary; Breck, Jason; Boroujeni, Ashkan F; Reps, Thomas |