|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 987 occurrences of 621 keywords
|
|
|
Results
Found 3143 publication records. Showing 3143 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
14 | Fan Zhang 0010, Bolin Yang, Bojie Yang, Yiran Zhang, Shivam Bhasin, Kui Ren 0001 |
Fluctuating Power Logic: SCA Protection by $V_{DD}$ Randomization at the Cell-level. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AsianHOST ![In: Asian Hardware Oriented Security and Trust Symposium, AsianHOST 2019, Xi'an, China, December 16-17, 2019, pp. 1-6, 2019, IEEE, 978-1-7281-3544-1. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Philip T. G. Jackson, Amir Atapour Abarghouei, Stephen Bonner, Toby P. Breckon, Boguslaw Obara |
Style Augmentation: Data Augmentation via Style Randomization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CVPR Workshops ![In: IEEE Conference on Computer Vision and Pattern Recognition Workshops, CVPR Workshops 2019, Long Beach, CA, USA, June 16-20, 2019, pp. 83-92, 2019, Computer Vision Foundation / IEEE. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
14 | Samira Pouyanfar, Muneeb Saleem, Nikhil George, Shu-Ching Chen |
ROADS: Randomization for Obstacle Avoidance and Driving in Simulation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CVPR Workshops ![In: IEEE Conference on Computer Vision and Pattern Recognition Workshops, CVPR Workshops 2019, Long Beach, CA, USA, June 16-20, 2019, pp. 78-87, 2019, Computer Vision Foundation / IEEE. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
14 | Samira Pouyanfar, Muneeb Saleem, Nikhil George, Shu-Ching Chen |
ROADS: Randomization for Obstacle Avoidance and Driving in Simulation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CVPR Workshops ![In: IEEE Conference on Computer Vision and Pattern Recognition Workshops, CVPR Workshops 2019, Long Beach, CA, USA, June 16-20, 2019, pp. 1267-1276, 2019, Computer Vision Foundation / IEEE. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
14 | Zhiyong Jin, Yongfu Chen, Tian Liu, Kai Li, Zhenting Wang, Jiongzhi Zheng |
A Novel and Fine-grained Heap Randomization Allocation Strategy for Effectively Alleviating Heap Buffer Overflow Vulnerabilities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICMAI ![In: Proceedings of the 4th International Conference on Mathematics and Artificial Intelligence, ICMAI 2019, Chegndu, China, April 12 - 15, 2019, pp. 115-122, 2019, ACM, 978-1-4503-6258-0. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Mitra Nasri, Thidapat Chantem, Gedare Bloom, Ryan M. Gerdes |
On the Pitfalls and Vulnerabilities of Schedule Randomization Against Schedule-Based Attacks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTAS ![In: 25th IEEE Real-Time and Embedded Technology and Applications Symposium, RTAS 2019, Montreal, QC, Canada, April 16-18, 2019, pp. 103-116, 2019, IEEE, 978-1-7281-0678-6. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Chengqian Che, Zhou Xian, Xiangrui Zeng, Xin Gao 0001, Min Xu 0009 |
Domain Randomization for Macromolecule Structure Classification and Segmentation in Electron Cyro-tomograms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIBM ![In: 2019 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2019, San Diego, CA, USA, November 18-21, 2019, pp. 6-11, 2019, IEEE, 978-1-7281-1867-3. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Ge Li, Vishnuvardhan V. Iyer, Michael Orshansky |
Securing AES against Localized EM Attacks through Spatial Randomization of Dataflow. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HOST ![In: IEEE International Symposium on Hardware Oriented Security and Trust, HOST 2019, McLean, VA, USA, May 5-10, 2019, pp. 191-197, 2019, IEEE, 978-1-5386-8064-3. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Rafael Pinot, Laurent Meunier, Alexandre Araujo, Hisashi Kashima, Florian Yger, Cédric Gouy-Pailler, Jamal Atif |
Theoretical evidence for adversarial robustness through randomization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
NeurIPS ![In: Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, NeurIPS 2019, December 8-14, 2019, Vancouver, BC, Canada., pp. 11838-11848, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
14 | Tom Bruls, Horia Porav, Lars Kunze, Paul Newman 0001 |
Generating All the Roads to Rome: Road Layout Randomization for Improved Road Marking Segmentation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITSC ![In: 2019 IEEE Intelligent Transportation Systems Conference, ITSC 2019, Auckland, New Zealand, October 27-30, 2019, pp. 831-838, 2019, IEEE, 978-1-5386-7024-8. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Dongil Hwang, Jangseop Shin, Jeehwan Kim, Yunheung Paek |
Data Randomization for Multi-Variant Execution Environment. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISOCC ![In: 2019 International SoC Design Conference, ISOCC 2019, Jeju, Korea (South), October 6-9, 2019, pp. 291-292, 2019, IEEE, 978-1-7281-2478-0. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Rawal Khirodkar, Donghyun Yoo, Kris M. Kitani |
Domain Randomization for Scene-Specific Car Detection and Pose Estimation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WACV ![In: IEEE Winter Conference on Applications of Computer Vision, WACV 2019, Waikoloa Village, HI, USA, January 7-11, 2019, pp. 1932-1940, 2019, IEEE, 978-1-7281-1975-5. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Roman Senkerik, Adam Viktorin, Tomas Kadavy, Michal Pluhacek, Ivan Zelinka |
Insight into Adaptive Differential Evolution Variants with Unconventional Randomization Schemes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SEMCCO/FANCCO ![In: Swarm, Evolutionary, and Memetic Computing and Fuzzy and Neural Computing - 7th International Conference, SEMCCO 2019, and 5th International Conference, FANCCO 2019, Maribor, Slovenia, July 10-12, 2019, Revised Selected Papers, pp. 177-188, 2019, Springer, 978-3-030-37837-0. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Dimitris Achlioptas, László A. Végh (eds.) |
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2 The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
14 | Timothy NeCamp, Josh Gardner, Christopher Brooks 0001 |
Beyond A/B Testing: Sequential Randomization for Developing Interventions in Scaled Digital Learning Environments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LAK ![In: Proceedings of the 9th International Conference on Learning Analytics & Knowledge, LAK 2019, Tempe, AZ, USA, March 4-8, 2019, pp. 539-548, 2019, ACM, 978-1-4503-6256-6. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Ferdinand Brasser, Srdjan Capkun, Alexandra Dmitrienko, Tommaso Frassetto, Kari Kostiainen, Ahmad-Reza Sadeghi |
DR.SGX: automated and adjustable side-channel protection for SGX using data location randomization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACSAC ![In: Proceedings of the 35th Annual Computer Security Applications Conference, ACSAC 2019, San Juan, PR, USA, December 09-13, 2019, pp. 788-800, 2019, ACM, 978-1-4503-7628-0. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Jonathan Joseph Chipman |
Sequential Rematched Randomization and Adaptive Monitoring with the Second-Generation p-Value to increase the efficiency and efficacy of Randomized Clinical Trials. ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2019 |
RDF |
|
14 | Eric Allender, Martin Farach-Colton, Meng-Tsung Tsai |
Syntactic Separation of Subset Satisfiability Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 16:1-16:23, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Rohit Agrawal 0002 |
Samplers and Extractors for Unbounded Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 59:1-59:21, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Benjamin Moseley, Maxim Sviridenko |
Submodular Optimization with Contention Resolution Extensions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 3:1-3:17, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Irit Dinur, Konstantin Golubev |
Direct Sum Testing: The General Case. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 40:1-40:11, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Rocco A. Servedio, Li-Yang Tan |
Improved Pseudorandom Generators from Pseudorandom Multi-Switching Lemmas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 45:1-45:23, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | David Ellis Hershkowitz, R. Ravi 0001, Sahil Singla 0001 |
Prepare for the Expected Worst: Algorithms for Reconfigurable Resources Under Uncertainty. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 4:1-4:19, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Fu Li, David Zuckerman |
Improved Extractors for Recognizable and Algebraic Sources. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 72:1-72:22, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Ioannis Z. Emiris, Vasilis Margonis, Ioannis Psarros |
Near-Neighbor Preserving Dimension Reduction for Doubling Subsets of l1. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 47:1-47:13, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Gary L. Miller, Noel J. Walkington, Alex L. Wang |
Hardy-Muckenhoupt Bounds for Laplacian Eigenvalues. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 8:1-8:19, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Kent Quanrud |
Fast and Deterministic Approximations for k-Cut. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 23:1-23:20, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Ronitt Rubinfeld, Arsen Vasilyan |
Approximating the Noise Sensitivity of a Monotone Boolean Function. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 52:1-52:17, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Vladimir Braverman, Harry Lang, Enayat Ullah, Samson Zhou |
Improved Algorithms for Time Decay Streams. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 27:1-27:17, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Alexander Golovnev, Alexander S. Kulikov, Alexander Logunov, Ivan Mihajlin, Maksim Nikolaev |
Collapsing Superstring Conjecture. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 26:1-26:23, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Eden Chlamtác, Michael Dinitz, Thomas Robinson |
Approximating the Norms of Graph Spanners. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 11:1-11:22, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Domagoj Bradac, Sahil Singla 0001, Goran Zuzic |
(Near) Optimal Adaptivity Gaps for Stochastic Multi-Value Probing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 49:1-49:21, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Frank Ban, Xi Chen 0001, Rocco A. Servedio, Sandip Sinha |
Efficient Average-Case Population Recovery in the Presence of Insertions and Deletions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 44:1-44:18, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Josep Díaz, Mordecai J. Golin |
The Expected Number of Maximal Points of the Convolution of Two 2-D Distributions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 35:1-35:14, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Neeraj Kumar 0004, Stavros Sintos, Subhash Suri |
The Maximum Exposure Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 19:1-19:20, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Michael Anastos, Peleg Michaeli, Samantha Petti |
Thresholds in Random Motif Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 66:1-66:19, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Zongchen Chen, Santosh S. Vempala |
Optimal Convergence Rate of Hamiltonian Monte Carlo for Strongly Logconcave Distributions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 64:1-64:12, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Andreas S. Schulz, Rajan Udwani |
Robust Appointment Scheduling with Heterogeneous Costs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 25:1-25:17, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Jack Murtagh, Omer Reingold, Aaron Sidford, Salil P. Vadhan |
Deterministic Approximation of Random Walks in Small Space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 42:1-42:22, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Vikraman Arvind, Abhranil Chatterjee 0001, Rajit Datta, Partha Mukhopadhyay |
Efficient Black-Box Identity Testing for Free Group Algebras. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 57:1-57:16, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Matthew Fahrbach, Dana Randall |
Slow Mixing of Glauber Dynamics for the Six-Vertex Model in the Ordered Phases. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 37:1-37:20, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Dimitris Fotakis 0001, Jannik Matuschke, Orestis Papadigenopoulos |
Malleable Scheduling Beyond Identical Machines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 17:1-17:14, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Umang Bhaskar, Gunjan Kumar |
The Complexity of Partial Function Extension for Coverage Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 30:1-30:21, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Alon Eden, Uriel Feige, Michal Feldman |
Max-Min Greedy Matching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 7:1-7:23, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Chao Liao, Jiabao Lin, Pinyan Lu, Zhenyu Mao |
Counting Independent Sets and Colorings on Random Regular Bipartite Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 34:1-34:12, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Avraham Ben-Aroya, Gil Cohen, Dean Doron, Amnon Ta-Shma |
Two-Source Condensers with Low Error and Small Entropy Gap via Entropy-Resilient Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 43:1-43:20, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Charilaos Efthymiou 0001, Andreas Galanis, Thomas P. Hayes, Daniel Stefankovic, Eric Vigoda |
Improved Strong Spatial Mixing for Colorings on Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 48:1-48:16, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Chien-Chung Huang, Mathieu Mari, Claire Mathieu, Joseph S. B. Mitchell, Nabil H. Mustafa |
Maximizing Covered Area in the Euclidean Plane with Connectivity Constraint. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 32:1-32:21, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | |
Front Matter, Table of Contents, Preface, Conference Organization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 0:1-0:22, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Grant Schoenebeck, Biaoshuai Tao, Fang-Yi Yu |
Think Globally, Act Locally: On the Optimal Seeding for Nonsubmodular Influence Maximization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 39:1-39:20, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Meena Jagadeesan |
Simple Analysis of Sparse, Sign-Consistent JL. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 61:1-61:20, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Devvrit, Ravishankar Krishnaswamy, Nived Rajaraman |
Robust Correlation Clustering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 33:1-33:18, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Ray Li, Mary Wootters |
Lifted Multiplicity Codes and the Disjoint Repair Group Property. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 38:1-38:18, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Manuel Fernandez, David P. Woodruff, Taisuke Yasuda 0002 |
The Query Complexity of Mastermind with lp Distances. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 1:1-1:11, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Mika Göös, Thomas Watson 0001 |
A Lower Bound for Sampling Disjoint Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 51:1-51:13, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Ioana Oriana Bercea, Martin Groß 0001, Samir Khuller, Aounon Kumar, Clemens Rösner, Daniel R. Schmidt, Melanie Schmidt 0001 |
On the Cost of Essentially Fair Clusterings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 18:1-18:22, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Swastik Kopparty, Nicolas Resch, Noga Ron-Zewi, Shubhangi Saraf, Shashwat Silas |
On List Recovery of High-Rate Tensor Codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 68:1-68:22, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Venkatesan Guruswami, Runzhou Tao |
Streaming Hardness of Unique Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 5:1-5:12, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Alexander Golovnev, Mika Göös, Daniel Reichman 0001, Igor Shinkar |
String Matching: Communication, Circuits, and Learning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 56:1-56:20, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Ilan Reuven Cohen, Alon Eden, Amos Fiat, Lukasz Jez |
Dynamic Pricing of Servers on Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 10:1-10:22, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Zongchen Chen, Andreas Galanis, Leslie Ann Goldberg, Will Perkins 0001, James Stewart 0001, Eric Vigoda |
Fast Algorithms at Low Temperatures via Markov Chains. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 41:1-41:14, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Roy Gotlib, Tali Kaufman |
Testing Odd Direct Sums Using High Dimensional Expanders. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 50:1-50:20, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Andrej Bogdanov, Nikhil S. Mande, Justin Thaler, Christopher Williamson |
Approximate Degree, Secret Sharing, and Concentration Phenomena. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 71:1-71:21, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Susanne Albers, Arindam Khan 0001, Leon Ladewig |
Improved Online Algorithms for Knapsack and GAP in the Random Order Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 22:1-22:23, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Per Austrin, Aleksa Stankovic |
Global Cardinality Constraints Make Approximating Some Max-2-CSPs Harder. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 24:1-24:17, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Suprovat Ghoshal, Anand Louis, Rahul Raychaudhury |
Approximation Algorithms for Partially Colorable Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 28:1-28:20, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Shyam Narayanan |
Pairwise Independent Random Walks Can Be Slightly Unbounded. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 63:1-63:19, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Grigory Yaroslavtsev, Samson Zhou |
Approximate F2-Sketching of Valuation Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 69:1-69:21, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Prahladh Harsha, Subhash Khot, Euiwoong Lee, Devanathan Thiruvenkatachari |
Improved 3LIN Hardness via Linear Label Cover. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 9:1-9:16, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Sevag Gharibian, Ojas Parekh |
Almost Optimal Classical Approximation Algorithms for a Quantum Generalization of Max-Cut. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 31:1-31:17, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Chi-Ning Chou, Zhixian Lei, Preetum Nakkiran |
Tracking the l2 Norm with Constant Update Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 2:1-2:15, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Mark Bun, Justin Thaler |
The Large-Error Approximate Degree of AC0. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 55:1-55:16, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Dhruv Rohatgi |
Conditional Hardness of Earth Mover Distance. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 12:1-12:17, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Rajesh Jayaram, David P. Woodruff |
Towards Optimal Moment Estimation in Streaming and Distributed Models. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 29:1-29:21, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Antonio Blanca, Reza Gheissari, Eric Vigoda |
Random-Cluster Dynamics in Z2: Rapid Mixing with General Boundary Conditions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 67:1-67:19, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Svante Janson, Gregory B. Sorkin |
Successive Minimum Spanning Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 60:1-60:16, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Charlotte Knierim, Johannes Lengler, Pascal Pfister, Ulysse Schaller, Angelika Steger |
The Maximum Label Propagation Algorithm on Sparse Random Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 58:1-58:15, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Reyna Hulett |
Single-Elimination Brackets Fail to Approximate Copeland Winner. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 13:1-13:20, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Vladimir Braverman, Dan Feldman, Harry Lang, Daniela Rus |
Streaming Coreset Constructions for M-Estimators. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 62:1-62:15, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Sarah Cannon, Joshua J. Daymude, Cem Gökmen, Dana Randall, Andréa W. Richa |
A Local Stochastic Algorithm for Separation in Heterogeneous Self-Organizing Particle Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 54:1-54:22, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Amit Chakrabarti, Prantar Ghosh |
Streaming Verification of Graph Computations via Graph Structure. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 70:1-70:20, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Timothy Carpenter, Ario Salmasi, Anastasios Sidiropoulos |
Routing Symmetric Demands in Directed Minor-Free Graphs with Constant Congestion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 14:1-14:15, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Sainyam Galhotra, Arya Mazumdar, Soumyabrata Pal, Barna Saha |
Connectivity of Random Annulus Graphs and the Geometric Block Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 53:1-53:23, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Amos Beimel, Kobbi Nissim, Mohammad Zaheri |
Exploring Differential Obliviousness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 65:1-65:20, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Bruce Spang, Mary Wootters |
Unconstraining Graph-Constrained Group Testing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 46:1-46:20, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Arnold Filtser |
On Strong Diameter Padded Decompositions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 6:1-6:21, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Venkatesan Guruswami, Sai Sandeep |
Rainbow Coloring Hardness via Low Sensitivity Polymorphisms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 15:1-15:17, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Alexander Birx, Yann Disser, Kevin Schewior |
Improved Bounds for Open Online Dial-a-Ride on the Line. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 21:1-21:22, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Michael Anastos, Alan M. Frieze |
On a Connectivity Threshold for Colorings of Random Graphs and Hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 36:1-36:10, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | Sagar Kale |
Small Space Stream Summary for Matroid Center. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 20:1-20:22, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
14 | |
Social Network Randomization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Encyclopedia of Social Network Analysis and Mining. 2nd Ed. ![In: Encyclopedia of Social Network Analysis and Mining, 2nd Edition, 2018, Springer. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
14 | Ashwin Machanavajjhala, Johannes Gehrke |
Randomization Methods to Ensure Data Privacy. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Encyclopedia of Database Systems (2nd ed.) ![In: Encyclopedia of Database Systems, Second Edition, 2018, Springer, 978-1-4614-8266-6. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
14 | Santanu S. Dey, Andres Iroume, Marco Molinaro 0001, Domenico Salvagnin |
Improving the Randomization Step in Feasibility Pump. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Optim. ![In: SIAM J. Optim. 28(1), pp. 355-378, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
14 | Guodong Sun, Xiaoyue Zhang, Xueyan Xia, Xingjian Ding |
Randomization-Embedded Greed: Pursuing More Platform Profits in Mobile Crowd Sensing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Access ![In: IEEE Access 6, pp. 78559-78574, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
14 | Sergej M. Ermakov, Svetlana N. Leora |
Remarks on randomization of quasi-random numbers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Monte Carlo Methods Appl. ![In: Monte Carlo Methods Appl. 24(1), pp. 139-145, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
14 | Jose Daniel Velazco Garcia, Mohammed Awad, Ernst L. Leiss |
Randomization of Statistical Queries of Type Median: A Simulation Approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Sci. ![In: J. Comput. Sci. 14(1), pp. 67-80, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
14 | Mario Latendresse, Peter D. Karp |
Evaluation of reaction gap-filling accuracy by randomization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BMC Bioinform. ![In: BMC Bioinform. 19(1), pp. 53:1-53:13, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
14 | Andrzej Pelc |
Use of information, memory and randomization in asynchronous gathering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Syst. Sci. ![In: J. Comput. Syst. Sci. 94, pp. 193-205, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
14 | Alexey R. Nurmukhametov, E. A. Zhabotinskiy, Shamil F. Kurmangaleev, Sergey S. Gaissaryan, Alexey V. Vishnyakov |
Fine-Grained Address Space Layout Randomization on Program Load. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Program. Comput. Softw. ![In: Program. Comput. Softw. 44(5), pp. 363-370, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
14 | Timothy NeCamp, Josh Gardner, Christopher Brooks 0001 |
Beyond A/B Testing: Sequential Randomization for Developing Interventions in Scaled Digital Learning Environments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1810.11185, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
|
|