Technical report column

Approximate Counting of Matchings in (33) -Hypergraphs, Andrzej Dudek , Marek Karpinski, Andrzej Rucinski, Edyta Szymanska, TR14-065. Robust Approximation of Temporal CSP, Suguru Tamaki, Yuichi Yoshida, TR14-066. Limitations on Testable Affine-Invariant Codes in the High-Rate Regime, Venkatesan Guruswami, Madhu Sudan, Ameya Velingker, Carol Wang, TR14-067. Zero Knowledge and Circuit Minimization, Eric Allender, Bireswar Das, TR14-068. Explicit Non-Malleable Codes Resistant to Permutations, Shashank Agrawal, Divya Gupta, Hemanta Maji, Omkant Pandey, Manoj Prabhakaran, TR14-069. The Complexity of Geometric Graph Isomorphism, Vikraman Arvind, Gaurav Rattan, TR14-070. O(sqrt(n))-Space and Polynomial-time Algorithm for the Planar Directed Graph Reachability Problem, Tetsuo Asano, David Kirkpatrick, Kotaro Nakagawa, Osamu Watanabe, TR14-071. Depth Lower Bounds against Circuits with Sparse Orientation, Sajin Koroth, Jayalal Sarma, TR14-072. Group representations that resist random sampling, Shachar Lovett, Cris Moore, Alexander Russell, TR14-073. Topology matters in communication, Arkadev Chattopadhyay, Jaikumar Radhakrishnan, Atri Rudra, TR14-074. A simple proof that AND-compression of NP-complete problems is hard, Holger Dell, TR14-075. Pseudorandomness and Fourier Growth Bounds for Width 3 Branching Programs, Thomas Steinke, TR14-076. Size of Sets with Small Sensitivity: a Generalization of Simon’s Lemma, Andris Ambainis, Jevgenijs Vihrovs, TR14-077. Zero-Information Protocols and Unambiguity in Arthur-Merlin Communication, Mika Göös, Toniann Pitassi, Thomas Watson, TR14-078. Counting the Number of Perfect Matchings in K5-free Graphs, Simon Straub, Thomas Thierauf, Fabian Wagner, TR14-079. Lower Bounds for Tropical Circuits and Dynamic Programs, Stasys Jukna, TR14-080. From Small Space to Small Width in Resolution, Yuval Filmus, Massimo Lauria, Mladen Mikša, Jakob Nordström, Marc Vinyals, TR14-081. The Randomized Iterate Revisited Almost Linear Seed Length PRGs from A Broader Class of One-way Functions, Yu Yu, Dawu Gu, Xiangxue Li, TR14-082. The Computational Benefit of Correlated Instances, Irit Dinur, Shafi Goldwasser, Huijia Lin, TR14083. A Physically Universal Cellular Automaton, Luke Schaeffer, TR14-084. Hitting-sets for ROABP and Sum of Set-Multilinear circuits, Manindra Agrawal, Rohit Gurjar, Arpita Korwar, Nitin Saxena, TR14-085.

[1]  Marthe Bonamy,et al.  Planar graphs with Δ≥7 and no triangle adjacent to a C4 are minimally edge and total choosable , 2016, Discret. Math. Theor. Comput. Sci..

[2]  Benjamin Monmege,et al.  Adding Negative Prices to Priced Timed Games , 2014, CONCUR.

[3]  Sebastian Pokutta,et al.  The matching polytope does not admit fully-polynomial size relaxation schemes , 2015, SODA.

[4]  Kamil Khadiev,et al.  Very narrow quantum OBDDs and width hierarchies for classical OBDDs , 2014, DCFS.

[5]  Rasmus Pagh,et al.  Triangle Counting in Dynamic Graph Streams , 2014, Algorithmica.

[6]  Jie Zhang,et al.  Social Welfare in One-Sided Matchings: Random Priority and Beyond , 2014, SAGT.

[7]  Adam Roman,et al.  Parameterized Complexity of Synchronization and Road Coloring , 2014, Discret. Math. Theor. Comput. Sci..

[8]  Amit Deshpande,et al.  Guruswami-Sinop Rounding without Higher Level Lasserre , 2014, APPROX-RANDOM.

[9]  Yingjie Wu,et al.  A note on the largest number of red nodes in red-black trees , 2014, J. Discrete Algorithms.

[10]  Francesco Dolce,et al.  Regular Interval Exchange Transformations over a Quadratic Field , 2014, ArXiv.

[11]  Robert Krauthgamer,et al.  Vertex Sparsifiers: New Results from Old Techniques , 2010, SIAM J. Comput..

[12]  Pascal Koiran,et al.  A Wronskian approach to the real τ-conjecture , 2012, J. Symb. Comput..

[13]  N. Jesper Larsson,et al.  Efficient Representation for Online Suffix Tree Construction , 2014, SEA.

[14]  Konstantin Makarychev,et al.  Nonuniform Graph Partitioning with Unrelated Weights , 2014, ICALP.

[15]  Jean-Charles Delvenne,et al.  Zero forcing number, constraint matchings and strong structural controllability , 2014, ArXiv.

[16]  Tianrong Lin.  Undecidability of $L(\mathcal{A})=L(\mathcal{B})$ recognized by measure many 1-way quantum automata , 2013, 1308.3301.

[17]  Virendra Sule,et al.  An algorithm for Boolean satisfiability based on generalized orthonormal expansion , 2014, ArXiv.

[18]  Tomás Masopust,et al.  On Upper and Lower Bounds on the Length of Alternating Towers , 2014, MFCS.

[19]  Guy Kindler,et al.  Unique Games on the Hypercube , 2015, Chic. J. Theor. Comput. Sci..

[20]  Graciela L. Nasini,et al.  Polyhedral results for the Equitable Coloring Problem , 2011, Electron. Notes Discret. Math..

[21]  Michael Frank,et al.  Twenty-Five Comparators Is Optimal When Sorting Nine Inputs (and Twenty-Nine for Ten) , 2014, 2014 IEEE 26th International Conference on Tools with Artificial Intelligence.

[22]  Mohan S. Kankanhalli,et al.  Multi-Keyword Multi-Click Advertisement Option Contracts for Sponsored Search , 2013, ACM Trans. Intell. Syst. Technol..

[23]  Andrew Chi-Chih Yao,et al.  An n-to-1 Bidder Reduction for Multi-item Auctions and its Applications , 2014, SODA.

[24]  Tim Roughgarden,et al.  Privately Solving Linear Programs , 2014, ICALP.

[25]  Joaquim Borges,et al.  Z2Z4-additive cyclic codes, generator polynomials and dual codes , 2014, ArXiv.

[26]  Kenneth W. Regan,et al.  Polynomials Modulo Composite Numbers: Ax-Katz type theorems for the structure of their solution sets , 2014, ArXiv.

[27]  David Manlove,et al.  The Hospitals / Residents Problem with Couples: Complexity and Integer Programming Models , 2013, SEA.

[28]  Srikanta Tirthapura,et al.  Mining maximal cliques from an uncertain graph , 2013, 2015 IEEE 31st International Conference on Data Engineering.

[29]  Ragesh Jaiswal.  On Uniform Reductions between Direct Product and XOR Lemmas , 2014, ArXiv.

[30]  Ludovic Mignot,et al.  Constrained Expressions and their Derivatives , 2016, Fundam. Informaticae.

[31]  Alexei Lisitsa,et al.  Computer-aided proof of Erdős discrepancy properties , 2014, Artif. Intell..

[32]  Sébastien Tavenas,et al.  Improved bounds for reduction to depth 4 and depth 3 , 2013, Inf. Comput..

[33]  Sascha Kurz,et al.  The Price of Fairness for a Small Number of Indivisible Items , 2014, OR.

[34]  Andris Ambainis,et al.  Size of Sets with Small Sensitivity: A Generalization of Simon's Lemma , 2014, TAMC.

[35]  Jukka Suomela.  Median Filtering is Equivalent to Sorting , 2014, ArXiv.

[36]  Rudolf Freund,et al.  Cooperating Distributed Grammar Systems of Finite Index Working in Hybrid Modes , 2014, AFL.

[37]  Michal Jastrzebski.  On total communication complexity of collapsing protocols for pointer jumping problem , 2014, ArXiv.

[38]  Yun Fan,et al.  Fourier Transforms and Bent Functions on Finite Abelian Group-Acted Sets , 2014, ArXiv.

[39]  Yuichi Yoshida,et al.  Testing Forest-Isomorphism in the Adjacency List Model , 2014, ICALP.

[40]  Akanksha Agrawal,et al.  Vertex Cover Gets Faster and Harder on Low Degree Graphs , 2014, COCOON.

[41]  Florian Horn,et al.  Optimal strategy synthesis for request-response games , 2015, RAIRO Theor. Informatics Appl..

[42]  Di He,et al.  A Game-Theoretic Machine Learning Approach for Revenue Maximization in Sponsored Search , 2013, IJCAI.

[43]  Mohammad Sohel Rahman,et al.  An Integer Programming Formulation of the Minimum Common String Partition Problem , 2015, PloS one.

[44]  Fabian Kuhn,et al.  Serving Online Demands with Movable Centers , 2014, ArXiv.

[45]  Christian Kudahl.  Deciding the On-line Chromatic Number of a Graph with Pre-coloring Is PSPACE-Complete , 2015, CIAC.

[46]  Peter B. Key,et al.  Incentivized optimal advert assignment via utility decomposition , 2014, EC.

[47]  Demosthenis Teneketzis,et al.  Electricity Pooling Markets with Strategic Producers Possessing Asymmetric Information II: Inelastic DemandElectricity Pooling Markets with Strategic Producers Possessing Asymmetric Information II: Inelastic Demand , 2014, ArXiv.

[48]  Mateus de Oliveira Oliveira.  On the Satisfiability of Quantum Circuits of Small Treewidth , 2016, Theory of Computing Systems.

[49]  Tobias Buer,et al.  A Pareto-metaheuristic for a bi-objective winner determination problem in a combinatorial reverse auction , 2012, Comput. Oper. Res..

[50]  Nir Ailon.  A Tighter Lower Bound For Fourier Transform in the Well Conditioned Model , 2014, ArXiv.

[51]  George Barmpalias,et al.  Tipping Points in Schelling Segregation , 2013, ArXiv.

[52]  Mohsen Ghaffari,et al.  Near-Optimal Distributed Approximation of Minimum-Weight Connected Dominating Set , 2014, ICALP.