Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
1 | Prerona Chatterjee |
Separating ABPs and Some Structured Formulas in the Non-Commutative Setting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 36th Computational Complexity Conference, CCC 2021, July 20-23, 2021, Toronto, Ontario, Canada (Virtual Conference)., pp. 7:1-7:24, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-193-1. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Mark Braverman, Dor Minzer |
Optimal Tiling of the Euclidean Space Using Permutation-Symmetric Bodies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 36th Computational Complexity Conference, CCC 2021, July 20-23, 2021, Toronto, Ontario, Canada (Virtual Conference)., pp. 5:1-5:48, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-193-1. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Uma Girish, Avishay Tal, Kewen Wu 0001 |
Fourier Growth of Parity Decision Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 36th Computational Complexity Conference, CCC 2021, July 20-23, 2021, Toronto, Ontario, Canada (Virtual Conference)., pp. 39:1-39:36, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-193-1. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Pranjal Dutta, Gorav Jindal, Anurag Pandey 0001, Amit Sinhababu |
Arithmetic Circuit Complexity of Division and Truncation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 36th Computational Complexity Conference, CCC 2021, July 20-23, 2021, Toronto, Ontario, Canada (Virtual Conference)., pp. 25:1-25:36, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-193-1. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Markus Bläser, Julian Dörfler, Christian Ikenmeyer |
On the Complexity of Evaluating Highest Weight Vectors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 36th Computational Complexity Conference, CCC 2021, July 20-23, 2021, Toronto, Ontario, Canada (Virtual Conference)., pp. 29:1-29:36, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-193-1. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Pravesh K. Kothari, Peter Manohar |
A Stress-Free Sum-Of-Squares Lower Bound for Coloring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 36th Computational Complexity Conference, CCC 2021, July 20-23, 2021, Toronto, Ontario, Canada (Virtual Conference)., pp. 23:1-23:21, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-193-1. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Alexander Golovnev, Ishay Haviv |
The (Generalized) Orthogonality Dimension of (Generalized) Kneser Graphs: Bounds and Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 36th Computational Complexity Conference, CCC 2021, July 20-23, 2021, Toronto, Ontario, Canada (Virtual Conference)., pp. 8:1-8:15, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-193-1. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Simon Apers, Troy Lee |
Quantum Complexity of Minimum Cut. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 36th Computational Complexity Conference, CCC 2021, July 20-23, 2021, Toronto, Ontario, Canada (Virtual Conference)., pp. 28:1-28:33, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-193-1. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Oded Goldreich 0001, Avi Wigderson |
Robustly Self-Ordered Graphs: Constructions and Applications to Property Testing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 36th Computational Complexity Conference, CCC 2021, July 20-23, 2021, Toronto, Ontario, Canada (Virtual Conference)., pp. 12:1-12:74, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-193-1. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Valentine Kabanets (eds.) |
36th Computational Complexity Conference, CCC 2021, July 20-23, 2021, Toronto, Ontario, Canada (Virtual Conference). ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-193-1 The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
1 | Pavel Hrubes, Amir Yehudayoff |
Shadows of Newton Polytopes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 36th Computational Complexity Conference, CCC 2021, July 20-23, 2021, Toronto, Ontario, Canada (Virtual Conference)., pp. 9:1-9:23, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-193-1. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Mrinal Kumar 0001, Ben Lee Volk |
A Lower Bound on Determinantal Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 36th Computational Complexity Conference, CCC 2021, July 20-23, 2021, Toronto, Ontario, Canada (Virtual Conference)., pp. 4:1-4:12, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-193-1. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Dori Medini, Amir Shpilka |
Hitting Sets and Reconstruction for Dense Orbits in VP_{e} and ΣΠΣ Circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 36th Computational Complexity Conference, CCC 2021, July 20-23, 2021, Toronto, Ontario, Canada (Virtual Conference)., pp. 19:1-19:27, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-193-1. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Anurag Anshu, Shalev Ben-David, Srijita Kundu |
On Query-To-Communication Lifting for Adversary Bounds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 36th Computational Complexity Conference, CCC 2021, July 20-23, 2021, Toronto, Ontario, Canada (Virtual Conference)., pp. 30:1-30:39, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-193-1. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Isolde Adler, Noleen Köhler, Pan Peng 0001 |
GSF-Locality Is Not Sufficient For Proximity-Oblivious Testing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 36th Computational Complexity Conference, CCC 2021, July 20-23, 2021, Toronto, Ontario, Canada (Virtual Conference)., pp. 34:1-34:27, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-193-1. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Gil Cohen, Tal Yankovitz |
Rate Amplification and Query-Efficient Distance Amplification for Linear LCC and LDC. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 36th Computational Complexity Conference, CCC 2021, July 20-23, 2021, Toronto, Ontario, Canada (Virtual Conference)., pp. 1:1-1:57, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-193-1. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Edward Pyne, Salil P. Vadhan |
Pseudodistributions That Beat All Pseudorandom Generators (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 36th Computational Complexity Conference, CCC 2021, July 20-23, 2021, Toronto, Ontario, Canada (Virtual Conference)., pp. 33:1-33:15, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-193-1. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Peter Bürgisser, M. Levent Dogan, Visu Makam, Michael Walter 0005, Avi Wigderson |
Polynomial Time Algorithms in Invariant Theory for Torus Actions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 36th Computational Complexity Conference, CCC 2021, July 20-23, 2021, Toronto, Ontario, Canada (Virtual Conference)., pp. 32:1-32:30, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-193-1. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Rahul Jain 0001, Srijita Kundu |
A Direct Product Theorem for One-Way Quantum Communication. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 36th Computational Complexity Conference, CCC 2021, July 20-23, 2021, Toronto, Ontario, Canada (Virtual Conference)., pp. 27:1-27:28, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-193-1. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Ivan Mihajlin, Alexander Smal |
Toward Better Depth Lower Bounds: The XOR-KRW Conjecture. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 36th Computational Complexity Conference, CCC 2021, July 20-23, 2021, Toronto, Ontario, Canada (Virtual Conference)., pp. 38:1-38:24, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-193-1. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Troy Lee, Tongyang Li, Miklos Santha, Shengyu Zhang 0002 |
On the Cut Dimension of a Graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 36th Computational Complexity Conference, CCC 2021, July 20-23, 2021, Toronto, Ontario, Canada (Virtual Conference)., pp. 15:1-15:35, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-193-1. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Prerona Chatterjee, Mrinal Kumar 0001, Adrian She, Ben Lee Volk |
A Quadratic Lower Bound for Algebraic Branching Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 35th Computational Complexity Conference, CCC 2020, July 28-31, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 2:1-2:21, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-156-6. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Eshan Chattopadhyay, Jyun-Jie Liao |
Optimal Error Pseudodistributions for Read-Once Branching Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 35th Computational Complexity Conference, CCC 2020, July 28-31, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 25:1-25:27, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-156-6. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Dominik Scheder, Navid Talebanfard |
Super Strong ETH Is True for PPSZ with Small Resolution Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 35th Computational Complexity Conference, CCC 2020, July 28-31, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 3:1-3:12, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-156-6. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Yuval Filmus, Yuval Ishai, Avi Kaplan, Guy Kindler |
Limits of Preprocessing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 35th Computational Complexity Conference, CCC 2020, July 28-31, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 17:1-17:22, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-156-6. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Rahul Ilango, Bruno Loff, Igor C. Oliveira |
NP-Hardness of Circuit Minimization for Multi-Output Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 35th Computational Complexity Conference, CCC 2020, July 28-31, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 22:1-22:36, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-156-6. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Mika Göös, Pritish Kamath, Katerina Sotiraki, Manolis Zampetakis |
On the Complexity of Modulo-q Arguments and the Chevalley - Warning Theorem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 35th Computational Complexity Conference, CCC 2020, July 28-31, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 19:1-19:42, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-156-6. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Gil Cohen, Shahar Samocha |
Palette-Alternating Tree Codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 35th Computational Complexity Conference, CCC 2020, July 28-31, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 11:1-11:29, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-156-6. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | |
Front Matter, Table of Contents, Preface, Conference Organization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 35th Computational Complexity Conference, CCC 2020, July 28-31, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 0:1-0:16, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-156-6. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Daniel Dadush, Samarth Tiwari |
On the Complexity of Branching Proofs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 35th Computational Complexity Conference, CCC 2020, July 28-31, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 34:1-34:35, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-156-6. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Markus Bläser, Christian Ikenmeyer, Meena Mahajan, Anurag Pandey 0001, Nitin Saurabh |
Algebraic Branching Programs, Border Complexity, and Tangent Spaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 35th Computational Complexity Conference, CCC 2020, July 28-31, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 21:1-21:24, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-156-6. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Jacques Dark, Christian Konrad 0001 |
Optimal Lower Bounds for Matching and Vertex Cover in Dynamic Graph Streams. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 35th Computational Complexity Conference, CCC 2020, July 28-31, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 30:1-30:14, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-156-6. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Aaron Potechin |
Sum of Squares Bounds for the Ordering Principle. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 35th Computational Complexity Conference, CCC 2020, July 28-31, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 38:1-38:37, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-156-6. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Rahul Ilango |
Connecting Perebor Conjectures: Towards a Search to Decision Reduction for Minimizing Formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 35th Computational Complexity Conference, CCC 2020, July 28-31, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 31:1-31:35, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-156-6. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Huck Bennett, Chris Peikert |
Hardness of Bounded Distance Decoding on Lattices in ℓp Norms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 35th Computational Complexity Conference, CCC 2020, July 28-31, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 36:1-36:21, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-156-6. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Alexander Kozachinskiy, Vladimir V. Podolskii |
Multiparty Karchmer - Wigderson Games and Threshold Circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 35th Computational Complexity Conference, CCC 2020, July 28-31, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 24:1-24:23, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-156-6. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Kuan Cheng, William M. Hoza |
Hitting Sets Give Two-Sided Derandomization of Small Space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 35th Computational Complexity Conference, CCC 2020, July 28-31, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 10:1-10:25, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-156-6. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Amit Sinhababu, Thomas Thierauf |
Factorization of Polynomials Given By Arithmetic Branching Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 35th Computational Complexity Conference, CCC 2020, July 28-31, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 33:1-33:19, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-156-6. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Michael E. Saks, Rahul Santhanam |
Circuit Lower Bounds from NP-Hardness of MCSP Under Turing Reductions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 35th Computational Complexity Conference, CCC 2020, July 28-31, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 26:1-26:13, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-156-6. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Shubhangi Saraf (eds.) |
35th Computational Complexity Conference, CCC 2020, July 28-31, 2020, Saarbrücken, Germany (Virtual Conference). ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-156-6 The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
1 | Hamed Hatami, Kaave Hosseini, Shachar Lovett |
Sign Rank vs Discrepancy. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 35th Computational Complexity Conference, CCC 2020, July 28-31, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 18:1-18:14, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-156-6. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Nikhil Gupta 0008, Chandan Saha 0001, Bhargav Thankey |
A Super-Quadratic Lower Bound for Depth Four Arithmetic Circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 35th Computational Complexity Conference, CCC 2020, July 28-31, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 23:1-23:31, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-156-6. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Scott Aaronson, Nai-Hui Chia, Han-Hsuan Lin, Chunhao Wang, Ruizhe Zhang 0001 |
On the Quantum Complexity of Closest Pair and Related Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 35th Computational Complexity Conference, CCC 2020, July 28-31, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 16:1-16:43, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-156-6. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Prasad Chaugule, Mrinal Kumar 0001, Nutan Limaye, Chandra Kanta Mohapatra, Adrian She, Srikanth Srinivasan 0001 |
Schur Polynomials Do Not Have Small Formulas If the Determinant Doesn't. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 35th Computational Complexity Conference, CCC 2020, July 28-31, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 14:1-14:27, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-156-6. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Shir Peleg, Amir Shpilka |
A Generalized Sylvester-Gallai Type Theorem for Quadratic Polynomials. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 35th Computational Complexity Conference, CCC 2020, July 28-31, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 8:1-8:33, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-156-6. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Ankit Garg, Christian Ikenmeyer, Visu Makam, Rafael Mendes de Oliveira, Michael Walter 0005, Avi Wigderson |
Search Problems in Algebraic Complexity, GCT, and Hardness of Generators for Invariant Rings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 35th Computational Complexity Conference, CCC 2020, July 28-31, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 12:1-12:17, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-156-6. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Susanna F. de Rezende, Jakob Nordström, Kilian Risse, Dmitry Sokolov 0001 |
Exponential Resolution Lower Bounds for Weak Pigeonhole Principle and Perfect Matching Formulas over Sparse Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 35th Computational Complexity Conference, CCC 2020, July 28-31, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 28:1-28:24, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-156-6. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Scott Aaronson, Robin Kothari, William Kretschmer, Justin Thaler |
Quantum Lower Bounds for Approximate Counting via Laurent Polynomials. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 35th Computational Complexity Conference, CCC 2020, July 28-31, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 7:1-7:47, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-156-6. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Robert Andrews 0003 |
Algebraic Hardness Versus Randomness in Low Characteristic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 35th Computational Complexity Conference, CCC 2020, July 28-31, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 37:1-37:32, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-156-6. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Dean Doron, Pooya Hatami, William M. Hoza |
Log-Seed Pseudorandom Generators via Iterated Restrictions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 35th Computational Complexity Conference, CCC 2020, July 28-31, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 6:1-6:36, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-156-6. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Sourav Chakraborty 0001, Arkadev Chattopadhyay, Nikhil S. Mande, Manaswi Paraashar |
Quantum Query-To-Communication Simulation Needs a Logarithmic Overhead. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 35th Computational Complexity Conference, CCC 2020, July 28-31, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 32:1-32:15, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-156-6. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Valentine Kabanets, Sajin Koroth, Zhenjian Lu, Dimitrios Myrisiotis, Igor C. Oliveira |
Algorithms and Lower Bounds for De Morgan Formulas of Low-Communication Leaf Gates. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 35th Computational Complexity Conference, CCC 2020, July 28-31, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 15:1-15:41, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-156-6. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Jin-Yi Cai, Tianyu Liu 0002, Pinyan Lu, Jing Yu |
Approximability of the Eight-Vertex Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 35th Computational Complexity Conference, CCC 2020, July 28-31, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 4:1-4:18, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-156-6. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Amey Bhangale, Subhash Khot |
Simultaneous Max-Cut Is Harder to Approximate Than Max-Cut. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 35th Computational Complexity Conference, CCC 2020, July 28-31, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 9:1-9:15, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-156-6. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Swastik Kopparty, Guy Moshkovitz, Jeroen Zuiddam |
Geometric Rank of Tensors and Subrank of Matrix Multiplication. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 35th Computational Complexity Conference, CCC 2020, July 28-31, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 35:1-35:21, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-156-6. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Matthew Coulson, Ewan Davies, Alexandra Kolla, Viresh Patel, Guus Regts |
Statistical Physics Approaches to Unique Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 35th Computational Complexity Conference, CCC 2020, July 28-31, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 13:1-13:27, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-156-6. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Mrinal Kumar 0001, Ben Lee Volk |
Lower Bounds for Matrix Factorization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 35th Computational Complexity Conference, CCC 2020, July 28-31, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 5:1-5:20, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-156-6. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Laurent Bartholdi, Michael Figelius, Markus Lohrey, Armin Weiß |
Groups with ALOGTIME-Hard Word Problems and PSPACE-Complete Circuit Value Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 35th Computational Complexity Conference, CCC 2020, July 28-31, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 29:1-29:29, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-156-6. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Avraham Ben-Aroya, Dean Doron, Amnon Ta-Shma |
Near-Optimal Erasure List-Decodable Codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 35th Computational Complexity Conference, CCC 2020, July 28-31, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 1:1-1:27, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-156-6. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Marvin Künnemann, Dániel Marx |
Finding Small Satisfying Assignments Faster Than Brute Force: A Fine-Grained Perspective into Boolean Constraint Satisfaction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 35th Computational Complexity Conference, CCC 2020, July 28-31, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 27:1-27:28, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-156-6. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Shuichi Hirahara |
Non-Disjoint Promise Problems from Meta-Computational View of Pseudorandom Generator Constructions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 35th Computational Complexity Conference, CCC 2020, July 28-31, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 20:1-20:47, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-156-6. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Gitanjali Baral, Nalin Asanka Gamagedara Arachchilage |
Building Confidence not to be Phished Through a Gamified Approach: Conceptualising User's Self-Efficacy in Phishing Threat Avoidance Behaviour. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Cybersecurity and Cyberforensics Conference, CCC 2019, Melbourne, Australia, May 8-9, 2019, pp. 102-110, 2019, IEEE, 978-1-7281-2600-5. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Mohiuddin Ahmed, Abu S. S. M. Barkat Ullah |
Performance Analysis of Hard Clustering Techniques for Big IoT Data Analytics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Cybersecurity and Cyberforensics Conference, CCC 2019, Melbourne, Australia, May 8-9, 2019, pp. 62-66, 2019, IEEE, 978-1-7281-2600-5. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Rahul Shokeen, Bharanidharan Shanmugam, Krishnan Kannoorpatti, Sami Azam, Mirjam Jonkman, Mamoun Alazab |
Vulnerabilities Analysis and Security Assessment Framework for the Internet of Things. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Cybersecurity and Cyberforensics Conference, CCC 2019, Melbourne, Australia, May 8-9, 2019, pp. 22-29, 2019, IEEE, 978-1-7281-2600-5. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Ahsan Aziz |
Coercion-Resistant E-Voting Scheme with Blind Signatures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Cybersecurity and Cyberforensics Conference, CCC 2019, Melbourne, Australia, May 8-9, 2019, pp. 143-151, 2019, IEEE, 978-1-7281-2600-5. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | |
Cybersecurity and Cyberforensics Conference, CCC 2019, Melbourne, Australia, May 8-9, 2019 ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![IEEE, 978-1-7281-2600-5 The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
1 | Vinayakumar R., Mamoun Alazab, Alireza Jolfaei, Soman K. P., Prabaharan Poornachandran |
Ransomware Triage Using Deep Learning: Twitter as a Case Study. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Cybersecurity and Cyberforensics Conference, CCC 2019, Melbourne, Australia, May 8-9, 2019, pp. 67-73, 2019, IEEE, 978-1-7281-2600-5. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Riaz Ullah Khan, Rajesh Kumar 0014, Mamoun Alazab, Xiaosong Zhang 0001 |
A Hybrid Technique To Detect Botnets, Based on P2P Traffic Similarity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Cybersecurity and Cyberforensics Conference, CCC 2019, Melbourne, Australia, May 8-9, 2019, pp. 136-142, 2019, IEEE, 978-1-7281-2600-5. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Ghassan Kbar, Ammar Alazab |
A Comprehensive Protection Method for Securing the Organization's Network Against Cyberattacks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Cybersecurity and Cyberforensics Conference, CCC 2019, Melbourne, Australia, May 8-9, 2019, pp. 118-122, 2019, IEEE, 978-1-7281-2600-5. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Riaz Ullah Khan, Xiaosong Zhang 0001, Mamoun Alazab, Rajesh Kumar 0014 |
An Improved Convolutional Neural Network Model for Intrusion Detection in Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Cybersecurity and Cyberforensics Conference, CCC 2019, Melbourne, Australia, May 8-9, 2019, pp. 74-77, 2019, IEEE, 978-1-7281-2600-5. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Mahmoud Bakkar, Ammar Alazab |
Information Security: Definitions, Threats and Management in Dubai Hospitals Context. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Cybersecurity and Cyberforensics Conference, CCC 2019, Melbourne, Australia, May 8-9, 2019, pp. 152-159, 2019, IEEE, 978-1-7281-2600-5. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Johnson I. Agbinya |
Human Palm Geometry Modelling for Biometric Security Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Cybersecurity and Cyberforensics Conference, CCC 2019, Melbourne, Australia, May 8-9, 2019, pp. 160-164, 2019, IEEE, 978-1-7281-2600-5. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Mahmoud Bakkar, Ammar Alazab |
Designing Security Intelligent Agent for Petrol Theft Prevention. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Cybersecurity and Cyberforensics Conference, CCC 2019, Melbourne, Australia, May 8-9, 2019, pp. 123-128, 2019, IEEE, 978-1-7281-2600-5. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Nahina Islam, Ammar Alazab, Mamoun Alazab |
A Reinforcement Learning Based Algorithm Towards Energy Efficient 5G Multi-Tier Network. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Cybersecurity and Cyberforensics Conference, CCC 2019, Melbourne, Australia, May 8-9, 2019, pp. 96-101, 2019, IEEE, 978-1-7281-2600-5. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Walid K. A. Hasan, Yachao Ran, Johnson I. Agbinya, Guiyun Tian 0001 |
A Survey of Energy Efficient IoT Network in Cloud Environment. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Cybersecurity and Cyberforensics Conference, CCC 2019, Melbourne, Australia, May 8-9, 2019, pp. 13-21, 2019, IEEE, 978-1-7281-2600-5. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Yasamin Alagrash, Faisal Alghayadh, Ahmad Alshammari, Debatosh Debnath |
Cloud Computing: A Framework for Balancing Accountability and Privacy Based on Multi-Agent System. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Cybersecurity and Cyberforensics Conference, CCC 2019, Melbourne, Australia, May 8-9, 2019, pp. 6-12, 2019, IEEE, 978-1-7281-2600-5. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Ning Zhao, Junjie Shen 0003, Xiaolin Ma, Yuhe Liu |
Analysis on Nonlinear Characters of Built-in Sensor in Smart Device under the Condition of Voice Actuating. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Cybersecurity and Cyberforensics Conference, CCC 2019, Melbourne, Australia, May 8-9, 2019, pp. 40-46, 2019, IEEE, 978-1-7281-2600-5. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Tomasz Hyla, Jerzy Pejas |
eHealth Integrity Model Based on a Permissioned Blockchain. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Cybersecurity and Cyberforensics Conference, CCC 2019, Melbourne, Australia, May 8-9, 2019, pp. 172-177, 2019, IEEE, 978-1-7281-2600-5. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Shumin Li, Rajan Kadel |
Design of a Hybrid RFID-WLAN Based Smart Parking and Vehicle Finding System. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Cybersecurity and Cyberforensics Conference, CCC 2019, Melbourne, Australia, May 8-9, 2019, pp. 56-61, 2019, IEEE, 978-1-7281-2600-5. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Hussain Aldawood, Geoffrey Skinner |
Challenges of Implementing Training and Awareness Programs Targeting Cyber Security Social Engineering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Cybersecurity and Cyberforensics Conference, CCC 2019, Melbourne, Australia, May 8-9, 2019, pp. 111-117, 2019, IEEE, 978-1-7281-2600-5. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Kulsoom Manzoor, Sana Hoor Jokhio, Tariq Jamil Saifullah Khanzada, Imran Ali Jokhio |
Enhanced TL-LEACH routing protocol for large-scale WSN applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Cybersecurity and Cyberforensics Conference, CCC 2019, Melbourne, Australia, May 8-9, 2019, pp. 35-39, 2019, IEEE, 978-1-7281-2600-5. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Adiba Zarin, Jia Uddin |
A Hybrid Fake Banknote Detection Model using OCR, Face Recognition and Hough Features. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Cybersecurity and Cyberforensics Conference, CCC 2019, Melbourne, Australia, May 8-9, 2019, pp. 91-95, 2019, IEEE, 978-1-7281-2600-5. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Kazuki Murata, Atsushi Ito, Yukitsugu Takahashi, Hiroyuki Hatano |
A Study on Growth Stage Classification of Paddy Rice by CNN using NDVI Images. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Cybersecurity and Cyberforensics Conference, CCC 2019, Melbourne, Australia, May 8-9, 2019, pp. 85-90, 2019, IEEE, 978-1-7281-2600-5. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Kamran Shehzad, Muhammad Afrasayab, Murad Khan, Muhammad Azhar Mushtaq, Rana Laique Ahmed, M. Mohsin Saleemi |
Use of Blockchain in Internet of things: A Systematic Literature Review. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Cybersecurity and Cyberforensics Conference, CCC 2019, Melbourne, Australia, May 8-9, 2019, pp. 165-171, 2019, IEEE, 978-1-7281-2600-5. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Vidya Saikrishna, Sid Ray |
MML Inference of Hierarchical Probabilistic Finite State Machine. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Cybersecurity and Cyberforensics Conference, CCC 2019, Melbourne, Australia, May 8-9, 2019, pp. 78-84, 2019, IEEE, 978-1-7281-2600-5. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Yuba Raj Panta, Sami Azam, Bharanidharan Shanmugam, Kheng Cher Yeo, Mirjam Jonkman, Friso De Boer, Mamoun Alazab |
Improving Accessibility for Mobility Impaired People in Smart City using Crowdsourcing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Cybersecurity and Cyberforensics Conference, CCC 2019, Melbourne, Australia, May 8-9, 2019, pp. 47-55, 2019, IEEE, 978-1-7281-2600-5. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Yusuke Nozaki, Masaya Yoshikawa |
Countermeasure of Lightweight Physical Unclonable Function Against Side-Channel Attack. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Cybersecurity and Cyberforensics Conference, CCC 2019, Melbourne, Australia, May 8-9, 2019, pp. 30-34, 2019, IEEE, 978-1-7281-2600-5. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Hitendra Patel, Sajan Sheth, S. M. Farhad |
Cloud Based Temperature and Humidity Alert System to Prevent Food Poisoning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Cybersecurity and Cyberforensics Conference, CCC 2019, Melbourne, Australia, May 8-9, 2019, pp. 1-5, 2019, IEEE, 978-1-7281-2600-5. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Muzammil M. K. Arisar, Lianju Ning, Zhongyuan Sun, Imran Ali Jokhio |
A Comprehensive Investigation of Telecom Business Models and Strategies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Cybersecurity and Cyberforensics Conference, CCC 2019, Melbourne, Australia, May 8-9, 2019, pp. 129-135, 2019, IEEE, 978-1-7281-2600-5. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Ashish Dwivedi, Rajat Mittal 0001, Nitin Saxena 0001 |
Counting Basic-Irreducible Factors Mod p^k in Deterministic Poly-Time and p-Adic Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 34th Computational Complexity Conference, CCC 2019, July 18-20, 2019, New Brunswick, NJ, USA., pp. 15:1-15:29, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-116-0. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Amir Shpilka (eds.) |
34th Computational Complexity Conference, CCC 2019, July 18-20, 2019, New Brunswick, NJ, USA. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-116-0 The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
1 | Susanna F. de Rezende, Jakob Nordström, Or Meir, Robert Robere |
Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 34th Computational Complexity Conference, CCC 2019, July 18-20, 2019, New Brunswick, NJ, USA., pp. 18:1-18:16, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-116-0. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Albert Atserias, Tuomas Hakoniemi |
Size-Degree Trade-Offs for Sums-of-Squares and Positivstellensatz Proofs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 34th Computational Complexity Conference, CCC 2019, July 18-20, 2019, New Brunswick, NJ, USA., pp. 24:1-24:20, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-116-0. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Ryan O'Donnell, Tselil Schramm |
Sherali - Adams Strikes Back. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 34th Computational Complexity Conference, CCC 2019, July 18-20, 2019, New Brunswick, NJ, USA., pp. 8:1-8:30, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-116-0. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Mark Braverman, Klim Efremenko, Ran Gelles, Michael A. Yitayew |
Optimal Short-Circuit Resilient Formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 34th Computational Complexity Conference, CCC 2019, July 18-20, 2019, New Brunswick, NJ, USA., pp. 10:1-10:22, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-116-0. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Josh Alman |
Limits on the Universal Method for Matrix Multiplication. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 34th Computational Complexity Conference, CCC 2019, July 18-20, 2019, New Brunswick, NJ, USA., pp. 12:1-12:24, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-116-0. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | |
Front Matter, Table of Contents, Preface, Conference Organization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 34th Computational Complexity Conference, CCC 2019, July 18-20, 2019, New Brunswick, NJ, USA., pp. 0:1-0:14, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-116-0. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Noah Stephens-Davidowitz |
A Time-Distance Trade-Off for GDD with Preprocessing - Instantiating the DLW Heuristic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 34th Computational Complexity Conference, CCC 2019, July 18-20, 2019, New Brunswick, NJ, USA., pp. 11:1-11:8, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-116-0. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | William M. Hoza |
Typically-Correct Derandomization for Small Time and Space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 34th Computational Complexity Conference, CCC 2019, July 18-20, 2019, New Brunswick, NJ, USA., pp. 9:1-9:39, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-116-0. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Eric Blais, Joshua Brody |
Optimal Separation and Strong Direct Sum for Randomized Query Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 34th Computational Complexity Conference, CCC 2019, July 18-20, 2019, New Brunswick, NJ, USA., pp. 29:1-29:17, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-116-0. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|