×

43rd international colloquium on automata, languages, and programming, ICALP 2016, Rome, Italy, July 12–15, 2016. Proceedings. (English) Zbl 1351.68012

LIPIcs – Leibniz International Proceedings in Informatics 55. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-013-2). xliii, 150 articles, not consecutively paged, electronic only, open access (2016).

Show indexed articles as search result.

The articles of this volume will be reviewed individually. For the preceding conference see [Zbl 1316.68013; Zbl 1316.68014].
Indexed articles:
Kwiatkowska, Marta Z., Model checking and strategy synthesis for stochastic games: from theory to practice (invited talk), Article 4, 18 p. [Zbl 1388.68186]
de Berg, Mark; Buchin, Kevin; Jansen, Bart M. P.; Woeginger, Gerhard, Fine-grained complexity analysis of two classic TSP variants, Article 5, 14 p. [Zbl 1388.68139]
Bhangale, Amey; Gandhi, Rajiv; Hajiaghayi, Mohammad Taghi; Khandekar, Rohit; Kortsarz, Guy, Bicovering: covering edges with two small subsets of vertices, Article 6, 12 p. [Zbl 1388.68210]
Chekuri, Chandra; Ene, Alina; Pilipczuk, Marcin, Constant congestion routing of symmetric demands in planar directed graphs, Article 7, 14 p. [Zbl 1388.68213]
Grohe, Martin, Quasi-4-connected components, Article 8, 13 p. [Zbl 1388.05101]
Bodlaender, Hans L.; Nederlof, Jesper; van der Zanden, Tom C., Subexponential time algorithms for embedding \(H\)-minor free graphs, Article 9, 14 p. [Zbl 1388.68103]
Durocher, Stephane; Mondal, Debajyoti, Relating graph thickness to planar layers and bend complexity, Article 10, 13 p. [Zbl 1388.68225]
Cohen, Michael B.; Nelson, Jelani; Woodruff, David P., Optimal approximate matrix product in terms of stable rank, Article 11, 14 p. [Zbl 1404.65032]
Ito, Tsuyoshi; Jeffery, Stacey, Approximate span programs, Article 12, 14 p. [Zbl 1388.68069]
Fujii, Keisuke; Kobayashi, Hirotada; Morimae, Tomoyuki; Nishimura, Harumichi; Tamate, Shuhei; Tani, Seiichiro, Power of quantum computation with few clean qubits, Article 13, 14 p. [Zbl 1388.68068]
Fefferman, Bill; Kobayashi, Hirotada; Lin, Cedric Yen-Yu; Morimae, Tomoyuki; Nishimura, Harumichi, Space-efficient error reduction for unitary quantum computations, Article 14, 14 p. [Zbl 1388.68067]
Arad, Itai; Santha, Miklos; Sundaram, Aarthi; Zhang, Shengyu, Linear time algorithm for quantum 2SAT, Article 15, 14 p. [Zbl 1388.68064]
Childs, Andrew M.; Van Dam, Wim; Hung, Shih-Han; Shparlinski, Igor E., Optimal quantum algorithm for polynomial interpolation, Article 16, 13 p. [Zbl 1388.68065]
Thaler, Justin, Lower bounds for the approximate degree of block-composed functions, Article 17, 15 p. [Zbl 1388.68095]
Huang, Zengfeng; Peng, Pan, Dynamic graph stream algorithms in \(o(n)\) space, Article 18, 16 p. [Zbl 1388.68231]
Cohen-Addad, Vincent; Schwiegelshohn, Chris; Sohler, Christian, Diameter and \(k\)-center in sliding windows, Article 19, 12 p. [Zbl 1388.68305]
Clifford, Raphaël; Starikovskaya, Tatiana, Approximate Hamming distance in a stream, Article 20, 14 p. [Zbl 1388.68321]
Dehghani, Sina; Hajiaghayi, Mohammad Taghi; Mahini, Hamid; Seddighin, Saeed, Price of competition and dueling games, Article 21, 14 p. [Zbl 1398.91024]
Kavitha, Telikepalli, Popular half-integral matchings, Article 22, 13 p. [Zbl 1388.68233]
Boppana, Meena; Hod, Rani; Mitzenmacher, Michael; Morgan, Tom, Voronoi choice games, Article 23, 13 p. [Zbl 1390.91018]
Adler, Aviv; Daskalakis, Constantinos; Demaine, Erik D., The complexity of Hex and the Jordan curve theorem, Article 24, 14 p. [Zbl 1388.68096]
Fluschnik, Till; Hermelin, Danny; Nichterlein, André; Niedermeier, Rolf, Fractals for kernelization lower bounds, with an application to length-bounded cut problems, Article 25, 14 p. [Zbl 1388.68111]
Agrawal, Akanksha; Lokshtanov, Daniel; Majumdar, Diptapriyo; Mouawad, Amer E.; Saurabh, Saket, Kernelization of cycle packing with relaxed disjointness constraints, Article 26, 14 p. [Zbl 1388.68097]
Feldmann, Andreas Emil; Marx, Dániel, The complexity landscape of fixed-parameter directed Steiner network problems, Article 27, 14 p. [Zbl 1388.68228]
Marx, Dániel; Mitsou, Valia, Double-exponential and triple-exponential bounds for choosability problems parameterized by treewidth, Article 28, 15 p. [Zbl 1388.68128]
Goyal, Vipul; Khurana, Dakshita; Mironov, Ilya; Pandey, Omkant; Sahai, Amit, Do distributed differentially-private protocols require oblivious transfer?, Article 29, 15 p. [Zbl 1425.94062]
Libert, Benoît; Ramanna, Somindu C.; Yung, Moti, Functional commitment schemes: from polynomial commitments to pairing-based accumulators from simple assumptions, Article 30, 14 p. [Zbl 1377.94061]
Chandran, Nishanth; Goyal, Vipul; Mukherjee, Pratyay; Pandey, Omkant; Upadhyay, Jalaj, Block-wise non-malleable codes, Article 31, 14 p. [Zbl 1377.94041]
Lipton, Richard J.; Ostrovsky, Rafail; Zikas, Vassilis, Provably secure virus detection: using the observer effect against malware, Article 32, 14 p. [Zbl 1388.68025]
Kayal, Neeraj; Saha, Chandan; Tavenas, Sébastien, An almost cubic lower bound for depth three arithmetic circuits, Article 33, 15 p. [Zbl 1388.68090]
Grochow, Joshua A.; Mulmuley, Ketan D.; Qiao, Youming, Boundaries of VP and VNP, Article 34, 14 p. [Zbl 1388.68076]
Cheraghchi, Mahdi; Grigorescu, Elena; Juba, Brendan; Wimmer, Karl; Xie, Ning, \(\mathrm{AC}^0\circ\mathrm{MOD}_2\) lower bounds for the Boolean inner product, Article 35, 14 p. [Zbl 1388.68084]
Cook, Stephen; Edmonds, Jeff; Medabalimi, Venkatesh; Pitassi, Toniann, Lower bounds for nondeterministic semantic read-once branching programs, Article 36, 13 p. [Zbl 1388.68028]
Bun, Mark; Thaler, Justin, Improved bounds on the sign-rank of \(\mathrm{AC}^0\), Article 37, 14 p. [Zbl 1388.68106]
Tal, Avishay, On the sensitivity conjecture, Article 38, 13 p. [Zbl 1388.68136]
Mikkelsen, Jesper W., Randomization can be as helpful as a glimpse of the future in online computation, Article 39, 14 p. [Zbl 1388.68318]
Elad, Noa; Kale, Satyen; Naor, Joseph (Seffi), Online semidefinite programming, Article 40, 13 p. [Zbl 1388.68313]
Heydrich, Sandy; van Stee, Rob, Beating the harmonic lower bound for online bin packing, Article 41, 14 p. [Zbl 1388.68317]
Dehghani, Sina; Ehsani, Soheil; Hajiaghayi, Mohammad Taghi; Liaghat, Vahid; Räcke, Harald; Seddighin, Saeed, Online weighted degree-bounded Steiner networks via novel online mixed packing/covering, Article 42, 14 p. [Zbl 1388.68223]
Fiat, Amos; Karlin, Anna R.; Koutsoupias, Elias; Mathieu, Claire; Zach, Rotem, Carpooling in social networks, Article 43, 13 p. [Zbl 1388.68315]
Błasiok, Jarosław; Nelson, Jelani, An improved analysis of the ER-SpUD dictionary learning algorithm, Article 44, 14 p. [Zbl 1388.68246]
Bezáková, Ivona; Galanis, Andreas; Goldberg, Leslie Ann; Guo, Heng; Štefankovič, Daniel, Approximation via correlation decay when strong spatial mixing fails, Article 45, 13 p. [Zbl 1388.68300]
Galanis, Andreas; Goldberg, Leslie Ann; Jerrum, Mark, A complexity trichotomy for approximately counting list \(H\)-colourings, Article 46, 13 p. [Zbl 1388.68113]
Curticapean, Radu, Parity separation: a scientifically proven method for permanent weight loss, Article 47, 14 p. [Zbl 1388.68221]
Dahlgaard, Søren, On the hardness of partially dynamic graph problems and connections to diameter, Article 48, 14 p. [Zbl 1388.68222]
Georgiadis, Loukas; Italiano, Giuseppe F.; Parotsidis, Nikos, Incremental 2-edge-connectivity in directed graphs, Article 49, 15 p. [Zbl 1388.05178]
Wang, Di; Rao, Satish; Mahoney, Michael W., Unified acceleration method for packing and covering problems via diameter reduction, Article 50, 13 p. [Zbl 1388.90130]
Hansen, Thomas Dueholm; Zwick, Uri, Random-edge is slower than random-facet on abstract cubes, Article 51, 14 p. [Zbl 1388.90086]
Mahoney, Michael W.; Rao, Satish; Wang, Di; Zhang, Peng, Approximating the solution to mixed packing and covering LPs in parallel \(\widetilde O(\varepsilon^{-3})\) time, Article 52, 14 p. [Zbl 1388.68310]
Allen-Zhu, Zeyuan; Liao, Zhenyu; Yuan, Yang, Optimization algorithms for faster computational geometry, Article 53, 6 p. [Zbl 1388.68278]
Marašević, Jelena; Stein, Clifford; Zussman, Gil, A fast distributed stateless algorithm for \(\alpha\)-fair packing problems, Article 54, 15 p. [Zbl 1388.68294]
Sommer, Christian, All-pairs approximate shortest paths and distance oracle preprocessing, Article 55, 13 p. [Zbl 1388.68241]
Bonacina, Ilario, Total space in resolution is at least width squared, Article 56, 13 p. [Zbl 1387.03066]
Berkholz, Christoph; Nordström, Jakob, Supercritical space-width trade-offs for resolution, Article 57, 14 p. [Zbl 1387.03065]
Lincoln, Andrea; Williams, Virginia Vassilevska; Wang, Joshua R.; Williams, R. Ryan, Deterministic time-space trade-offs for \(k\)-SUM, Article 58, 14 p. [Zbl 1388.68127]
Thaler, Justin, Semi-streaming algorithms for annotated graph streams, Article 59, 14 p. [Zbl 1388.68137]
Ben-David, Shalev; Kothari, Robin, Randomized query complexity of sabotaged and composed functions, Article 60, 14 p. [Zbl 1388.68094]
Braverman, Mark; Gelles, Ran; Mao, Jieming; Ostrovsky, Rafail, Coding for interactive communication correcting insertions and deletions, Article 61, 14 p. [Zbl 1390.68314]
Galanis, Andreas; Göbel, Andreas; Goldberg, Leslie Ann; Lapinskas, John; Richerby, David, Amplifiers for the Moran process, Article 62, 13 p. [Zbl 1388.68296]
Panageas, Ioannis; Vishnoi, Nisheeth K., Mixing time of Markov chains, dynamical systems and evolution, Article 63, 14 p. [Zbl 1388.60128]
Wan, Jun; Xia, Yu; Li, Liang; Moscibroda, Thomas, Information cascades on arbitrary topologies, Article 64, 14 p. [Zbl 1388.68242]
Hetterich, Samuel, Analysing survey propagation guided decimationon random formulas, Article 65, 12 p. [Zbl 1388.68258]
Gupta, Anupam; Guruganesh, Guru; Schmidt, Melanie, Approximation algorithms for aversion \(k\)-clustering via local \(k\)-median, Article 66, 13 p. [Zbl 1388.68308]
Chakrabarty, Deeparnab; Goyal, Prachi; Krishnaswamy, Ravishankar, The non-uniform \(k\)-center problem, Article 67, 15 p. [Zbl 1388.68303]
Balcan, Maria-Florina; Haghtalab, Nika; White, Colin, \(k\)-center clustering under perturbation resilience, Article 68, 14 p. [Zbl 1388.68098]
Ahmadian, Sara; Swamy, Chaitanya, Approximation algorithms for clustering problems with lower bounds and outliers, Article 69, 15 p. [Zbl 1395.90172]
Schalekamp, Frans; van Zuylen, Anke; van der Ster, Suzanne, A duality based 2-approximation algorithm for maximum agreement forest, Article 70, 14 p. [Zbl 1388.68312]
Adjiashvili, David; Bindewald, Viktor; Michaels, Dennis, Robust assignments via ear decompositions and randomized rounding, Article 71, 14 p. [Zbl 1388.90062]
Jansen, Klaus; Klein, Kim-Manuel; Verschae, José, Closing the gap for makespan scheduling via sparsification techniques, Article 72, 13 p. [Zbl 1388.68123]
Demirci, Gökalp; Li, Shi, Constant approximation for capacitated \(k\)-median with \((1+\epsilon)\)-capacity violation, Article 73, 14 p. [Zbl 1388.68306]
Laekhanukit, Bundit, Approximating directed Steiner problems via tree embedding, Article 74, 13 p. [Zbl 1388.68235]
Friggstad, Zachary; Zhang, Yifeng, Tight analysis of a multiple-swap heuristic for budgeted red-blue median, Article 75, 13 p. [Zbl 1388.90064]
Bai, Shi; Stehlé, Damien; Wen, Weiqiang, Improved reduction from the bounded distance decoding problem to the unique shortest vector problem in lattices, Article 76, 12 p. [Zbl 1391.94869]
Yuen, Henry, A parallel repetition theorem for all entangled games, Article 77, 13 p. [Zbl 1390.91046]
Kurpisz, Adam; Leppänen, Samuli; Mastrolilli, Monaldo, Tight sum-of-squares lower bounds for binary polynomial optimization problems, Article 78, 14 p. [Zbl 1388.90094]
Brown-Cohen, Jonah; Raghavendra, Prasad, Correlation decay and tractability of CSPs, Article 79, 13 p. [Zbl 1388.68301]
Bennett, Huck; Reichman, Daniel; Shinkar, Igor, On percolation and NP-hardness, Article 80, 14 p. [Zbl 1388.68081]
Backurs, Arturs; Dikkala, Nishanth; Tzamos, Christos, Tight hardness results for maximum weight rectangles, Article 81, 13 p. [Zbl 1388.68080]
Larsen, Kasper Green; Nelson, Jelani, The Johnson-Lindenstrauss lemma is optimal for linear dimensionality reduction, Article 82, 11 p. [Zbl 1394.46009]
Andoni, Alexandr; Naor, Assaf; Neiman, Ofer, Impossibility of sketching of the 3D transportation metric with quadratic cost, Article 83, 14 p. [Zbl 1388.68279]
Yin, Yitong, Simple average-case lower bounds for approximate near-neighbor from isoperimetric inequalities, Article 84, 13 p. [Zbl 1388.68297]
Mémoli, Facundo; Sidiropoulos, Anastasios; Sridhar, Vijay, Quasimetric embeddings and their applications, Article 85, 14 p. [Zbl 1388.68236]
Göös, Mika; Pitassi, Toniann; Watson, Thomas, The landscape of communication complexity classes, Article 86, 15 p. [Zbl 1388.68075]
Braverman, Mark; Schneider, Jon, Information complexity is computable, Article 87, 10 p. [Zbl 1388.68059]
Prabhakaran, Manoj M.; Prabhakaran, Vinod M., Rényi information complexity and an information theoretic characterization of the partition bound, Article 88, 14 p. [Zbl 1388.68092]
Hrubeš, Pavel; Yehudayoff, Amir, On isoperimetric profiles and computational complexity, Article 89, 12 p. [Zbl 1388.68121]
Berman, Piotr; Murzabulatov, Meiram; Raskhodnikova, Sofya, Tolerant testers of image properties, Article 90, 14 p. [Zbl 1388.68281]
Dixit, Kashyap; Raskhodnikova, Sofya; Thakurta, Abhradeep; Varma, Nithin, Erasure-resilient property testing, Article 91, 15 p. [Zbl 1388.68295]
Grønlund, Allan; Larsen, Kasper Green, Towards tight lower bounds for range reporting on the RAM, Article 92, 12 p. [Zbl 1388.68086]
Afshani, Peyman; Nielsen, Jesper Sindahl, Data structure lower bounds for document indexing problems, Article 93, 15 p. [Zbl 1388.68026]
Chen, Hubie, Proof complexity modulo the polynomial hierarchy: understanding alternation as a source of hardness, Article 94, 14 p. [Zbl 1387.03067]
Wilke, Thomas, Past, present, and infinite future, Article 95, 14 p. [Zbl 1388.03040]
Bojanczyk, Mikolaj, Thin MSO with a probabilistic path quantifier, Article 96, 13 p. [Zbl 1387.03005]
Goubault-Larrecq, Jean; Schmitz, Sylvain, Deciding piecewise testable separability for regular tree languages, Article 97, 15 p. [Zbl 1388.68172]
Chatterjee, Krishnendu; Doyen, Laurent, Computation tree logic for synchronization properties, Article 98, 14 p. [Zbl 1388.68184]
Skrzypczak, Michal; Walukiewicz, Igor, Deciding the topological complexity of Büchi languages, Article 99, 13 p. [Zbl 1388.68181]
Chonev, Ventsislav; Ouaknine, Joël; Worrell, James, On the Skolem problem for continuous linear dynamical systems, Article 100, 13 p. [Zbl 1388.68043]
Bertrand, Nathalie; Bouyer, Patricia; Brihaye, Thomas; Carlier, Pierre, Analysing decisive stochastic processes, Article 101, 14 p. [Zbl 1388.68202]
Gburek, Daniel; Baier, Christel; Klüppelholz, Sascha, Composition of stochastic transition systems based on spans and couplings, Article 102, 15 p. [Zbl 1388.68196]
Chistikov, Dmitry; Kiefer, Stefan; Marusic, Ines; Shirmohammadi, Mahsa; Worrell, James, On restricted nonnegative matrix factorization, Article 103, 14 p. [Zbl 1388.15010]
Bruna, Maria; Grigore, Radu; Kiefer, Stefan; Ouaknine, Joël; Worrell, James, Proving the Herman-protocol conjecture, Article 104, 12 p. [Zbl 1388.68060]
Göller, Stefan; Haase, Christoph; Lazic, Ranko; Totzke, Patrick, A polynomial-time algorithm for reachability in branching VASS in dimension one, Article 105, 13 p. [Zbl 1388.68197]
Bouyer, Patricia; Markey, Nicolas; Randour, Mickael; Sangnier, Arnaud; Stan, Daniel, Reachability in networks of register protocols under stochastic schedulers, Article 106, 14 p. [Zbl 1388.68195]
Barthe, Gilles; Gaboardi, Marco; Grégoire, Benjamin; Hsu, Justin; Strub, Pierre-Yves, A program logic for union bounds, Article 107, 15 p. [Zbl 1388.68022]
Hoyrup, Mathieu, The decidable properties of subrecursive functions, Article 108, 13 p. [Zbl 1388.68140]
Bournez, Olivier; Graça, Daniel S.; Pouly, Amaury, Polynomial time corresponds to solutions of polynomial ordinary differential equations of polynomial length: the general purpose analog computer and computable analysis are two efficiently equivalent models of computations, Article 109, 15 p. [Zbl 1388.68041]
Sablik, Mathieu; Schraudner, Michael, Algorithmic complexity for the realization of an effective subshift by a sofic, Article 110, 14 p. [Zbl 1388.68134]
Asada, Kazuyuki; Kobayashi, Naoki, On word and frontier languages of unsafe higher-order grammars, Article 111, 13 p. [Zbl 1388.68157]
Gehrke, Mai; Petrisan, Daniela; Reggio, Luca, The Schützenberger product for syntactic spaces, Article 112, 14 p. [Zbl 1388.68193]
Kishida, Kohei, Logic of local inference for contextuality in quantum physics and beyond, Article 113, 14 p. [Zbl 1391.81020]
Baschenis, Félix; Gauwin, Olivier; Muscholl, Anca; Puppis, Gabriele, Minimizing resources of sweeping and streaming string transducers, Article 114, 14 p. [Zbl 1388.68158]
Grandjean, Anaël; Poupet, Victor, A linear acceleration theorem for 2D cellular automata on all complete neighborhoods, Article 115, 12 p. [Zbl 1388.68194]
Tamm, Hellis, New interpretation and generalization of the Kameda-Weiner method, Article 116, 12 p. [Zbl 1388.68182]
Praveen, M.; Srivathsan, B., Nesting depth of operators in graph database queries: expressiveness vs. evaluation complexity, Article 117, 14 p. [Zbl 1388.68032]
Feuilloley, Laurent; Fraigniaud, Pierre; Hirvonen, Juho, A hierarchy of local decision, Article 118, 15 p. [Zbl 1388.68062]
Bodirsky, Manuel; Martin, Barnaby; Pinsker, Michael; Pongrácz, András, Constraint satisfaction problems for reducts of homogeneous graphs, Article 119, 14 p. [Zbl 1388.68102]
Arapinis, Myrto; Figueira, Diego; Gaboardi, Marco, Sensitivity of counting queries, Article 120, 13 p. [Zbl 1388.68029]
Condurache, Rodica; Filiot, Emmanuel; Gentilini, Raffaella; Raskin, Jean-François, The complexity of rational synthesis, Article 121, 15 p. [Zbl 1388.68163]
Casel, Katrin; Fernau, Henning; Gaspers, Serge; Gras, Benjamin; Schmid, Markus L., On the complexity of grammar-based compression over fixed alphabets, Article 122, 14 p. [Zbl 1388.68036]
Zetzsche, Georg, The complexity of downward closure comparisons, Article 123, 14 p. [Zbl 1388.68183]
Fici, Gabriele; Restivo, Antonio; Silva, Manuel; Zamboni, Luca Q., Anti-powers in infinite words, Article 124, 9 p. [Zbl 1388.68243]
Filiot, Emmanuel; Jecker, Ismaël; Löding, Christof; Winter, Sarah, On equivalence and uniformisation problems for finite transducers, Article 125, 14 p. [Zbl 1388.68170]
Colcombet, Thomas; Fijalkow, Nathanaël, The bridge between regular cost functions and omega-regular languages, Article 126, 13 p. [Zbl 1388.68162]
Diekert, Volker; Jez, Artur; Kufleitner, Manfred, Solutions of word equations over partially commutative structures, Article 127, 14 p. [Zbl 1388.68164]
Chistikov, Dmitry; Haase, Christoph, The taming of the semi-linear set, Article 128, 13 p. [Zbl 1388.68190]
Diekert, Volker; Walter, Tobias, Characterizing classes of regular languages using prefix codes of bounded synchronization delay, Article 129, 14 p. [Zbl 1388.68165]
Choudhary, Keerti, An optimal dual fault tolerant reachability oracle, Article 130, 13 p. [Zbl 1388.68217]
Cheung, Yun Kuen; Goranci, Gramoz; Henzinger, Monika, Graph minors for preserving terminal distances approximately – lower and upper bounds, Article 131, 14 p. [Zbl 1388.68214]
Alstrup, Stephen; Gørtz, Inge Li; Halvorsen, Esben Bistrup; Porat, Ely, Distance labeling schemes for trees, Article 132, 16 p. [Zbl 1388.68206]
Petersen, Casper; Rotbart, Noy; Simonsen, Jakob Grue; Wulff-Nilsen, Christian, Near optimal adjacency labeling schemes for power-law graphs, Article 133, 15 p. [Zbl 1388.68239]
Chiesa, Marco; Gurtov, Andrei; Madry, Aleksander; Mitrovic, Slobodan; Nikolaevskiy, Ilya; Shapira, Michael; Shenker, Scott, On the resiliency of randomized routing against multiple edge failures, Article 134, 15 p. [Zbl 1388.68215]
Harsha, Prahladh; Jain, Rahul; Radhakrishnan, Jaikumar, Partition bound is quadratically tight for product distributions, Article 135, 13 p. [Zbl 1388.68119]
Berenbrink, Petra; Friedetzky, Tom; Giakkoupis, George; Kling, Peter, Efficient plurality consensus, or: the benefits of cleaning up from time to time, Article 136, 14 p. [Zbl 1388.68014]
Charron-Bost, Bernadette; Függer, Matthias; Nowak, Thomas, Fast, robust, quantizable approximate consensus, Article 137, 14 p. [Zbl 1388.68293]
Ghaffari, Mohsen; Newport, Calvin, Leader election in unreliable radio networks, Article 138, 14 p. [Zbl 1388.68016]
Czumaj, Artur; Davies, Peter, Faster deterministic communication in radio networks, Article 139, 14 p. [Zbl 1387.68032]
Babaioff, Moshe; Blumrosen, Liad; Nisan, Noam, Networks of complements, Article 140, 14 p. [Zbl 1390.91139]
Krysta, Piotr; Zhang, Jinshan, House markets with matroid and knapsack constraints, Article 141, 14 p. [Zbl 1390.91225]
Goel, Gagan; Leonardi, Stefano; Mirrokni, Vahab; Nikzad, Afshin; Paes-Leme, Renato, Reservation exchange markets for internet advertising, Article 142, 13 p. [Zbl 1390.91144]
Im, Sungjin; Kulkarni, Janardhan; Munagala, Kamesh, Competitive analysis of constrained queueing systems, Article 143, 13 p. [Zbl 1388.68018]
Cooper, Colin; Rivera, Nicolás, The linear voting model, Article 144, 12 p. [Zbl 1388.68220]
Cooper, Colin; Dyer, Martin; Frieze, Alan; Rivera, Nicolás, Discordant voting processes on finite graphs, Article 145, 13 p. [Zbl 1388.68219]
Berenbrink, Petra; Giakkoupis, George; Kermarrec, Anne-Marie; Mallmann-Trenn, Frederik, Bounds on the voter model in dynamic networks, Article 146, 15 p. [Zbl 1388.68015]
Koch, Christoph; Lengler, Johannes, Bootstrap percolation on geometric inhomogeneous random graphs, Article 147, 15 p. [Zbl 1388.68234]
Conte, Alessio; Grossi, Roberto; Marino, Andrea; Versari, Luca, Sublinear-space bounded-delay enumeration for massive network analytics: maximal cliques, Article 148, 15 p. [Zbl 1388.68218]
Axiotis, Kyriakos; Fotakis, Dimitris, On the size and the approximability of minimum temporally connected subgraphs, Article 149, 14 p. [Zbl 1388.68299]
Doerr, Benjamin; Künnemann, Marvin, Improved protocols and hardness results for the two-player cryptogenography problem, Article 150, 13 p. [Zbl 1423.94068]

MSC:

68-06 Proceedings, conferences, collections, etc. pertaining to computer science
68Nxx Theory of software
68Qxx Theory of computing
00B25 Proceedings of conferences of miscellaneous specific interest
PDFBibTeX XMLCite
Full Text: Link Link