:facetid:stream:\"streams/journals/cjtcs\"OK:facetid:stream:streams/journals/cjtcsRohit Agrawal 0002Coin Theorems and the Fourier Expansion.Chic. J. Theor. Comput. Sci.20202020Journal Articlesopenjournals/cjtcs/Agrawal20http://cjtcs.cs.uchicago.edu/articles/2020/4/contents.htmlhttps://dblp.org/rec/journals/cjtcs/Agrawal20URL#1546478Vikraman ArvindAbhranil Chatterjee 0001Rajit DattaPartha MukhopadhyayOn Explicit Branching Programs for the Rectangular Determinant and Permanent Polynomials.Chic. J. Theor. Comput. Sci.20202020Journal Articlesopenjournals/cjtcs/ArvindCDM20http://cjtcs.cs.uchicago.edu/articles/2020/2/contents.htmlhttps://dblp.org/rec/journals/cjtcs/ArvindCDM20URL#1546479Arkadev ChattopadhyayMeena MahajanNikhil S. MandeNitin SaurabhLower bounds for linear decision lists.Chic. J. Theor. Comput. Sci.20202020Journal Articlesopenjournals/cjtcs/ChattopadhyayMM20http://cjtcs.cs.uchicago.edu/articles/2020/1/contents.htmlhttps://dblp.org/rec/journals/cjtcs/ChattopadhyayMM20URL#1546480Dmitry GavinskyThe communication complexity of the inevitable intersection problem.Chic. J. Theor. Comput. Sci.20202020Journal Articlesopenjournals/cjtcs/Gavinsky20http://cjtcs.cs.uchicago.edu/articles/2020/3/contents.htmlhttps://dblp.org/rec/journals/cjtcs/Gavinsky20URL#1546481Ilias DiakonikolasThemis GouleakisJohn PeeblesEric Price 0001Collision-Based Testers are Optimal for Uniformity and Closeness.Chic. J. Theor. Comput. Sci.20192019Journal Articlesopenjournals/cjtcs/DiakonikolasGPP19http://cjtcs.cs.uchicago.edu/articles/2019/1/contents.htmlhttps://dblp.org/rec/journals/cjtcs/DiakonikolasGPP19URL#1978788Ishay HavivMichael LangbergH-wise Independence.Chic. J. Theor. Comput. Sci.20192019Journal Articlesopenjournals/cjtcs/HavivL19http://cjtcs.cs.uchicago.edu/articles/2019/3/contents.htmlhttps://dblp.org/rec/journals/cjtcs/HavivL19URL#1978789Guillaume LagardeGuillaume MalodSylvain PerifelNon-commutative computations: lower bounds and polynomial identity testing.Chic. J. Theor. Comput. Sci.20192019Journal Articlesopenjournals/cjtcs/LagardeMP19http://cjtcs.cs.uchicago.edu/articles/2019/2/contents.htmlhttps://dblp.org/rec/journals/cjtcs/LagardeMP19URL#1978790Markus BläserMatthias ChristandlJeroen ZuiddamThe border support rank of two-by-two matrix multiplication is seven.Chic. J. Theor. Comput. Sci.20182018Journal Articlesopenjournals/cjtcs/BlaserCZ18http://cjtcs.cs.uchicago.edu/articles/2018/5/contents.htmlhttps://dblp.org/rec/journals/cjtcs/BlaserCZ18URL#2388085Steven D. GalbraithJoel LaityBarak ShaniFinding Significant Fourier Coefficients: Clarifications, Simplifications, Applications and Limitations.Chic. J. Theor. Comput. Sci.20182018Journal Articlesopenjournals/cjtcs/GalbraithLS18http://cjtcs.cs.uchicago.edu/articles/2018/6/contents.htmlhttps://dblp.org/rec/journals/cjtcs/GalbraithLS18URL#2388086Oded Goldreich 0001Tom GurUniversal Locally Testable Codes.Chic. J. Theor. Comput. Sci.20182018Journal Articlesopenjournals/cjtcs/GoldreichG18http://cjtcs.cs.uchicago.edu/articles/2018/3/contents.htmlhttps://dblp.org/rec/journals/cjtcs/GoldreichG18URL#2388087Matthew B. HastingsLocal Maxima and Improved Exact Algorithm for MAX-2-SAT.Chic. J. Theor. Comput. Sci.20182018Journal Articlesopenjournals/cjtcs/Hastings18http://cjtcs.cs.uchicago.edu/articles/2018/2/contents.htmlhttps://dblp.org/rec/journals/cjtcs/Hastings18URL#2388088Jan KrajícekIgor C. OliveiraOn monotone circuits with local oracles and clique lower bounds.Chic. J. Theor. Comput. Sci.20182018Journal Articlesopenjournals/cjtcs/KrajicekO18http://cjtcs.cs.uchicago.edu/articles/2018/1/contents.htmlhttps://dblp.org/rec/journals/cjtcs/KrajicekO18URL#2388089Vincent RussoJohn WatrousExtended Nonlocal Games from Quantum-Classical Games.Chic. J. Theor. Comput. Sci.20182018Journal Articlesopenjournals/cjtcs/RussoW18http://cjtcs.cs.uchicago.edu/articles/2018/4/contents.htmlhttps://dblp.org/rec/journals/cjtcs/RussoW18URL#2388090François Le GallHarumichi NishimuraQuantum Algorithms for Matrix Products over Semirings.Chic. J. Theor. Comput. Sci.20172017Journal Articlesopenjournals/cjtcs/GallN17http://cjtcs.cs.uchicago.edu/articles/2017/1/contents.htmlhttps://dblp.org/rec/journals/cjtcs/GallN17URL#2757901Rajko NenadovPascal PfisterAngelika StegerUnique reconstruction threshold for random jigsaw puzzles.Chic. J. Theor. Comput. Sci.20172017Journal Articlesopenjournals/cjtcs/NenadovPS17http://cjtcs.cs.uchicago.edu/articles/2017/2/contents.htmlhttps://dblp.org/rec/journals/cjtcs/NenadovPS17URL#2757902Divesh AggarwalOded Regev 0001A Note on Discrete Gaussian Combinations of Lattice Vectors.Chic. J. Theor. Comput. Sci.20162016Journal Articlesopenjournals/cjtcs/AggarwalR16http://cjtcs.cs.uchicago.edu/articles/2016/7/contents.htmlhttps://dblp.org/rec/journals/cjtcs/AggarwalR16URL#3097069Vikraman ArvindS. Raja 0001Some Lower Bound Results for Set-Multilinear Arithmetic Computations.Chic. J. Theor. Comput. Sci.20162016Journal Articlesopenjournals/cjtcs/ArvindR16http://cjtcs.cs.uchicago.edu/articles/2016/6/contents.htmlhttps://dblp.org/rec/journals/cjtcs/ArvindR16URL#3097070André ChaillouxGus GutoskiJamie SikoraOptimal bounds for semi-honest quantum oblivious transfer.Chic. J. Theor. Comput. Sci.20162016Journal Articlesopenjournals/cjtcs/ChaillouxGS16http://cjtcs.cs.uchicago.edu/articles/2016/13/contents.htmlhttps://dblp.org/rec/journals/cjtcs/ChaillouxGS16URL#3097071Arkadev ChattopadhyayFrederic GreenHoward StraubingCircuit Complexity of Powering in Fields of Odd Characteristic.Chic. J. Theor. Comput. Sci.20162016Journal Articlesopenjournals/cjtcs/ChattopadhyayGS16http://cjtcs.cs.uchicago.edu/articles/2016/10/contents.htmlhttps://dblp.org/rec/journals/cjtcs/ChattopadhyayGS16URL#3097072Christopher T. ChubbSteven T. FlammiaComputing the Degenerate Ground Space of Gapped Spin Chains in Polynomial Time.Chic. J. Theor. Comput. Sci.20162016Journal Articlesopenjournals/cjtcs/ChubbF16http://cjtcs.cs.uchicago.edu/articles/2016/9/contents.htmlhttps://dblp.org/rec/journals/cjtcs/ChubbF16URL#3097073Vida DujmovicAnastasios SidiropoulosDavid R. WoodLayouts of Expander Graphs.Chic. J. Theor. Comput. Sci.20162016Journal Articlesopenjournals/cjtcs/DujmovicSW16http://cjtcs.cs.uchicago.edu/articles/2016/1/contents.htmlhttps://dblp.org/rec/journals/cjtcs/DujmovicSW16URL#3097074Arnaud Durand 0001Meena MahajanGuillaume MalodNicolas de Rugy-AltherreNitin SaurabhHomomorphism Polynomials Complete for VP.Chic. J. Theor. Comput. Sci.20162016Journal Articlesopenjournals/cjtcs/DurandMMRS16http://cjtcs.cs.uchicago.edu/articles/2016/3/contents.htmlhttps://dblp.org/rec/journals/cjtcs/DurandMMRS16URL#3097075Yuval FilmusFriedgut-Kalai-Naor Theorem for Slices of the Boolean Cube.Chic. J. Theor. Comput. Sci.20162016Journal Articlesopenjournals/cjtcs/Filmus16http://cjtcs.cs.uchicago.edu/articles/2016/14/contents.htmlhttps://dblp.org/rec/journals/cjtcs/Filmus16URL#3097076Alex B. GriloIordanis KerenidisJamie SikoraQMA with Subset State Witnesses.Chic. J. Theor. Comput. Sci.20162016Journal Articlesopenjournals/cjtcs/GriloKS16http://cjtcs.cs.uchicago.edu/articles/2016/4/contents.htmlhttps://dblp.org/rec/journals/cjtcs/GriloKS16URL#3097077Raghav KulkarniAvishay TalOn Fractional Block Sensitivity.Chic. J. Theor. Comput. Sci.20162016Journal Articlesopenjournals/cjtcs/KulkarniT16http://cjtcs.cs.uchicago.edu/articles/2016/8/contents.htmlhttps://dblp.org/rec/journals/cjtcs/KulkarniT16URL#3097078Cécilia LancienAndreas J. Winter 0002Parallel repetition and concentration for (sub-)no-signalling games via a flexible constrained de Finetti reduction.Chic. J. Theor. Comput. Sci.20162016Journal Articlesopenjournals/cjtcs/LancienW16http://cjtcs.cs.uchicago.edu/articles/2016/11/contents.htmlhttps://dblp.org/rec/journals/cjtcs/LancienW16URL#3097079Laura MancinskaDavid E. RobersonAntonios VarvitsiotisOn deciding the existence of perfect entangled strategies for nonlocal games.Chic. J. Theor. Comput. Sci.20162016Journal Articlesopenjournals/cjtcs/MancinskaRV16http://cjtcs.cs.uchicago.edu/articles/2016/5/contents.htmlhttps://dblp.org/rec/journals/cjtcs/MancinskaRV16URL#3097080Thomas Watson 0001Nonnegative Rank vs. Binary Rank.Chic. J. Theor. Comput. Sci.20162016Journal Articlesopenjournals/cjtcs/Watson16http://cjtcs.cs.uchicago.edu/articles/2016/2/contents.htmlhttps://dblp.org/rec/journals/cjtcs/Watson16URL#3097081Penghui YaoParity Decision Tree Complexity and 4-Party Communication Complexity of XOR-functions Are Polynomially Equivalent.Chic. J. Theor. Comput. Sci.20162016Journal Articlesopenjournals/cjtcs/Yao16http://cjtcs.cs.uchicago.edu/articles/2016/12/contents.htmlhttps://dblp.org/rec/journals/cjtcs/Yao16URL#3097082Naman AgarwalGuy KindlerAlexandra KollaLuca TrevisanUnique Games on the Hypercube.Chic. J. Theor. Comput. Sci.20152015Journal Articlesopenjournals/cjtcs/AgarwalKKT15http://cjtcs.cs.uchicago.edu/articles/2015/1/contents.htmlhttps://dblp.org/rec/journals/cjtcs/AgarwalKKT15URL#3412077Louay BazziEntropy of weight distributions of small-bias spaces and pseudobinomiality.Chic. J. Theor. Comput. Sci.20152015Journal Articlesopenjournals/cjtcs/Bazzi15http://cjtcs.cs.uchicago.edu/articles/2015/2/contents.htmlhttps://dblp.org/rec/journals/cjtcs/Bazzi15URL#3412078Ilias DiakonikolasRagesh JaiswalRocco A. ServedioLi-Yang TanAndrew WanNoise Stable Halfspaces are Close to Very Small Juntas.Chic. J. Theor. Comput. Sci.20152015Journal Articlesopenjournals/cjtcs/DiakonikolasJST16http://cjtcs.cs.uchicago.edu/articles/2015/4/contents.htmlhttps://dblp.org/rec/journals/cjtcs/DiakonikolasJST16URL#3412079Girish VarmaReducing uniformity in Khot-Saket hypergraph coloring hardness reductions.Chic. J. Theor. Comput. Sci.20152015Journal Articlesopenjournals/cjtcs/Varma16http://cjtcs.cs.uchicago.edu/articles/2015/3/contents.htmlhttps://dblp.org/rec/journals/cjtcs/Varma16URL#3412080Avraham Ben-AroyaIgor ShinkarA Note on Subspace Evasive Sets.Chic. J. Theor. Comput. Sci.20142014Journal Articlesopenjournals/cjtcs/Ben-AroyaS14http://cjtcs.cs.uchicago.edu/articles/2014/9/contents.htmlhttps://dblp.org/rec/journals/cjtcs/Ben-AroyaS14URL#3713844Peter J. CameronBen FairbairnMaximilien GadouleauComputing in Permutation Groups Without Memory.Chic. J. Theor. Comput. Sci.20142014Journal Articlesopenjournals/cjtcs/CameronFG14http://cjtcs.cs.uchicago.edu/articles/2014/7/contents.htmlhttps://dblp.org/rec/journals/cjtcs/CameronFG14URL#3713845Peter J. CameronBen FairbairnMaximilien GadouleauComputing in Matrix Groups Without Memory.Chic. J. Theor. Comput. Sci.20142014Journal Articlesopenjournals/cjtcs/CameronFG14ahttp://cjtcs.cs.uchicago.edu/articles/2014/8/contents.htmlhttps://dblp.org/rec/journals/cjtcs/CameronFG14aURL#3713846Mark HuberNear-linear time simulation of linear extensions of a height-2 poset with bounded interaction.Chic. J. Theor. Comput. Sci.20142014Journal Articlesopenjournals/cjtcs/Huber14http://cjtcs.cs.uchicago.edu/articles/2014/3/contents.htmlhttps://dblp.org/rec/journals/cjtcs/Huber14URL#3713847Hirotada KobayashiKeiji MatsumotoSeiichiro TaniSimpler Exact Leader Election via Quantum Reduction.Chic. J. Theor. Comput. Sci.20142014Journal Articlesopenjournals/cjtcs/KobayashiMT14http://cjtcs.cs.uchicago.edu/articles/2014/10/contents.htmlhttps://dblp.org/rec/journals/cjtcs/KobayashiMT14URL#3713848Ashley MontanaroA composition theorem for decision tree complexity.Chic. J. Theor. Comput. Sci.20142014Journal Articlesopenjournals/cjtcs/Montanaro14http://cjtcs.cs.uchicago.edu/articles/2014/6/contents.htmlhttps://dblp.org/rec/journals/cjtcs/Montanaro14URL#3713849B. V. Raghavendra RaoJayalal SarmaComplexity of Testing Reachability in Matroids.Chic. J. Theor. Comput. Sci.20142014Journal Articlesopenjournals/cjtcs/RaoS14http://cjtcs.cs.uchicago.edu/articles/2014/5/contents.htmlhttps://dblp.org/rec/journals/cjtcs/RaoS14URL#3713850Ansis RosmanisQuantum Adversary Lower Bound for Element Distinctness with Small Range.Chic. J. Theor. Comput. Sci.20142014Journal Articlesopenjournals/cjtcs/Rosmanis14http://cjtcs.cs.uchicago.edu/articles/2014/4/contents.htmlhttps://dblp.org/rec/journals/cjtcs/Rosmanis14URL#3713851Thomas ThieraufFabian WagnerReachability in K{3, 3}-free and K5-free Graphs is in Unambiguous Logspace.Chic. J. Theor. Comput. Sci.20142014Journal Articlesopenjournals/cjtcs/ThieraufW14http://cjtcs.cs.uchicago.edu/articles/2014/2/contents.htmlhttps://dblp.org/rec/journals/cjtcs/ThieraufW14URL#3713852Thomas Watson 0001Lift-and-Project Integrality Gaps for the Traveling Salesperson Problem.Chic. J. Theor. Comput. Sci.20142014Journal Articlesopenjournals/cjtcs/Watson14http://cjtcs.cs.uchicago.edu/articles/2014/1/contents.htmlhttps://dblp.org/rec/journals/cjtcs/Watson14URL#3713853Nir AilonA Lower Bound for Fourier Transform Computation in a Linear Model Over 2x2 Unitary Gates Using Matrix Entropy.Chic. J. Theor. Comput. Sci.20132013Journal Articlesopenjournals/cjtcs/Ailon13http://cjtcs.cs.uchicago.edu/articles/2013/12/contents.htmlhttps://dblp.org/rec/journals/cjtcs/Ailon13URL#4005247Eric AllenderGeorge DavieLuke FriedmanSamuel HopkinsIddo TzameretKolmogorov Complexity, Circuits, and the Strength of Formal Theories of Arithmetic.Chic. J. Theor. Comput. Sci.20132013Journal Articlesopenjournals/cjtcs/AllenderDFHT13http://cjtcs.cs.uchicago.edu/articles/2013/5/contents.htmlhttps://dblp.org/rec/journals/cjtcs/AllenderDFHT13URL#4005248Niel de BeaudrapOn the complexity of solving linear congruences and computing nullspaces modulo a constant.Chic. J. Theor. Comput. Sci.20132013Journal Articlesopenjournals/cjtcs/Beaudrap13http://cjtcs.cs.uchicago.edu/articles/2013/10/contents.htmlhttps://dblp.org/rec/journals/cjtcs/Beaudrap13URL#4005249Bernd BorchertPierre McKenzieKlaus ReinhardtFew Product Gates but Many Zeroes.Chic. J. Theor. Comput. Sci.20132013Journal Articlesopenjournals/cjtcs/BorchertMR13http://cjtcs.cs.uchicago.edu/articles/2013/2/contents.htmlhttps://dblp.org/rec/journals/cjtcs/BorchertMR13URL#4005250Harry BuhrmanDavid García-SorianoArie MatsliahRonald de WolfThe non-adaptive query complexity of testing k-parities.Chic. J. Theor. Comput. Sci.20132013Journal Articlesopenjournals/cjtcs/BuhrmanGMW13http://cjtcs.cs.uchicago.edu/articles/2013/6/contents.htmlhttps://dblp.org/rec/journals/cjtcs/BuhrmanGMW13URL#4005251Ilir ÇapuniPéter GácsA Turing Machine Resisting Isolated Bursts Of Faults.Chic. J. Theor. Comput. Sci.20132013Journal Articlesopenjournals/cjtcs/CapuniG13http://cjtcs.cs.uchicago.edu/articles/2013/3/contents.htmlhttps://dblp.org/rec/journals/cjtcs/CapuniG13URL#4005252Parinya ChalermsookShiva KintaliRichard J. LiptonDanupon NanongkaiGraph Pricing Problem on Bounded Treewidth, Bounded Genus and k-Partite Graphs.Chic. J. Theor. Comput. Sci.20132013Journal Articlesopenjournals/cjtcs/ChalermsookKLN13http://cjtcs.cs.uchicago.edu/articles/2013/13/contents.htmlhttps://dblp.org/rec/journals/cjtcs/ChalermsookKLN13URL#4005253Alessandro ChiesaMichael A. Forbes 0001Improved Soundness for QMA with Multiple ProversChic. J. Theor. Comput. Sci.20132013Journal Articlesopenjournals/cjtcs/Chiesa13http://cjtcs.cs.uchicago.edu/articles/2013/1/contents.htmlhttps://dblp.org/rec/journals/cjtcs/Chiesa13URL#4005254Tom GurOmer TamuzTesting Booleanity and the Uncertainty Principle.Chic. J. Theor. Comput. Sci.20132013Journal Articlesopenjournals/cjtcs/GurT13http://cjtcs.cs.uchicago.edu/articles/2013/14/contents.htmlhttps://dblp.org/rec/journals/cjtcs/GurT13URL#4005255Gus GutoskiInteractive proofs with competing teams of no-signaling provers.Chic. J. Theor. Comput. Sci.20132013Journal Articlesopenjournals/cjtcs/Gutoski13http://cjtcs.cs.uchicago.edu/articles/2013/7/contents.htmlhttps://dblp.org/rec/journals/cjtcs/Gutoski13URL#4005256Alexandr KazdaComplexity of the homomorphism extension problem in the random case.Chic. J. Theor. Comput. Sci.20132013Journal Articlesopenjournals/cjtcs/Kazda13http://cjtcs.cs.uchicago.edu/articles/2013/9/contents.htmlhttps://dblp.org/rec/journals/cjtcs/Kazda13URL#4005257Shelby KimmelQuantum Adversary (Upper) Bound.Chic. J. Theor. Comput. Sci.20132013Journal Articlesopenjournals/cjtcs/Kimmel13http://cjtcs.cs.uchicago.edu/articles/2013/4/contents.htmlhttps://dblp.org/rec/journals/cjtcs/Kimmel13URL#4005258Debbie W. LeungBenjamin TonerJohn WatrousCoherent state exchange in multi-prover quantum interactive proof systems.Chic. J. Theor. Comput. Sci.20132013Journal Articlesopenjournals/cjtcs/LeungTW13http://cjtcs.cs.uchicago.edu/articles/2013/11/contents.htmlhttps://dblp.org/rec/journals/cjtcs/LeungTW13URL#4005259John WatrousSimpler semidefinite programs for completely bounded norms.Chic. J. Theor. Comput. Sci.20132013Journal Articlesopenjournals/cjtcs/Watrous13http://cjtcs.cs.uchicago.edu/articles/2013/8/contents.htmlhttps://dblp.org/rec/journals/cjtcs/Watrous13URL#4005260Amir M. Ben-AmramNiels H. ChristensenJakob Grue SimonsenComputational Models with No Linear Speedup.Chic. J. Theor. Comput. Sci.20122012Journal Articlesopenjournals/cjtcs/Ben-AmramCS12http://cjtcs.cs.uchicago.edu/articles/2012/7/contents.htmlhttps://dblp.org/rec/journals/cjtcs/Ben-AmramCS12URL#4285710Ishay HavivOded Regev 0001Hardness of the Covering Radius Problem on Lattices.Chic. J. Theor. Comput. Sci.20122012Journal Articlesopenjournals/cjtcs/HavivR12http://cjtcs.cs.uchicago.edu/articles/2012/4/contents.htmlhttps://dblp.org/rec/journals/cjtcs/HavivR12URL#4285711Michael Hoffmann 0001Jirí Matousek 0001Yoshio OkamotoPhilipp ZumsteinMinimum and maximum against k lies.Chic. J. Theor. Comput. Sci.20122012Journal Articlesopenjournals/cjtcs/HoffmanMOZ12http://cjtcs.cs.uchicago.edu/articles/2012/2/contents.htmlhttps://dblp.org/rec/journals/cjtcs/HoffmanMOZ12URL#4285712Alexander KesselmanKirill KoganMichael Segal 0001Best Effort and Priority Queuing Policies for Buffered Crossbar Switches.Chic. J. Theor. Comput. Sci.20122012Journal Articlesopenjournals/cjtcs/KesselmanKS12http://cjtcs.cs.uchicago.edu/articles/2012/5/contents.htmlhttps://dblp.org/rec/journals/cjtcs/KesselmanKS12URL#4285713Troy LeeFrédéric MagniezMiklos SanthaLearning graph based quantum query algorithms for finding constant-size subgraphs.Chic. J. Theor. Comput. Sci.20122012Journal Articlesopenjournals/cjtcs/LeeMS12http://cjtcs.cs.uchicago.edu/articles/2012/10/contents.htmlhttps://dblp.org/rec/journals/cjtcs/LeeMS12URL#4285714Matthew McKagueInteractive proofs with efficient quantum prover for recursive Fourier sampling.Chic. J. Theor. Comput. Sci.20122012Journal Articlesopenjournals/cjtcs/McKague12http://cjtcs.cs.uchicago.edu/articles/2012/6/contents.htmlhttps://dblp.org/rec/journals/cjtcs/McKague12URL#4285715Ashley MontanaroAlmost all decision trees do not allow significant quantum speed-up.Chic. J. Theor. Comput. Sci.20122012Journal Articlesopenjournals/cjtcs/Montanaro12http://cjtcs.cs.uchicago.edu/articles/2012/8/contents.htmlhttps://dblp.org/rec/journals/cjtcs/Montanaro12URL#4285716Attila PereszlényiOn Quantum Interactive Proofs with Short Messages.Chic. J. Theor. Comput. Sci.20122012Journal Articlesopenjournals/cjtcs/Pereszlenyi12http://cjtcs.cs.uchicago.edu/articles/2012/9/contents.htmlhttps://dblp.org/rec/journals/cjtcs/Pereszlenyi12URL#4285717Thomas VidickA 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.20122012Journal Articlesopenjournals/cjtcs/Vidick12http://cjtcs.cs.uchicago.edu/articles/2012/1/contents.htmlhttps://dblp.org/rec/journals/cjtcs/Vidick12URL#4285718Amir YehudayoffLinear cover time for trees is exponentially unlikely.Chic. J. Theor. Comput. Sci.20122012Journal Articlesopenjournals/cjtcs/Yehudayoff12http://cjtcs.cs.uchicago.edu/articles/2012/3/contents.htmlhttps://dblp.org/rec/journals/cjtcs/Yehudayoff12URL#4285719Scott AaronsonFrançois Le GallAlexander RussellSeiichiro TaniThe One-Way Communication Complexity of Subgroup Membership.Chic. J. Theor. Comput. Sci.20112011Journal Articlesopenjournals/cjtcs/AaronsonGRT11http://cjtcs.cs.uchicago.edu/articles/2011/6/contentshttps://dblp.org/rec/journals/cjtcs/AaronsonGRT11URL#4548756Kazuyuki AmanoOn Directional vs. General Randomized Decision Tree Complexity for Read-Once Formulas.Chic. J. Theor. Comput. Sci.20112011Journal Articlesopenjournals/cjtcs/Amano11http://cjtcs.cs.uchicago.edu/articles/CATS2010/3/contents.htmlhttps://dblp.org/rec/journals/cjtcs/Amano11URL#4548757Sze-Hang ChanTak Wah LamLap-Kei LeeHing-Fung TingPan ZhangNon-clairvoyant Scheduling for Weighted Flow Time and Energy on Speed Bounded Processors.Chic. J. Theor. Comput. Sci.20112011Journal Articlesopenjournals/cjtcs/ChanLLTZ11http://cjtcs.cs.uchicago.edu/articles/CATS2010/1/contents.htmlhttps://dblp.org/rec/journals/cjtcs/ChanLLTZ11URL#4548758Joshua R. DavisDavid Liben-NowellAlexa SharpTom WexlerMediated Equilibria in Load-Balanced Games.Chic. J. Theor. Comput. Sci.20112011Journal Articlesopenjournals/cjtcs/DavisLSW11http://cjtcs.cs.uchicago.edu/articles/2011/5/contents.htmlhttps://dblp.org/rec/journals/cjtcs/DavisLSW11URL#4548759Vida DujmovicJoachim GudmundssonPat MorinThomas WolleNotes on Large Angle Crossing Graphs.Chic. J. Theor. Comput. Sci.20112011Journal Articlesopenjournals/cjtcs/DujmovicGMW11http://cjtcs.cs.uchicago.edu/articles/CATS2010/4/contents.htmlhttps://dblp.org/rec/journals/cjtcs/DujmovicGMW11URL#4548760Ling-Ju HungTon Kloksk-Cographs are Kruskalian.Chic. J. Theor. Comput. Sci.20112011Journal Articlesopenjournals/cjtcs/HungK11http://cjtcs.cs.uchicago.edu/articles/CATS2010/2/contents.htmlhttps://dblp.org/rec/journals/cjtcs/HungK11URL#4548761Adam R. DayOn Process Complexity.Chic. J. Theor. Comput. Sci.20102010Journal Articlesopenjournals/cjtcs/Day10http://cjtcs.cs.uchicago.edu/articles/CATS2009/1/contents.htmlhttps://dblp.org/rec/journals/cjtcs/Day10URL#4798680András FaragóOn the Structure of Classes of Random Graphs.Chic. J. Theor. Comput. Sci.20102010Journal Articlesopenjournals/cjtcs/Farago10http://cjtcs.cs.uchicago.edu/articles/CATS2009/2/contents.htmlhttps://dblp.org/rec/journals/cjtcs/Farago10URL#4798681Sumit GangulyDistributing Frequency-Dependent Data Stream Computations.Chic. J. Theor. Comput. Sci.20102010Journal Articlesopenjournals/cjtcs/Ganguly10http://cjtcs.cs.uchicago.edu/articles/CATS2009/9/contents.htmlhttps://dblp.org/rec/journals/cjtcs/Ganguly10URL#4798682Marats GolovkinsJean-Eric PinVarieties Generated by Certain Models of Reversible Finite Automata.Chic. J. Theor. Comput. Sci.20102010Journal Articlesopenjournals/cjtcs/GolovkinsP10http://cjtcs.cs.uchicago.edu/articles/2010/2/contents.htmlhttps://dblp.org/rec/journals/cjtcs/GolovkinsP10URL#4798683Kevin HenshallPeter SchachteHarald SøndergaardLeigh WhitingAn Algorithm for Affine Approximation of Binary Decision Diagrams.Chic. J. Theor. Comput. Sci.20102010Journal Articlesopenjournals/cjtcs/HenshallSSW10http://cjtcs.cs.uchicago.edu/articles/CATS2009/8/contents.htmlhttps://dblp.org/rec/journals/cjtcs/HenshallSSW10URL#4798684Nutan LimayeMeena MahajanPrajakta NimbhorkarLongest Paths in Planar DAGs in Unambiguous Log-Space.Chic. J. Theor. Comput. Sci.20102010Journal Articlesopenjournals/cjtcs/LimayeMN10http://cjtcs.cs.uchicago.edu/articles/CATS2009/5/contents.htmlhttps://dblp.org/rec/journals/cjtcs/LimayeMN10URL#4798685Wataru MatsubaraShunsuke InenagaAyumi ShinoharaAn Efficient Algorithm to Test Square-Freeness of Strings Compressed by Balanced Straight Line Programs.Chic. J. Theor. Comput. Sci.20102010Journal Articlesopenjournals/cjtcs/MatsubaraIS10http://cjtcs.cs.uchicago.edu/articles/CATS2009/4/contents.htmlhttps://dblp.org/rec/journals/cjtcs/MatsubaraIS10URL#4798686David A. Meyer 0001James PommersheimSingle-Query Learning from Abelian and Non-Abelian Hamming Distance Oracles.Chic. J. Theor. Comput. Sci.20102010Journal Articlesopenjournals/cjtcs/MeyerP10http://cjtcs.cs.uchicago.edu/articles/2010/13/contents.htmlhttps://dblp.org/rec/journals/cjtcs/MeyerP10URL#4798687Ashley MontanaroTobias OsborneQuantum boolean functions.Chic. J. Theor. Comput. Sci.20102010Journal Articlesopenjournals/cjtcs/MontanaroO10http://cjtcs.cs.uchicago.edu/articles/2010/1/contents.htmlhttps://dblp.org/rec/journals/cjtcs/MontanaroO10URL#4798688Koji NakazawaMakoto TatsutaType Checking and Inference for Polymorphic and Existential Types in Multiple-Quantifier and Type-Free Systems.Chic. J. Theor. Comput. Sci.20102010Journal Articlesopenjournals/cjtcs/NakazawaT10http://cjtcs.cs.uchicago.edu/articles/CATS2009/7/contents.htmlhttps://dblp.org/rec/journals/cjtcs/NakazawaT10URL#4798689David J. Pearce 0001Gary HaggardGordon F. RoyleEdge-Selection Heuristics for Computing Tutte Polynomials.Chic. J. Theor. Comput. Sci.20102010Journal Articlesopenjournals/cjtcs/PearceHR10http://cjtcs.cs.uchicago.edu/articles/CATS2009/3/contents.htmlhttps://dblp.org/rec/journals/cjtcs/PearceHR10URL#4798690Martin Tancerd-collapsibility is NP-complete for d greater or equal to 4.Chic. J. Theor. Comput. Sci.20102010Journal Articlesopenjournals/cjtcs/Tancer10http://cjtcs.cs.uchicago.edu/articles/2010/3/contents.htmlhttps://dblp.org/rec/journals/cjtcs/Tancer10URL#4798691Mark UttingPetra MalikIan ToynTransformation Rules for Z.Chic. J. Theor. Comput. Sci.20102010Journal Articlesopenjournals/cjtcs/UttingMT10http://cjtcs.cs.uchicago.edu/articles/CATS2009/6/contents.htmlhttps://dblp.org/rec/journals/cjtcs/UttingMT10URL#4798692Hirotada KobayashiKeiji MatsumotoTomoyuki YamakamiQuantum Merlin-Arthur Proof Systems: Are Multiple Merlins More Helpful to Arthur?Chic. J. Theor. Comput. Sci.20092009Journal Articlesopenjournals/cjtcs/KobayashiMY09http://cjtcs.cs.uchicago.edu/articles/2009/3/contents.htmlhttps://dblp.org/rec/journals/cjtcs/KobayashiMY09URL#5027365Yehuda LindellLegally Enforceable Fairness in Secure Two-Party Communication.Chic. J. Theor. Comput. Sci.20092009Journal Articlesopenjournals/cjtcs/Lindell09http://cjtcs.cs.uchicago.edu/articles/2009/1/contents.htmlhttps://dblp.org/rec/journals/cjtcs/Lindell09URL#5027366Manor MendelChaya SchwobFast C-K-R Partitions of Sparse Graphs.Chic. J. Theor. Comput. Sci.20092009Journal Articlesopenjournals/cjtcs/MendelS09http://cjtcs.cs.uchicago.edu/articles/2009/2/contents.htmlhttps://dblp.org/rec/journals/cjtcs/MendelS09URL#5027367Miklós AjtaiRepresenting Hard Lattices with O(nlog n) Bits.Chic. J. Theor. Comput. Sci.20082008Journal Articlesopenjournals/cjtcs/Ajtai08http://cjtcs.cs.uchicago.edu/articles/2008/2/contents.htmlhttps://dblp.org/rec/journals/cjtcs/Ajtai08URL#5249823Babak FarzadNeil OlverAdrian VettaA Priority-Based Model of Routing.Chic. J. Theor. Comput. Sci.20082008Journal Articlesopenjournals/cjtcs/FarzadOV08http://cjtcs.cs.uchicago.edu/articles/2008/1/contents.htmlhttps://dblp.org/rec/journals/cjtcs/FarzadOV08URL#5249824Dmitry GavinskyOded Regev 0001Ronald de WolfSimultaneous Communication Protocols with Quantum and Classical Messages.Chic. J. Theor. Comput. Sci.20082008Journal Articlesopenjournals/cjtcs/GavinskyRW08http://cjtcs.cs.uchicago.edu/articles/2008/7/contents.htmlhttps://dblp.org/rec/journals/cjtcs/GavinskyRW08URL#5249825Vamsi KalapalaCris MooreThe Phase Transition in Exact Cover.Chic. J. Theor. Comput. Sci.20082008Journal Articlesopenjournals/cjtcs/KalapalaM08http://cjtcs.cs.uchicago.edu/articles/2008/5/contents.htmlhttps://dblp.org/rec/journals/cjtcs/KalapalaM08URL#5249826Raghav KulkarniMeena MahajanKasturi R. VaradarajanSome perfect matchings and perfect half-integral matchings in NC.Chic. J. Theor. Comput. Sci.20082008Journal Articlesopenjournals/cjtcs/KulkarniMV08http://cjtcs.cs.uchicago.edu/articles/2008/4/contents.htmlhttps://dblp.org/rec/journals/cjtcs/KulkarniMV08URL#5249827Yehuda LindellEfficient Fully-Simulatable Oblivious Transfer.Chic. J. Theor. Comput. Sci.20082008Journal Articlesopenjournals/cjtcs/Lindell08http://cjtcs.cs.uchicago.edu/articles/2008/6/contents.htmlhttps://dblp.org/rec/journals/cjtcs/Lindell08URL#5249828Prabhu ManyemSyntactic Characterizations of Polynomial Time Optimization Classes.Chic. J. Theor. Comput. Sci.20082008Journal Articlesopenjournals/cjtcs/Manyem08http://cjtcs.cs.uchicago.edu/articles/2008/3/contents.htmlhttps://dblp.org/rec/journals/cjtcs/Manyem08URL#5249829Samuel A. KutinDavid Petrie MoultonLawren SmithlineComputation at a Distance.Chic. J. Theor. Comput. Sci.20072007Journal Articlesopenjournals/cjtcs/KutinMS07http://cjtcs.cs.uchicago.edu/articles/2007/1/contents.htmlhttps://dblp.org/rec/journals/cjtcs/KutinMS07URL#5452880Dave BaconAndrew M. ChildsWim van DamOptimal measurements for the dihedral hidden subgroup problem.Chic. J. Theor. Comput. Sci.20062006Journal Articlesopenjournals/cjtcs/BaconCD06http://cjtcs.cs.uchicago.edu/articles/2006/2/contents.htmlhttps://dblp.org/rec/journals/cjtcs/BaconCD06URL#5641362Yehuda LindellProtocols for Bounded-Concurrent Secure Two-Party Computation.Chic. J. Theor. Comput. Sci.20062006Journal Articlesopenjournals/cjtcs/Lindell06http://cjtcs.cs.uchicago.edu/articles/2006/1/contents.htmlhttps://dblp.org/rec/journals/cjtcs/Lindell06URL#5641363Jakob PagterOn Ajtai's Lower Bound Technique for R-way Branching Programs and the Hamming Distance Problem.Chic. J. Theor. Comput. Sci.20052005Journal Articlesopenjournals/cjtcs/Pagter05http://cjtcs.cs.uchicago.edu/articles/2005/1/contents.htmlhttps://dblp.org/rec/journals/cjtcs/Pagter05URL#5816829Vikraman ArvindK. V. Subrahmanyam 0001N. V. VinodchandranThe Query Complexity of Program Checking by Constant-Depth Circuits.Chic. J. Theor. Comput. Sci.20022002Journal Articlesopenjournals/cjtcs/ArvindSV02http://cjtcs.cs.uchicago.edu/articles/2002/2/contents.htmlhttps://dblp.org/rec/journals/cjtcs/ArvindSV02URL#6223458Joffroy BeauquierAjoy Kumar DattaMaria GradinariuFrédéric MagnietteSelf-Stabilizing Local Mutual Exclusion and Daemon Refinement.Chic. J. Theor. Comput. Sci.20022002Journal Articlesopenjournals/cjtcs/BeauquierDGM02http://cjtcs.cs.uchicago.edu/articles/2002/1/contents.htmlhttps://dblp.org/rec/journals/cjtcs/BeauquierDGM02URL#6223459Manindra AgrawalEric AllenderSamir DattaHeribert VollmerKlaus W. WagnerCharacterizing Small Depth and Small Space Classes by Operators of Higher Type.Chic. J. Theor. Comput. Sci.20002000Journal Articlesopenjournals/cjtcs/AgrawalADVW00http://cjtcs.cs.uchicago.edu/articles/2000/2/contents.htmlhttps://dblp.org/rec/journals/cjtcs/AgrawalADVW00URL#6407369William AielloCostas BuschMaurice HerlihyMarios MavronicolasNir ShavitDan TouitouSupporting Increment and Decrement Operations in Balancing Networks.Chic. J. Theor. Comput. Sci.20002000Journal Articlesopenjournals/cjtcs/AielloBHMST00http://cjtcs.cs.uchicago.edu/articles/2000/4/contents.htmlhttps://dblp.org/rec/journals/cjtcs/AielloBHMST00URL#6407370Jörg RotheHeuristics Versus Completeness for Graph Coloring.Chic. J. Theor. Comput. Sci.20002000Journal Articlesopenjournals/cjtcs/Rothe00http://cjtcs.cs.uchicago.edu/articles/2000/1/contents.htmlhttps://dblp.org/rec/journals/cjtcs/Rothe00URL#6407371Ulrich Schmid 0001Orthogonal Accuracy Clock Synchronization.Chic. J. Theor. Comput. Sci.20002000Journal Articlesopenjournals/cjtcs/Schmid00http://cjtcs.cs.uchicago.edu/articles/2000/3/contents.htmlhttps://dblp.org/rec/journals/cjtcs/Schmid00URL#6407372Eric AllenderThe Permanent Requires Large Uniform Threshold Circuits.Chic. J. Theor. Comput. Sci.19991999Journal Articlesopenjournals/cjtcs/Allender99http://cjtcs.cs.uchicago.edu/articles/1999/7/contents.htmlhttps://dblp.org/rec/journals/cjtcs/Allender99URL#6488408Adnan AzizFelice BalarinVigyan SinghalRobert K. BraytonAlberto L. Sangiovanni-VincentelliEquivalences for Fair Kripke Structures.Chic. J. Theor. Comput. Sci.19991999Journal Articlesopenjournals/cjtcs/AzizSBBS99http://cjtcs.cs.uchicago.edu/articles/1999/12/contents.htmlhttps://dblp.org/rec/journals/cjtcs/AzizSBBS99URL#6488409Robert BealsRichard Chang 0001William I. GasarchJacobo ToránOn Finding the Number of Graph Automorphisms.Chic. J. Theor. Comput. Sci.19991999Journal Articlesopenjournals/cjtcs/BealsCGT99http://cjtcs.cs.uchicago.edu/articles/1999/1/contents.htmlhttps://dblp.org/rec/journals/cjtcs/BealsCGT99URL#6488410Zeev CollinRina DechterShmuel KatzSelf-Stabilizing Distributed Constraint Satisfaction.Chic. J. Theor. Comput. Sci.19991999Journal Articlesopenjournals/cjtcs/CollinDK99http://cjtcs.cs.uchicago.edu/articles/1999/10/contents.htmlhttps://dblp.org/rec/journals/cjtcs/CollinDK99URL#6488411Jeff Erickson 0001Bounds for Linear Satisfiability Problems.Chic. J. Theor. Comput. Sci.19991999Journal Articlesopenjournals/cjtcs/Erickson99http://cjtcs.cs.uchicago.edu/articles/1999/8/contents.htmlhttps://dblp.org/rec/journals/cjtcs/Erickson99URL#6488412Joan FeigenbaumSampath KannanMoshe Y. VardiMahesh Viswanathan 0001The Complexity of Problems on Graphs Represented as OBDDs.Chic. J. Theor. Comput. Sci.19991999Journal Articlesopenjournals/cjtcs/FeigenbaumKVV99http://cjtcs.cs.uchicago.edu/articles/1999/5/contents.htmlhttps://dblp.org/rec/journals/cjtcs/FeigenbaumKVV99URL#6488413Stephen A. FennerFrederic GreenSteven HomerAlan L. SelmanThomas ThieraufHeribert VollmerComplements of Multivalued Functions.Chic. J. Theor. Comput. Sci.19991999Journal Articlesopenjournals/cjtcs/FennerGHSTV99http://cjtcs.cs.uchicago.edu/articles/1999/3/contents.htmlhttps://dblp.org/rec/journals/cjtcs/FennerGHSTV99URL#6488414Arun K. JagotaHopfield Neural Networks and Self-Stabilization.Chic. J. Theor. Comput. Sci.19991999Journal Articlesopenjournals/cjtcs/Jagota99http://cjtcs.cs.uchicago.edu/articles/1999/6/contents.htmlhttps://dblp.org/rec/journals/cjtcs/Jagota99URL#6488415Christoph KargJohannes KöblerRainer SchulerThe Complexity of Generating Test Instances.Chic. J. Theor. Comput. Sci.19991999Journal Articlesopenjournals/cjtcs/KargKS99http://cjtcs.cs.uchicago.edu/articles/1999/4/contents.htmlhttps://dblp.org/rec/journals/cjtcs/KargKS99URL#6488416Martha J. KosaTime Bounds for Strong and Hybrid Consistency for Arbitrary Abstract Data Types.Chic. J. Theor. Comput. Sci.19991999Journal Articlesopenjournals/cjtcs/Kosa99http://cjtcs.cs.uchicago.edu/articles/1999/9/contents.htmlhttps://dblp.org/rec/journals/cjtcs/Kosa99URL#6488417Ramamohan PaturiPavel PudlákFrancis ZaneSatisfiability Coding Lemma.Chic. J. Theor. Comput. Sci.19991999Journal Articlesopenjournals/cjtcs/PaturiPZ99http://cjtcs.cs.uchicago.edu/articles/1999/11/contents.htmlhttps://dblp.org/rec/journals/cjtcs/PaturiPZ99URL#6488418Jie Wang 0002Randomized Reductions and Isomorphisms.Chic. J. Theor. Comput. Sci.19991999Journal Articlesopenjournals/cjtcs/Wang99http://cjtcs.cs.uchicago.edu/articles/1999/2/contents.htmlhttps://dblp.org/rec/journals/cjtcs/Wang99URL#6488419Yehuda AfekAnat Bremler-BarrSelf-Stabilizing Unidirectional Network Algorithms by Power Supply.Chic. J. Theor. Comput. Sci.19981998Journal Articlesopenjournals/cjtcs/AfekB98http://cjtcs.cs.uchicago.edu/articles/1998/3/contents.htmlhttps://dblp.org/rec/journals/cjtcs/AfekB98URL#6558887Sandeep S. KulkarniAnish AroraMultitolerance in Distributed Reset.Chic. J. Theor. Comput. Sci.19981998Journal Articlesopenjournals/cjtcs/KulkarniA98http://cjtcs.cs.uchicago.edu/articles/1998/4/contents.htmlhttps://dblp.org/rec/journals/cjtcs/KulkarniA98URL#6558888Orna KupfermanMoshe Y. VardiVerification of Fair Transition Systems.Chic. J. Theor. Comput. Sci.19981998Journal Articlesopenjournals/cjtcs/KupfermanV98http://cjtcs.cs.uchicago.edu/articles/1998/2/contents.htmlhttps://dblp.org/rec/journals/cjtcs/KupfermanV98URL#6558889Thomas ThieraufThe Isomorphism Problem for Read-Once Branching Programs and Arithmetic Circuits.Chic. J. Theor. Comput. Sci.19981998Journal Articlesopenjournals/cjtcs/Thierauf98http://cjtcs.cs.uchicago.edu/articles/1998/1/contents.htmlhttps://dblp.org/rec/journals/cjtcs/Thierauf98URL#6558890Shlomi DolevTed HermanSuperstabilizing Protocols for Dynamic Distributed Systems.Chic. J. Theor. Comput. Sci.19971997Journal Articlesopenjournals/cjtcs/DolevH97http://cjtcs.cs.uchicago.edu/articles/1997/4/contents.htmlhttps://dblp.org/rec/journals/cjtcs/DolevH97URL#6623699Uriel FeigeJoe KilianOn Limited versus Polynomial Nondeterminism.Chic. J. Theor. Comput. Sci.19971997Journal Articlesopenjournals/cjtcs/FeigeK97http://cjtcs.cs.uchicago.edu/articles/1997/1/contents.htmlhttps://dblp.org/rec/journals/cjtcs/FeigeK97URL#6623700Viggo KannSanjeev KhannaJens LagergrenAlessandro PanconesiOn the Hardness of Approximating Max k-Cut and its Dual.Chic. J. Theor. Comput. Sci.19971997Journal Articlesopenjournals/cjtcs/KannKLP97http://cjtcs.cs.uchicago.edu/articles/1997/2/contents.htmlhttps://dblp.org/rec/journals/cjtcs/KannKLP97URL#6623701Meena MahajanV. VinayDeterminant: Combinatorics, Algorithms, and Complexity.Chic. J. Theor. Comput. Sci.19971997Journal Articlesopenjournals/cjtcs/MahajanV97http://cjtcs.cs.uchicago.edu/articles/1997/5/contents.htmlhttps://dblp.org/rec/journals/cjtcs/MahajanV97URL#6623702George VargheseAnish AroraMohamed G. GoudaSelf-Stabilization by Tree Correction.Chic. J. Theor. Comput. Sci.19971997Journal Articlesopenjournals/cjtcs/VargheseAG97http://cjtcs.cs.uchicago.edu/articles/1997/3/contents.htmlhttps://dblp.org/rec/journals/cjtcs/VargheseAG97URL#6623703Gerhard BuntrockGundula NiemannWeakly Growing Context-Sensitive Grammars.Chic. J. Theor. Comput. Sci.19961996Journal Articlesopenjournals/cjtcs/BuntrockN96http://cjtcs.cs.uchicago.edu/articles/1996/4/contents.htmlhttps://dblp.org/rec/journals/cjtcs/BuntrockN96URL#6679938Ornan Ori GerstelIsrael CidonShmuel ZaksOptimal Virtual Path Layout in ATM Networks With Shared Routing Table Switches.Chic. J. Theor. Comput. Sci.19961996Journal Articlesopenjournals/cjtcs/GerstelCZ96http://cjtcs.cs.uchicago.edu/articles/1996/3/contents.htmlhttps://dblp.org/rec/journals/cjtcs/GerstelCZ96URL#6679939H. James HooverPiotr RudnickiUniform Self-Stabilizing Orientation of Unicyclic Networks under Read/Write Atomicity.Chic. J. Theor. Comput. Sci.19961996Journal Articlesopenjournals/cjtcs/HooverR96http://cjtcs.cs.uchicago.edu/articles/1996/5/contents.htmlhttps://dblp.org/rec/journals/cjtcs/HooverR96URL#6679940Martin MiddendorfManhattan Channel Routing is NP-complete Under Truly Restricted Settings.Chic. J. Theor. Comput. Sci.19961996Journal Articlesopenjournals/cjtcs/Middendorf96http://cjtcs.cs.uchicago.edu/articles/1996/6/contents.htmlhttps://dblp.org/rec/journals/cjtcs/Middendorf96URL#6679941Mitsunori OgiharaSparse Hard Sets for P Yield Space-Efficient Algorithms.Chic. J. Theor. Comput. Sci.19961996Journal Articlesopenjournals/cjtcs/Ogihara96http://cjtcs.cs.uchicago.edu/articles/1996/2/contents.htmlhttps://dblp.org/rec/journals/cjtcs/Ogihara96URL#6679942Moshe Y. VardiRank Predicates vs. Progress Measures in Concurrent-Program Verification.Chic. J. Theor. Comput. Sci.19961996Journal Articlesopenjournals/cjtcs/Vardi96http://cjtcs.cs.uchicago.edu/articles/1996/1/contents.htmlhttps://dblp.org/rec/journals/cjtcs/Vardi96URL#6679943Anne CondonJoan FeigenbaumCarsten LundPeter W. ShorProbabilistically Checkable Debate Systems and Nonapproximability of PSPACE-Hard Functions.Chic. J. Theor. Comput. Sci.19951995Journal Articlesopenjournals/cjtcs/CondonFLS95http://cjtcs.cs.uchicago.edu/articles/1995/4/contents.htmlhttps://dblp.org/rec/journals/cjtcs/CondonFLS95URL#6732830Vince GrolmuszOn the Weak mod m Representation of Boolean Functions.Chic. J. Theor. Comput. Sci.19951995Journal Articlesopenjournals/cjtcs/Grolmusz95http://cjtcs.cs.uchicago.edu/articles/1995/2/contents.htmlhttps://dblp.org/rec/journals/cjtcs/Grolmusz95URL#6732831Nils KlarlundDexter KozenRabin Measures.Chic. J. Theor. Comput. Sci.19951995Journal Articlesopenjournals/cjtcs/KlarlundK95http://cjtcs.cs.uchicago.edu/articles/1995/3/contents.htmlhttps://dblp.org/rec/journals/cjtcs/KlarlundK95URL#6732832Noam NisanAmnon Ta-ShmaSymmetric Logspace is Closed Under Complement.Chic. J. Theor. Comput. Sci.19951995Journal Articlesopenjournals/cjtcs/NisanT95http://cjtcs.cs.uchicago.edu/articles/1995/1/contents.htmlhttps://dblp.org/rec/journals/cjtcs/NisanT95URL#6732833