Technical Report Column

Quasi-Linear Size Zero Knowledge from Linear-Algebraic PCPs, Eli Ben-Sasson, Alessandro Chiesa, Ariel Gabizon, Madars Virza, TR16-001. Strong ETH Breaks With Merlin and Arthur: Short Non-Interactive Proofs of Batch Evaluation, Ryan Williams, TR16-002. On the logspace shortest path problem, Boris Brimkov, Illya Hicks, TR16-003. Further extensions of Clifford circuits and their classical simulation complexities, Dax Enshan Koh, TR16-004. Extension Variables in QBF Resolution, Olaf Beyersdorff, Leroy Chew, Mikolas Janota, TR16-005. An almost Cubic Lower Bound for Depth Three Arithmetic Circuits, Neeraj Kayal, Chandan Saha, Sébastien Tavenas, TR16-006. Property Testing, PCP, andJuntas, Guy Kindler, TR16-007. Algorithms from Natural Lower Bounds, Marco L. Carmosino, Russell Impagliazzo, Valentine Kabanets, Antonina Kolokolova, TR16-008. Identity Testing for constant-width, and commutative, read-once oblivious ABPs, Rohit Gurjar, Arpita Korwar, Nitin Saxena, TR16-009. On the Width of Semi-Algebraic Proofs and Algorithms, Alexander Razborov, TR16-010. Understanding Gentzen and Frege systems for QBF, Olaf Beyersdorff, Jn Pich, TR16-011. Autoreducibility of NP-Complete Sets, John Hitchcock, Hadi Shafei, TR16-012. Bounds on the Kolmogorov complexity function for infinite words, Ludwig Staiger, TR16-013. Extractors for Near Logarithmic Min-Entropy, Gil Cohen, Leonard Schulman, TR16-014. The uniform distribution is complete with respect to testing identity to a fixed distribution, Oded Goldreich, TR16-015. Doubly infinite separation of quantum information and communication, Zi-Wen Liu, Christopher Perry, Yechao Zhu, Dax Enshan Koh, Scott Aaronson, TR16-016. Limitations of Linear Programming Techniques for Bounded Color Matchings, Georgios Stamoulis, TR16-017. Randomness Extraction in AC0 and with Small Locality, Kuan Cheng, Xin Li, TR16-018. Fast Learning Requires Good Memory: A Time-Space Lower Bound for Parity Learning, Ran Raz, TR16-019. The Hilbert Function, Algebraic Extractors, and Recursive Fourier Sampling, Zachary Remscrim, TR16-020. Noisy Population Recovery from Unknown Noise, Shachar Lovett, Jiapeng Zhang, TR16-021.

[1]  Günter Rote,et al.  Loopless Gray code enumeration and the Tower of Bucharest , 2018, Theor. Comput. Sci..

[2]  Nancy A. Lynch,et al.  Dynamic input/output automata: A formal and compositional model for dynamic systems , 2016, Inf. Comput..

[3]  Stefan Kratsch,et al.  On the complexity of the identifiable subgraph problem, revisited , 2016, Discret. Appl. Math..

[4]  Longbo Huang,et al.  Market share analysis with brand effect , 2016, 2016 IEEE 55th Conference on Decision and Control (CDC).

[5]  Clifford Stein,et al.  An Empirical Study of Online Packet Scheduling Algorithms , 2016, SEA.

[6]  Paola Bonizzoni,et al.  FSG: Fast String Graph Construction for De Novo Assembly of Reads Data , 2016, ISBRA.

[7]  Sam Ganzfried,et al.  Bayesian Opponent Exploitation in Imperfect-Information Games , 2016, 2018 IEEE Conference on Computational Intelligence and Games (CIG).

[8]  E. Muñoz,et al.  Horn Fragments of the Halpern-Shoham Interval Temporal Logic , 2017 .

[9]  Michele Borassi,et al.  KADABRA is an ADaptive Algorithm for Betweenness via Random Approximation , 2016, ESA.

[10]  Stefan Mengel.  Parameterized Compilation Lower Bounds for Restricted CNF-Formulas , 2016, SAT.

[11]  Parthe Pandit,et al.  A linear complementarity based characterization of the weighted independence number and the independent domination number in graphs , 2018, Discret. Appl. Math..

[12]  Etienne Callies,et al.  Graph Decompositions Analysis and Comparison for Cohesive Subgraphs Detection , 2016, ArXiv.

[13]  Venkat Chandrasekaran,et al.  Recovering Games from Perturbed Equilibrium Observations Using Convex Optimization , 2016, ArXiv.

[14]  Shi Li,et al.  Improved approximation for node-disjoint paths in planar graphs , 2016, STOC.

[15]  Vicent J. Botti,et al.  Reaching Unanimous Agreements Within Agent-Based Negotiation Teams With Linear and Monotonic Utility Functions , 2012, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[16]  Tatsuya Iwase,et al.  Pure Nash Equilibrium and Coordination of Players in Ride Sharing Games , 2016, ArXiv.

[17]  Christian Komusiewicz,et al.  Assessing the computational complexity of multilayer subgraph detection , 2016, Network Science.

[18]  Grant Schoenebeck,et al.  Equilibrium Selection in Information Elicitation without Verification via Information Monotonicity , 2018, ITCS.

[19]  Lin Gao,et al.  Two-Sided Matching Based Cooperative Spectrum Sharing , 2016, IEEE Transactions on Mobile Computing.

[20]  Shachar Lovett,et al.  The Fourier structure of low degree polynomials , 2016, Electron. Colloquium Comput. Complex..

[21]  Shin-Ming Cheng,et al.  Ecology-Based DoS Attack in Cognitive Radio Networks , 2016, 2016 IEEE Security and Privacy Workshops (SPW).

[22]  Zeyuan Allen Zhu,et al.  Optimal Black-Box Reductions Between Optimization Objectives , 2016, NIPS.

[23]  Alexander Vasiliev,et al.  Quantum hashing for finite abelian groups , 2016, Lobachevskii Journal of Mathematics.

[24]  Roger Wattenhofer,et al.  Online matching: haste makes waste! , 2016, STOC.

[25]  Luís E. T. Rodrigues,et al.  A Distributed Auctioneer for Resource Allocation in Decentralized Systems , 2016, 2016 IEEE 36th International Conference on Distributed Computing Systems (ICDCS).

[26]  Minoru Ito,et al.  Optimal scheduling for incentive WiFi offloading under energy constraint , 2016, 2016 IEEE 27th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC).

[27]  Kerstin Eder,et al.  On the infeasibility of analysing worst-case dynamic energy , 2016, ArXiv.

[28]  Nikola Yolov.  Polarity and Monopolarity of $3$-colourable comparability graphs , 2016, ArXiv.

[29]  Xin Li,et al.  Explicit Non-malleable Extractors, Multi-source Extractors, and Almost Optimal Privacy Amplification Protocols , 2016, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).

[30]  Marc Noy,et al.  On the Number of Labeled Graphs of Bounded Treewidth , 2016, WG.

[31]  Patrick Maillé,et al.  Competition between regulation-providing and fixed-power charging stations for electric vehicles , 2016, 2016 IEEE PES Innovative Smart Grid Technologies Conference Europe (ISGT-Europe).

[32]  Richard G. Baraniuk,et al.  Near-Isometric Binary Hashing for Large-scale Datasets , 2016, ArXiv.

[33]  Carola Doerr,et al.  The (1+1) Elitist Black-Box Complexity of LeadingOnes , 2016, GECCO.

[34]  Mohammad R. Salavatipour,et al.  Local Search Yields a PTAS for k-Means in Doubling Metrics , 2016, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).

[35]  Yassine Hacha ¨ õchi.  Logic for Unambiguous Context-Free Languages , 2016 .

[36]  Steve Miller,et al.  The Emergence of Cooperation in Public Goods Games on Randomly Growing Dynamic Networks , 2016, EvoApplications.

[37]  Lillian J. Ratliff,et al.  To observe or not to observe: Queuing game framework for urban parking , 2016, 2016 IEEE 55th Conference on Decision and Control (CDC).

[38]  Jon M. Kleinberg,et al.  Planning Problems for Sophisticated Agents with Present Bias , 2016, EC.

[39]  Jesper Larsson Träff,et al.  Benchmarking Concurrent Priority Queues: Performance of k-LSM and Related Data Structures , 2016, ArXiv.

[40]  Nir Ailon,et al.  The Complexity of Computing a Fourier Perturbation , 2016, ArXiv.

[41]  Christos Thrampoulidis,et al.  Near-optimal sample complexity bounds for circulant binary embedding , 2017, 2017 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[42]  Blair D. Sullivan,et al.  A Fast Parameterized Algorithm for Co-Path Set , 2016, IPEC.

[43]  Chryssis Georgiou,et al.  Internet Computing: Using Reputation to Select Workers from a Pool , 2016, NETYS.

[44]  Laxmidhar Behera,et al.  Neighborhood Approximations for Non-Linear Voter Models , 2015, Entropy.

[45]  Meena Mahajan,et al.  Sums of Read-Once Formulas: How Many Summands Suffice? , 2016, CSR.

[46]  Pawel Gawrychowski,et al.  Randomized Algorithms for Finding a Majority Element , 2016, SWAT.

[47]  Edward Farhi,et al.  A quantum version of Schoning's algorithm applied to quantum 2-SAT , 2016, Quantum Inf. Comput..

[48]  Nancy A. Lynch,et al.  Ant-inspired density estimation via random walks , 2016, Proceedings of the National Academy of Sciences.

[49]  Attila Szolnoki,et al.  Collective influence in evolutionary social dilemmas , 2016, ArXiv.

[50]  Daniel Merkle,et al.  Automatic Inference of Graph Transformation Rules Using the Cyclic Nature of Chemical Reactions , 2016, ICGT.

[51]  Dániel Marx,et al.  Parameterized vertex deletion problems for hereditary graph classes with a block property , 2016, WG.

[52]  Yun Kuen Cheung,et al.  Graph Minors for Preserving Terminal Distances Approximately - Lower and Upper Bounds , 2016, ICALP.

[53]  Edith Hemaspaandra,et al.  Complexity Dichotomies for Unweighted Scoring Rules , 2016, ArXiv.

[54]  Stefan Voß,et al.  A heuristic approach for dividing graphs into bi-connected components with a size constraint , 2016, J. Heuristics.

[55]  Fabian Reiter,et al.  Alternating Set Quantifiers in Modal Logic , 2016, ArXiv.

[56]  Walid Saad,et al.  Data Injection Attacks on Smart Grids With Multiple Adversaries: A Game-Theoretic Perspective , 2016, IEEE Transactions on Smart Grid.

[57]  Elham Havvaei,et al.  A Game-Theoretic Approach for Detection of Overlapping Communities in Dynamic Complex Networks , 2016, ArXiv.

[58]  Amir Leshem,et al.  Asymptotically optimal distributed channel allocation: A competitive game-theoretic approach , 2015, 2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[59]  K. Subramani,et al.  On the Shoshan-Zwick Algorithm for the All-Pairs Shortest Path Problem , 2017, J. Graph Algorithms Appl..

[60]  Fabiano de S. Oliveira,et al.  On the mediation of program allocation in high-demand environments , 2016, ArXiv.

[61]  Ondrej Suchý.  On Directed Steiner Trees with Multiple Roots , 2016, WG.

[62]  Oren Ben-Zwi,et al.  Ad Exchange: Envy-Free Auctions with Mediators , 2015, WINE.

[63]  Arpita Ghosh,et al.  Inferential Privacy Guarantees for Differentially Private Mechanisms , 2016, ITCS.

[64]  Jin-Yi Cai,et al.  Holographic algorithm with matchgates is universal for planar #CSP over boolean domain , 2016, STOC.

[65]  Safia Kedad-Sidhoum,et al.  Two-level lot-sizing with inventory bounds , 2018, Discret. Optim..

[66]  Michael Haythorpe,et al.  Reducing the generalised Sudoku problem to the Hamiltonian cycle problem , 2016, AKCE Int. J. Graphs Comb..

[67]  Gaurav S. Sukhatme,et al.  Maximizing the Weighted Number of Spanning Trees: Near-$t$-Optimal Graphs , 2016, ArXiv.

[68]  Lin Gao,et al.  An Integrated Spectrum and Information Market for Green Cognitive Communications , 2016, IEEE Journal on Selected Areas in Communications.

[69]  Longbo Huang,et al.  Boosting Sharing Economy: Social Welfare or Revenue Driven? , 2016, ArXiv.

[70]  Anthony Wirth,et al.  Efficient Parallel Algorithms for k-Center Clustering , 2016, 2016 45th International Conference on Parallel Processing (ICPP).

[71]  Ronald Cramer,et al.  On Multi-Point Local Decoding of Reed-Muller Codes , 2016, Electron. Colloquium Comput. Complex..

[72]  Mohamed El Yafrani,et al.  Cosolver2B: An efficient local search heuristic for the Travelling Thief Problem , 2015, 2015 IEEE/ACS 12th International Conference of Computer Systems and Applications (AICCSA).

[73]  Haris Aziz,et al.  A Discrete and Bounded Envy-Free Cake Cutting Protocol for Any Number of Agents , 2016, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).

[74]  Konstantinos Georgiou,et al.  Know When to Persist: Deriving Value from a Stream Buffer - (Extended Abstract) , 2016, AAIM.

[75]  Haris Aziz,et al.  Incompatibility of Efficiency and Strategyproofness in the Random Assignment Setting with Indifferences , 2016, ArXiv.

[76]  Shie Mannor,et al.  Strategic Formation of Heterogeneous Networks , 2016, IEEE Journal on Selected Areas in Communications.

[77]  Henry Yuen,et al.  A parallel repetition theorem for all entangled games , 2016, Electron. Colloquium Comput. Complex..

[78]  Haris Aziz.  A Comment on the Averseness of Random Serial Dictatorship to Stochastic Dominance Efficiency , 2016, ArXiv.

[79]  Saurabh Amin,et al.  Effects of Information Heterogeneity in Bayesian Routing Games , 2016, ArXiv.

[80]  Tatsuya Iwase,et al.  Coordination of Players in Ride-Sharing Games by Signaling , 2016, ArXiv.

[81]  Sarma B. K. Vrudhula,et al.  Efficient Enumeration of Unidirectional Cuts for Technology Mapping of Boolean Networks , 2016, ArXiv.

[82]  Benjamin Doerr,et al.  The Right Mutation Strength for Multi-Valued Decision Variables , 2016, GECCO.

[83]  Daniel Merkle,et al.  A Software Package for Chemically Inspired Graph Transformation , 2016, ICGT.

[84]  David Silver,et al.  Deep Reinforcement Learning from Self-Play in Imperfect-Information Games , 2016, ArXiv.

[85]  Haris Aziz,et al.  Mechanisms for House Allocation with Existing Tenants under Dichotomous Preferences , 2016, Journal of Mechanism and Institution Design.

[86]  András Sebö,et al.  The Salesman's Improved Paths: 3/2+1/34 Integrality Gap and Approximation Ratio , 2016, FOCS 2016.

[87]  Martin Jones,et al.  An open framework for the reproducible study of the iterated prisoner's dilemma , 2016, 1604.00896.

[88]  Adam Gudys,et al.  FAMSA: Fast and accurate multiple sequence alignment of huge protein families , 2016, Scientific Reports.

[89]  David Manlove,et al.  Pareto optimal matchings of students to courses in the presence of prerequisites , 2016, Discret. Optim..

[90]  Thomas Vidick,et al.  A Moment Majorization principle for random matrix ensembles with applications to hardness of the noncommutative Grothendieck problem , 2016, ArXiv.

[91]  Thibault Godin,et al.  Connected Reversible Mealy Automata of Prime Size Cannot Generate Infinite Burnside Groups , 2016, MFCS.

[92]  Elizaveta Frenkel,et al.  Measuring cones and other thick subsets in free groups , 2016, ArXiv.

[93]  Giuseppe Ottaviano,et al.  Fast Scalable Construction of (Minimal Perfect Hash) Functions , 2016, SEA.