| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Vikraman Arvind, Abhranil Chatterjee 0001, Rajit Datta, Partha Mukhopadhyay |
On Explicit Branching Programs for the Rectangular Determinant and Permanent Polynomials.  |
Chic. J. Theor. Comput. Sci.  |
2020 |
DBLP BibTeX RDF |
|
| 1 | Arkadev Chattopadhyay, Meena Mahajan, Nikhil S. Mande, Nitin Saurabh |
Lower bounds for linear decision lists. |
Chic. J. Theor. Comput. Sci. |
2020 |
DBLP BibTeX RDF |
|
| 1 | Dmitry Gavinsky |
The communication complexity of the inevitable intersection problem. |
Chic. J. Theor. Comput. Sci. |
2020 |
DBLP BibTeX RDF |
|
| 1 | Rohit Agrawal 0002 |
Coin Theorems and the Fourier Expansion. |
Chic. J. Theor. Comput. Sci. |
2020 |
DBLP BibTeX RDF |
|
| 1 | Guillaume Lagarde, Guillaume Malod, Sylvain Perifel |
Non-commutative computations: lower bounds and polynomial identity testing. |
Chic. J. Theor. Comput. Sci. |
2019 |
DBLP BibTeX RDF |
|
| 1 | Ilias Diakonikolas, Themis Gouleakis, John Peebles, Eric Price 0001 |
Collision-Based Testers are Optimal for Uniformity and Closeness. |
Chic. J. Theor. Comput. Sci. |
2019 |
DBLP BibTeX RDF |
|
| 1 | Ishay Haviv, Michael Langberg |
H-wise Independence. |
Chic. J. Theor. Comput. Sci. |
2019 |
DBLP BibTeX RDF |
|
| 1 | Oded Goldreich 0001, Tom Gur |
Universal Locally Testable Codes. |
Chic. J. Theor. Comput. Sci. |
2018 |
DBLP BibTeX RDF |
|
| 1 | Matthew B. Hastings |
Local Maxima and Improved Exact Algorithm for MAX-2-SAT. |
Chic. J. Theor. Comput. Sci. |
2018 |
DBLP BibTeX RDF |
|
| 1 | Vincent Russo, John Watrous |
Extended Nonlocal Games from Quantum-Classical Games. |
Chic. J. Theor. Comput. Sci. |
2018 |
DBLP BibTeX RDF |
|
| 1 | Steven D. Galbraith, Joel Laity, Barak Shani |
Finding Significant Fourier Coefficients: Clarifications, Simplifications, Applications and Limitations. |
Chic. J. Theor. Comput. Sci. |
2018 |
DBLP BibTeX RDF |
|
| 1 | Markus Bläser, Matthias Christandl, Jeroen Zuiddam |
The border support rank of two-by-two matrix multiplication is seven. |
Chic. J. Theor. Comput. Sci. |
2018 |
DBLP BibTeX RDF |
|
| 1 | Jan Krajícek, Igor C. Oliveira |
On monotone circuits with local oracles and clique lower bounds. |
Chic. J. Theor. Comput. Sci. |
2018 |
DBLP BibTeX RDF |
|
| 1 | François Le Gall, Harumichi Nishimura |
Quantum Algorithms for Matrix Products over Semirings. |
Chic. J. Theor. Comput. Sci. |
2017 |
DBLP BibTeX RDF |
|
| 1 | Rajko Nenadov, Pascal Pfister, Angelika Steger |
Unique reconstruction threshold for random jigsaw puzzles. |
Chic. J. Theor. Comput. Sci. |
2017 |
DBLP BibTeX RDF |
|
| 1 | Thomas Watson 0001 |
Nonnegative Rank vs. Binary Rank. |
Chic. J. Theor. Comput. Sci. |
2016 |
DBLP BibTeX RDF |
|
| 1 | Laura Mancinska, David E. Roberson, Antonios Varvitsiotis |
On deciding the existence of perfect entangled strategies for nonlocal games. |
Chic. J. Theor. Comput. Sci. |
2016 |
DBLP BibTeX RDF |
|
| 1 | André Chailloux, Gus Gutoski, Jamie Sikora |
Optimal bounds for semi-honest quantum oblivious transfer. |
Chic. J. Theor. Comput. Sci. |
2016 |
DBLP BibTeX RDF |
|
| 1 | Vida Dujmovic, Anastasios Sidiropoulos, David R. Wood |
Layouts of Expander Graphs. |
Chic. J. Theor. Comput. Sci. |
2016 |
DBLP BibTeX RDF |
|
| 1 | Raghav Kulkarni, Avishay Tal |
On Fractional Block Sensitivity. |
Chic. J. Theor. Comput. Sci. |
2016 |
DBLP BibTeX RDF |
|
| 1 | Vikraman Arvind, S. Raja 0001 |
Some Lower Bound Results for Set-Multilinear Arithmetic Computations. |
Chic. J. Theor. Comput. Sci. |
2016 |
DBLP BibTeX RDF |
|
| 1 | Cécilia Lancien, Andreas J. Winter 0002 |
Parallel repetition and concentration for (sub-)no-signalling games via a flexible constrained de Finetti reduction. |
Chic. J. Theor. Comput. Sci. |
2016 |
DBLP BibTeX RDF |
|
| 1 | Alex B. Grilo, Iordanis Kerenidis, Jamie Sikora |
QMA with Subset State Witnesses. |
Chic. J. Theor. Comput. Sci. |
2016 |
DBLP BibTeX RDF |
|
| 1 | Penghui Yao |
Parity Decision Tree Complexity and 4-Party Communication Complexity of XOR-functions Are Polynomially Equivalent. |
Chic. J. Theor. Comput. Sci. |
2016 |
DBLP BibTeX RDF |
|
| 1 | Christopher T. Chubb, Steven T. Flammia |
Computing the Degenerate Ground Space of Gapped Spin Chains in Polynomial Time. |
Chic. J. Theor. Comput. Sci. |
2016 |
DBLP BibTeX RDF |
|
| 1 | Yuval Filmus |
Friedgut-Kalai-Naor Theorem for Slices of the Boolean Cube. |
Chic. J. Theor. Comput. Sci. |
2016 |
DBLP BibTeX RDF |
|
| 1 | Arkadev Chattopadhyay, Frederic Green, Howard Straubing |
Circuit Complexity of Powering in Fields of Odd Characteristic. |
Chic. J. Theor. Comput. Sci. |
2016 |
DBLP BibTeX RDF |
|
| 1 | Arnaud Durand 0001, Meena Mahajan, Guillaume Malod, Nicolas de Rugy-Altherre, Nitin Saurabh |
Homomorphism Polynomials Complete for VP. |
Chic. J. Theor. Comput. Sci. |
2016 |
DBLP BibTeX RDF |
|
| 1 | Divesh Aggarwal, Oded Regev 0001 |
A Note on Discrete Gaussian Combinations of Lattice Vectors. |
Chic. J. Theor. Comput. Sci. |
2016 |
DBLP BibTeX RDF |
|
| 1 | Louay Bazzi |
Entropy of weight distributions of small-bias spaces and pseudobinomiality. |
Chic. J. Theor. Comput. Sci. |
2015 |
DBLP BibTeX RDF |
|
| 1 | Ilias Diakonikolas, Ragesh Jaiswal, Rocco A. Servedio, Li-Yang Tan, Andrew Wan |
Noise Stable Halfspaces are Close to Very Small Juntas. |
Chic. J. Theor. Comput. Sci. |
2015 |
DBLP BibTeX RDF |
|
| 1 | Naman Agarwal, Guy Kindler, Alexandra Kolla, Luca Trevisan |
Unique Games on the Hypercube. |
Chic. J. Theor. Comput. Sci. |
2015 |
DBLP BibTeX RDF |
|
| 1 | Girish Varma |
Reducing uniformity in Khot-Saket hypergraph coloring hardness reductions. |
Chic. J. Theor. Comput. Sci. |
2015 |
DBLP BibTeX RDF |
|
| 1 | Peter J. Cameron, Ben Fairbairn, Maximilien Gadouleau |
Computing in Matrix Groups Without Memory. |
Chic. J. Theor. Comput. Sci. |
2014 |
DBLP BibTeX RDF |
|
| 1 | Peter J. Cameron, Ben Fairbairn, Maximilien Gadouleau |
Computing in Permutation Groups Without Memory. |
Chic. J. Theor. Comput. Sci. |
2014 |
DBLP BibTeX RDF |
|
| 1 | Hirotada Kobayashi, Keiji Matsumoto, Seiichiro Tani |
Simpler Exact Leader Election via Quantum Reduction. |
Chic. J. Theor. Comput. Sci. |
2014 |
DBLP BibTeX RDF |
|
| 1 | Mark Huber |
Near-linear time simulation of linear extensions of a height-2 poset with bounded interaction. |
Chic. J. Theor. Comput. Sci. |
2014 |
DBLP BibTeX RDF |
|
| 1 | Ansis Rosmanis |
Quantum Adversary Lower Bound for Element Distinctness with Small Range. |
Chic. J. Theor. Comput. Sci. |
2014 |
DBLP BibTeX RDF |
|
| 1 | Ashley Montanaro |
A composition theorem for decision tree complexity. |
Chic. J. Theor. Comput. Sci. |
2014 |
DBLP BibTeX RDF |
|
| 1 | B. V. Raghavendra Rao, Jayalal Sarma |
Complexity of Testing Reachability in Matroids. |
Chic. J. Theor. Comput. Sci. |
2014 |
DBLP BibTeX RDF |
|
| 1 | Avraham Ben-Aroya, Igor Shinkar |
A Note on Subspace Evasive Sets. |
Chic. J. Theor. Comput. Sci. |
2014 |
DBLP BibTeX RDF |
|
| 1 | Thomas Thierauf, Fabian Wagner |
Reachability in K{3, 3}-free and K5-free Graphs is in Unambiguous Logspace. |
Chic. J. Theor. Comput. Sci. |
2014 |
DBLP BibTeX RDF |
|
| 1 | Thomas Watson 0001 |
Lift-and-Project Integrality Gaps for the Traveling Salesperson Problem. |
Chic. J. Theor. Comput. Sci. |
2014 |
DBLP BibTeX RDF |
|
| 1 | Eric Allender, George Davie, Luke Friedman, Samuel Hopkins, Iddo Tzameret |
Kolmogorov Complexity, Circuits, and the Strength of Formal Theories of Arithmetic. |
Chic. J. Theor. Comput. Sci. |
2013 |
DBLP BibTeX RDF |
|
| 1 | John Watrous |
Simpler semidefinite programs for completely bounded norms. |
Chic. J. Theor. Comput. Sci. |
2013 |
DBLP BibTeX RDF |
|
| 1 | Shelby Kimmel |
Quantum Adversary (Upper) Bound. |
Chic. J. Theor. Comput. Sci. |
2013 |
DBLP BibTeX RDF |
|
| 1 | Tom Gur, Omer Tamuz |
Testing Booleanity and the Uncertainty Principle. |
Chic. J. Theor. Comput. Sci. |
2013 |
DBLP BibTeX RDF |
|
| 1 | Alexandr Kazda |
Complexity of the homomorphism extension problem in the random case. |
Chic. J. Theor. Comput. Sci. |
2013 |
DBLP BibTeX RDF |
|
| 1 | Ilir Çapuni, Péter Gács |
A Turing Machine Resisting Isolated Bursts Of Faults. |
Chic. J. Theor. Comput. Sci. |
2013 |
DBLP BibTeX RDF |
|
| 1 | Niel de Beaudrap |
On the complexity of solving linear congruences and computing nullspaces modulo a constant. |
Chic. J. Theor. Comput. Sci. |
2013 |
DBLP BibTeX RDF |
|
| 1 | Harry Buhrman, David García-Soriano, Arie Matsliah, Ronald de Wolf |
The non-adaptive query complexity of testing k-parities. |
Chic. J. Theor. Comput. Sci. |
2013 |
DBLP BibTeX RDF |
|
| 1 | Alessandro Chiesa, Michael A. Forbes 0001 |
Improved Soundness for QMA with Multiple Provers |
Chic. J. Theor. Comput. Sci. |
2013 |
DBLP BibTeX RDF |
|
| 1 | Nir Ailon |
A Lower Bound for Fourier Transform Computation in a Linear Model Over 2x2 Unitary Gates Using Matrix Entropy. |
Chic. J. Theor. Comput. Sci. |
2013 |
DBLP BibTeX RDF |
|
| 1 | Debbie W. Leung, Benjamin Toner, John Watrous |
Coherent state exchange in multi-prover quantum interactive proof systems. |
Chic. J. Theor. Comput. Sci. |
2013 |
DBLP BibTeX RDF |
|
| 1 | Parinya Chalermsook, Shiva Kintali, Richard J. Lipton, Danupon Nanongkai |
Graph Pricing Problem on Bounded Treewidth, Bounded Genus and k-Partite Graphs. |
Chic. J. Theor. Comput. Sci. |
2013 |
DBLP BibTeX RDF |
|
| 1 | Bernd Borchert, Pierre McKenzie, Klaus Reinhardt |
Few Product Gates but Many Zeroes. |
Chic. J. Theor. Comput. Sci. |
2013 |
DBLP BibTeX RDF |
|
| 1 | Gus Gutoski |
Interactive proofs with competing teams of no-signaling provers. |
Chic. J. Theor. Comput. Sci. |
2013 |
DBLP BibTeX RDF |
|
| 1 | Attila Pereszlényi |
On Quantum Interactive Proofs with Short Messages. |
Chic. J. Theor. Comput. Sci. |
2012 |
DBLP BibTeX RDF |
|
| 1 | Alexander Kesselman, Kirill Kogan, Michael Segal 0001 |
Best Effort and Priority Queuing Policies for Buffered Crossbar Switches. |
Chic. J. Theor. Comput. Sci. |
2012 |
DBLP BibTeX RDF |
|
| 1 | Thomas Vidick |
A concentration inequality for the overlap of a vector on a large set, with application to the communication complexity of the Gap-Hamming-Distance problem. |
Chic. J. Theor. Comput. Sci. |
2012 |
DBLP BibTeX RDF |
|
| 1 | Troy Lee, Frédéric Magniez, Miklos Santha |
Learning graph based quantum query algorithms for finding constant-size subgraphs. |
Chic. J. Theor. Comput. Sci. |
2012 |
DBLP BibTeX RDF |
|
| 1 | Michael Hoffmann 0001, Jirí Matousek 0001, Yoshio Okamoto, Philipp Zumstein |
Minimum and maximum against k lies. |
Chic. J. Theor. Comput. Sci. |
2012 |
DBLP BibTeX RDF |
|
| 1 | Ashley Montanaro |
Almost all decision trees do not allow significant quantum speed-up. |
Chic. J. Theor. Comput. Sci. |
2012 |
DBLP BibTeX RDF |
|
| 1 | Amir M. Ben-Amram, Niels H. Christensen, Jakob Grue Simonsen |
Computational Models with No Linear Speedup. |
Chic. J. Theor. Comput. Sci. |
2012 |
DBLP BibTeX RDF |
|
| 1 | Ishay Haviv, Oded Regev 0001 |
Hardness of the Covering Radius Problem on Lattices. |
Chic. J. Theor. Comput. Sci. |
2012 |
DBLP BibTeX RDF |
|
| 1 | Matthew McKague |
Interactive proofs with efficient quantum prover for recursive Fourier sampling. |
Chic. J. Theor. Comput. Sci. |
2012 |
DBLP BibTeX RDF |
|
| 1 | Amir Yehudayoff |
Linear cover time for trees is exponentially unlikely. |
Chic. J. Theor. Comput. Sci. |
2012 |
DBLP BibTeX RDF |
|
| 1 | Joshua R. Davis, David Liben-Nowell, Alexa Sharp, Tom Wexler |
Mediated Equilibria in Load-Balanced Games. |
Chic. J. Theor. Comput. Sci. |
2011 |
DBLP BibTeX RDF |
|
| 1 | Kazuyuki Amano |
On Directional vs. General Randomized Decision Tree Complexity for Read-Once Formulas. |
Chic. J. Theor. Comput. Sci. |
2011 |
DBLP BibTeX RDF |
|
| 1 | Ling-Ju Hung, Ton Kloks |
k-Cographs are Kruskalian. |
Chic. J. Theor. Comput. Sci. |
2011 |
DBLP BibTeX RDF |
|
| 1 | Vida Dujmovic, Joachim Gudmundsson, Pat Morin, Thomas Wolle |
Notes on Large Angle Crossing Graphs. |
Chic. J. Theor. Comput. Sci. |
2011 |
DBLP BibTeX RDF |
|
| 1 | Scott Aaronson, François Le Gall, Alexander Russell, Seiichiro Tani |
The One-Way Communication Complexity of Subgroup Membership. |
Chic. J. Theor. Comput. Sci. |
2011 |
DBLP BibTeX RDF |
|
| 1 | Sze-Hang Chan, Tak Wah Lam, Lap-Kei Lee, Hing-Fung Ting, Pan Zhang |
Non-clairvoyant Scheduling for Weighted Flow Time and Energy on Speed Bounded Processors. |
Chic. J. Theor. Comput. Sci. |
2011 |
DBLP BibTeX RDF |
|
| 1 | Kevin Henshall, Peter Schachte, Harald Søndergaard, Leigh Whiting |
An Algorithm for Affine Approximation of Binary Decision Diagrams. |
Chic. J. Theor. Comput. Sci. |
2010 |
DBLP BibTeX RDF |
|
| 1 | Koji Nakazawa, Makoto Tatsuta |
Type Checking and Inference for Polymorphic and Existential Types in Multiple-Quantifier and Type-Free Systems. |
Chic. J. Theor. Comput. Sci. |
2010 |
DBLP BibTeX RDF |
|
| 1 | David J. Pearce 0001, Gary Haggard, Gordon F. Royle |
Edge-Selection Heuristics for Computing Tutte Polynomials. |
Chic. J. Theor. Comput. Sci. |
2010 |
DBLP BibTeX RDF |
|
| 1 | Mark Utting, Petra Malik, Ian Toyn |
Transformation Rules for Z. |
Chic. J. Theor. Comput. Sci. |
2010 |
DBLP BibTeX RDF |
|
| 1 | Ashley Montanaro, Tobias Osborne |
Quantum boolean functions. |
Chic. J. Theor. Comput. Sci. |
2010 |
DBLP BibTeX RDF |
|
| 1 | Marats Golovkins, Jean-Eric Pin |
Varieties Generated by Certain Models of Reversible Finite Automata. |
Chic. J. Theor. Comput. Sci. |
2010 |
DBLP BibTeX RDF |
|
| 1 | Martin Tancer |
d-collapsibility is NP-complete for d greater or equal to 4. |
Chic. J. Theor. Comput. Sci. |
2010 |
DBLP BibTeX RDF |
|
| 1 | Wataru Matsubara, Shunsuke Inenaga, Ayumi Shinohara |
An Efficient Algorithm to Test Square-Freeness of Strings Compressed by Balanced Straight Line Programs. |
Chic. J. Theor. Comput. Sci. |
2010 |
DBLP BibTeX RDF |
|
| 1 | Adam R. Day |
On Process Complexity. |
Chic. J. Theor. Comput. Sci. |
2010 |
DBLP BibTeX RDF |
|
| 1 | David A. Meyer 0001, James Pommersheim |
Single-Query Learning from Abelian and Non-Abelian Hamming Distance Oracles. |
Chic. J. Theor. Comput. Sci. |
2010 |
DBLP BibTeX RDF |
|
| 1 | András Faragó |
On the Structure of Classes of Random Graphs. |
Chic. J. Theor. Comput. Sci. |
2010 |
DBLP BibTeX RDF |
|
| 1 | Sumit Ganguly |
Distributing Frequency-Dependent Data Stream Computations. |
Chic. J. Theor. Comput. Sci. |
2010 |
DBLP BibTeX RDF |
|
| 1 | Nutan Limaye, Meena Mahajan, Prajakta Nimbhorkar |
Longest Paths in Planar DAGs in Unambiguous Log-Space. |
Chic. J. Theor. Comput. Sci. |
2010 |
DBLP BibTeX RDF |
|
| 1 | Hirotada Kobayashi, Keiji Matsumoto, Tomoyuki Yamakami |
Quantum Merlin-Arthur Proof Systems: Are Multiple Merlins More Helpful to Arthur? |
Chic. J. Theor. Comput. Sci. |
2009 |
DBLP BibTeX RDF |
|
| 1 | Manor Mendel, Chaya Schwob |
Fast C-K-R Partitions of Sparse Graphs. |
Chic. J. Theor. Comput. Sci. |
2009 |
DBLP BibTeX RDF |
|
| 1 | Yehuda Lindell |
Legally Enforceable Fairness in Secure Two-Party Communication. |
Chic. J. Theor. Comput. Sci. |
2009 |
DBLP BibTeX RDF |
|
| 1 | Prabhu Manyem |
Syntactic Characterizations of Polynomial Time Optimization Classes. |
Chic. J. Theor. Comput. Sci. |
2008 |
DBLP BibTeX RDF |
|
| 1 | Yehuda Lindell |
Efficient Fully-Simulatable Oblivious Transfer. |
Chic. J. Theor. Comput. Sci. |
2008 |
DBLP BibTeX RDF |
|
| 1 | Dmitry Gavinsky, Oded Regev 0001, Ronald de Wolf |
Simultaneous Communication Protocols with Quantum and Classical Messages. |
Chic. J. Theor. Comput. Sci. |
2008 |
DBLP BibTeX RDF |
|
| 1 | Miklós Ajtai |
Representing Hard Lattices with O(nlog n) Bits. |
Chic. J. Theor. Comput. Sci. |
2008 |
DBLP BibTeX RDF |
|
| 1 | Vamsi Kalapala, Cris Moore |
The Phase Transition in Exact Cover. |
Chic. J. Theor. Comput. Sci. |
2008 |
DBLP BibTeX RDF |
|
| 1 | Babak Farzad, Neil Olver, Adrian Vetta |
A Priority-Based Model of Routing. |
Chic. J. Theor. Comput. Sci. |
2008 |
DBLP BibTeX RDF |
|
| 1 | Raghav Kulkarni, Meena Mahajan, Kasturi R. Varadarajan |
Some perfect matchings and perfect half-integral matchings in NC. |
Chic. J. Theor. Comput. Sci. |
2008 |
DBLP BibTeX RDF |
|
| 1 | Samuel A. Kutin, David Petrie Moulton, Lawren Smithline |
Computation at a Distance. |
Chic. J. Theor. Comput. Sci. |
2007 |
DBLP BibTeX RDF |
|
| 1 | Yehuda Lindell |
Protocols for Bounded-Concurrent Secure Two-Party Computation. |
Chic. J. Theor. Comput. Sci. |
2006 |
DBLP BibTeX RDF |
|
| 1 | Dave Bacon, Andrew M. Childs, Wim van Dam |
Optimal measurements for the dihedral hidden subgroup problem. |
Chic. J. Theor. Comput. Sci. |
2006 |
DBLP BibTeX RDF |
|
| 1 | Jakob Pagter |
On Ajtai's Lower Bound Technique for R-way Branching Programs and the Hamming Distance Problem. |
Chic. J. Theor. Comput. Sci. |
2005 |
DBLP BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")
data released under the ODC-BY 1.0 license