Characterizing Classes of Regular Languages Using Prefix Codes of Bounded Synchronization Delay (Englisch)
Freier Zugriff
- Neue Suche nach: Diekert, Volker
- Neue Suche nach: Walter, Tobias
- Neue Suche nach: Diekert, Volker
- Neue Suche nach: Walter, Tobias
- Neue Suche nach: Chatzigiannakis, Ioannis
- Neue Suche nach: Mitzenmacher, Michael
- Neue Suche nach: Rabani, Yuval
- Neue Suche nach: Sangiorgi, Davide
In:
LIPIcs, Volume 55, ICALP 2016
: 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)
;
55
;
129:1-129:14
;
2016
-
ISBN:
-
ISSN:
- Aufsatz (Konferenz) / Elektronische Ressource
-
Titel:Characterizing Classes of Regular Languages Using Prefix Codes of Bounded Synchronization Delay
-
Beteiligte:Diekert, Volker ( Autor:in ) / Walter, Tobias ( Autor:in ) / Chatzigiannakis, Ioannis ( Herausgeber:in ) / Mitzenmacher, Michael ( Herausgeber:in ) / Rabani, Yuval ( Herausgeber:in ) / Sangiorgi, Davide ( Herausgeber:in )
-
Erschienen in:LIPIcs, Volume 55, ICALP 2016 : 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016) ; 55 ; 129:1-129:14Leibniz International Proceedings in Informatics (LIPIcs) ; 55 ; 129:1-129:14
-
Verlag:
- Neue Suche nach: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
-
Erscheinungsdatum:23.08.2016
-
Format / Umfang:14 pages , 589986 byte
-
Anmerkungen:LIPIcs, Vol. 55, 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016), pages 129:1-129:14
-
ISBN:
-
ISSN:
-
DOI:
-
Medientyp:Aufsatz (Konferenz)
-
Format:Elektronische Ressource
-
Sprache:Englisch
-
Schlagwörter:
-
Lizenzbestimmungen:
-
Datenquelle:
Inhaltsverzeichnis Konferenzband
Die Inhaltsverzeichnisse werden automatisch erzeugt und basieren auf den im Index des TIB-Portals verfügbaren Einzelnachweisen der enthaltenen Beiträge. Die Anzeige der Inhaltsverzeichnisse kann daher unvollständig oder lückenhaft sein.
- 1
-
Compute Choice (Invited Talk)Shah, Devavrat et al. | 2016
- 2
-
Formally Verifying a Compiler: What Does It Mean, Exactly? (Invited Talk)Leroy, Xavier et al. | 2016
- 3
-
Hardness of Approximation (Invited Talk)Khot, Subhash et al. | 2016
- 4
-
Model Checking and Strategy Synthesis for Stochastic Games: From Theory to Practice (Invited Talk)Kwiatkowska, Marta Z. et al. | 2016
- 5
-
Fine-Grained Complexity Analysis of Two Classic TSP Variantsde Berg, Mark / Buchin, Kevin / Jansen, Bart M. P. / Woeginger, Gerhard et al. | 2016
- 6
-
Bicovering: Covering Edges With Two Small Subsets of VerticesBhangale, Amey / Gandhi, Rajiv / Hajiaghayi, Mohammad Taghi / Khandekar, Rohit / Kortsarz, Guy et al. | 2016
- 7
-
Constant Congestion Routing of Symmetric Demands in Planar Directed GraphsChekuri, Chandra / Ene, Alina / Pilipczuk, Marcin et al. | 2016
- 8
-
Quasi-4-Connected ComponentsGrohe, Martin et al. | 2016
- 9
-
Subexponential Time Algorithms for Embedding H-Minor Free GraphsBodlaender, Hans L. / Nederlof, Jesper / van der Zanden, Tom C. et al. | 2016
- 10
-
Relating Graph Thickness to Planar Layers and Bend ComplexityDurocher, Stephane / Mondal, Debajyoti et al. | 2016
- 11
-
Optimal Approximate Matrix Product in Terms of Stable RankCohen, Michael B. / Nelson, Jelani / Woodruff, David P. et al. | 2016
- 12
-
Approximate Span ProgramsIto, Tsuyoshi / Jeffery, Stacey et al. | 2016
- 13
-
Power of Quantum Computation with Few Clean QubitsFujii, Keisuke / Kobayashi, Hirotada / Morimae, Tomoyuki / Nishimura, Harumichi / Tamate, Shuhei / Tani, Seiichiro et al. | 2016
- 14
-
Space-Efficient Error Reduction for Unitary Quantum ComputationsFefferman, Bill / Kobayashi, Hirotada / Yen-Yu Lin, Cedric / Morimae, Tomoyuki / Nishimura, Harumichi et al. | 2016
- 15
-
Linear Time Algorithm for Quantum 2SATArad, Itai / Santha, Miklos / Sundaram, Aarthi / Zhang, Shengyu et al. | 2016
- 16
-
Optimal Quantum Algorithm for Polynomial InterpolationChilds, Andrew M. / van Dam, Wim / Hung, Shih-Han / Shparlinski, Igor E. et al. | 2016
- 17
-
Lower Bounds for the Approximate Degree of Block-Composed FunctionsThaler, Justin et al. | 2016
- 18
-
Dynamic Graph Stream Algorithms in o(n) SpaceHuang, Zengfeng / Peng, Pan et al. | 2016
- 19
-
Diameter and k-Center in Sliding WindowsCohen-Addad, Vincent / Schwiegelshohn, Chris / Sohler, Christian et al. | 2016
- 20
-
Approximate Hamming Distance in a StreamClifford, Raphaël / Starikovskaya, Tatiana et al. | 2016
- 21
-
Price of Competition and Dueling GamesDehghani, Sina / Hajiaghayi, Mohammad Taghi / Mahini, Hamid / Seddighin, Saeed et al. | 2016
- 22
-
Popular Half-Integral MatchingsKavitha, Telikepalli et al. | 2016
- 23
-
Voronoi Choice GamesBoppana, Meena / Hod, Rani / Mitzenmacher, Michael / Morgan, Tom et al. | 2016
- 24
-
The Complexity of Hex and the Jordan Curve TheoremAdler, Aviv / Daskalakis, Constantinos / Demaine, Erik D. et al. | 2016
- 25
-
Fractals for Kernelization Lower Bounds, With an Application to Length-Bounded Cut ProblemsFluschnik, Till / Hermelin, Danny / Nichterlein, André / Niedermeier, Rolf et al. | 2016
- 26
-
Kernelization of Cycle Packing with Relaxed Disjointness ConstraintsAgrawal, Akanksha / Lokshtanov, Daniel / Majumdar, Diptapriyo / Mouawad, Amer E. / Saurabh, Saket et al. | 2016
- 27
-
The Complexity Landscape of Fixed-Parameter Directed Steiner Network ProblemsFeldmann, Andreas Emil / Marx, Dániel et al. | 2016
- 28
-
Double-Exponential and Triple-Exponential Bounds for Choosability Problems Parameterized by TreewidthMarx, Dániel / Mitsou, Valia et al. | 2016
- 29
-
Do Distributed Differentially-Private Protocols Require Oblivious Transfer?Goyal, Vipul / Khurana, Dakshita / Mironov, Ilya / Pandey, Omkant / Sahai, Amit et al. | 2016
- 30
-
Functional Commitment Schemes: From Polynomial Commitments to Pairing-Based Accumulators from Simple AssumptionsLibert, Benoît / Ramanna, Somindu C. / Yung, Moti et al. | 2016
- 31
-
Block-Wise Non-Malleable CodesChandran, Nishanth / Goyal, Vipul / Mukherjee, Pratyay / Pandey, Omkant / Upadhyay, Jalaj et al. | 2016
- 32
-
Provably Secure Virus Detection: Using The Observer Effect Against MalwareLipton, Richard J. / Ostrovsky, Rafail / Zikas, Vassilis et al. | 2016
- 33
-
An Almost Cubic Lower Bound for Depth Three Arithmetic CircuitsKayal, Neeraj / Saha, Chandan / Tavenas, Sébastien et al. | 2016
- 34
-
Boundaries of VP and VNPGrochow, Joshua A. / Mulmuley, Ketan D. / Qiao, Youming et al. | 2016
- 35
-
AC^0 o MOD_2 Lower Bounds for the Boolean Inner ProductCheraghchi, Mahdi / Grigorescu, Elena / Juba, Brendan / Wimmer, Karl / Xie, Ning et al. | 2016
- 36
-
Lower Bounds for Nondeterministic Semantic Read-Once Branching ProgramsCook, Stephen / Edmonds, Jeff / Medabalimi, Venkatesh / Pitassi, Toniann et al. | 2016
- 37
-
Improved Bounds on the Sign-Rank of AC^0Bun, Mark / Thaler, Justin et al. | 2016
- 38
-
On the Sensitivity ConjectureTal, Avishay et al. | 2016
- 39
-
Randomization Can Be as Helpful as a Glimpse of the Future in Online ComputationMikkelsen, Jesper W. et al. | 2016
- 40
-
Online Semidefinite ProgrammingElad, Noa / Kale, Satyen / Naor, Joseph (Seffi) et al. | 2016
- 41
-
Beating the Harmonic Lower Bound for Online Bin PackingHeydrich, Sandy / van Stee, Rob et al. | 2016
- 42
-
Online Weighted Degree-Bounded Steiner Networks via Novel Online Mixed Packing/CoveringDehghani, Sina / Ehsani, Soheil / Hajiaghayi, Mohammad Taghi / Liaghat, Vahid / Räcke, Harald / Seddighin, Saeed et al. | 2016
- 43
-
Carpooling in Social NetworksFiat, Amos / Karlin, Anna R. / Koutsoupias, Elias / Mathieu, Claire / Zach, Rotem et al. | 2016
- 44
-
An Improved Analysis of the ER-SpUD Dictionary Learning AlgorithmBlasiok, Jaroslaw / Nelson, Jelani et al. | 2016
- 45
-
Approximation via Correlation Decay When Strong Spatial Mixing FailsBezáková, Ivona / Galanis, Andreas / Goldberg, Leslie Ann / Guo, Heng / Stefankovic, Daniel et al. | 2016
- 46
-
A Complexity Trichotomy for Approximately Counting List H-ColouringsGalanis, Andreas / Goldberg, Leslie Ann / Jerrum, Mark et al. | 2016
- 47
-
Parity Separation: A Scientifically Proven Method for Permanent Weight LossCurticapean, Radu et al. | 2016
- 48
-
On the Hardness of Partially Dynamic Graph Problems and Connections to DiameterDahlgaard, Søren et al. | 2016
- 49
-
Incremental 2-Edge-Connectivity in Directed GraphsGeorgiadis, Loukas / Italiano, Giuseppe F. / Parotsidis, Nikos et al. | 2016
- 50
-
Unified Acceleration Method for Packing and Covering Problems via Diameter ReductionWang, Di / Rao, Satish / Mahoney, Michael W. et al. | 2016
- 51
-
Random-Edge Is Slower Than Random-Facet on Abstract CubesHansen, Thomas Dueholm / Zwick, Uri et al. | 2016
- 52
-
Approximating the Solution to Mixed Packing and Covering LPs in Parallel O˜(epsilon^{-3}) TimeMahoney, Michael W. / Rao, Satish / Wang, Di / Zhang, Peng et al. | 2016
- 53
-
Optimization Algorithms for Faster Computational GeometryAllen-Zhu, Zeyuan / Liao, Zhenyu / Yuan, Yang et al. | 2016
- 54
-
A Fast Distributed Stateless Algorithm for alpha-Fair Packing ProblemsMarasevic, Jelena / Stein, Clifford / Zussman, Gil et al. | 2016
- 55
-
All-Pairs Approximate Shortest Paths and Distance Oracle PreprocessingSommer, Christian et al. | 2016
- 56
-
Total Space in Resolution Is at Least Width SquaredBonacina, Ilario et al. | 2016
- 57
-
Supercritical Space-Width Trade-Offs for ResolutionBerkholz, Christoph / Nordström, Jakob et al. | 2016
- 58
-
Deterministic Time-Space Trade-Offs for k-SUMLincoln, Andrea / Vassilevska Williams, Virginia / Wang, Joshua R. / Williams, R. Ryan et al. | 2016
- 59
-
Semi-Streaming Algorithms for Annotated Graph StreamsThaler, Justin et al. | 2016
- 60
-
Randomized Query Complexity of Sabotaged and Composed FunctionsShalev, Ben-David / Kothari, Robin et al. | 2016
- 61
-
Coding for Interactive Communication Correcting Insertions and DeletionsBraverman, Mark / Gelles, Ran / Mao, Jieming / Ostrovsky, Rafail et al. | 2016
- 62
-
Amplifiers for the Moran ProcessGalanis, Andreas / Göbel, Andreas / Goldberg, Leslie Ann / Lapinskas, John / Richerby, David et al. | 2016
- 63
-
Mixing Time of Markov Chains, Dynamical Systems and EvolutionPanageas, Ioannis / Vishnoi, Nisheeth K. et al. | 2016
- 64
-
Information Cascades on Arbitrary TopologiesWan, Jun / Xia, Yu / Li, Liang / Moscibroda, Thomas et al. | 2016
- 65
-
Analysing Survey Propagation Guided Decimationon Random FormulasHetterich, Samuel et al. | 2016
- 66
-
Approximation Algorithms for Aversion k-Clustering via Local k-MedianGupta, Anupam / Guruganesh, Guru / Schmidt, Melanie et al. | 2016
- 67
-
The Non-Uniform k-Center ProblemChakrabarty, Deeparnab / Goyal, Prachi / Krishnaswamy, Ravishankar et al. | 2016
- 68
-
k-Center Clustering Under Perturbation ResilienceBalcan, Maria-Florina / Haghtalab, Nika / White, Colin et al. | 2016
- 69
-
Approximation Algorithms for Clustering Problems with Lower Bounds and OutliersAhmadian, Sara / Swamy, Chaitanya et al. | 2016
- 70
-
A Duality Based 2-Approximation Algorithm for Maximum Agreement ForestSchalekamp, Frans / van Zuylen, Anke / van der Ster, Suzanne et al. | 2016
- 71
-
Robust Assignments via Ear Decompositions and Randomized RoundingAdjiashvili, David / Bindewald, Viktor / Michaels, Dennis et al. | 2016
- 72
-
Closing the Gap for Makespan Scheduling via Sparsification TechniquesJansen, Klaus / Klein, Kim-Manuel / Verschae, José et al. | 2016
- 73
-
Constant Approximation for Capacitated k-Median with (1+epsilon)-Capacity ViolationDemirci, Gökalp / Li, Shi et al. | 2016
- 74
-
Approximating Directed Steiner Problems via Tree EmbeddingLaekhanukit, Bundit et al. | 2016
- 75
-
Tight Analysis of a Multiple-Swap Heurstic for Budgeted Red-Blue MedianFriggstad, Zachary / Zhang, Yifeng et al. | 2016
- 76
-
Improved Reduction from the Bounded Distance Decoding Problem to the Unique Shortest Vector Problem in LatticesBai, Shi / Stehlé, Damien / Wen, Weiqiang et al. | 2016
- 77
-
A Parallel Repetition Theorem for All Entangled GamesYuen, Henry et al. | 2016
- 78
-
Tight Sum-Of-Squares Lower Bounds for Binary Polynomial Optimization ProblemsKurpisz, Adam / Leppänen, Samuli / Mastrolilli, Monaldo et al. | 2016
- 79
-
Correlation Decay and Tractability of CSPsBrown-Cohen, Jonah / Raghavendra, Prasad et al. | 2016
- 80
-
On Percolation and NP-HardnessBennett, Huck / Reichman, Daniel / Shinkar, Igor et al. | 2016
- 81
-
Tight Hardness Results for Maximum Weight RectanglesBackurs, Arturs / Dikkala, Nishanth / Tzamos, Christos et al. | 2016
- 82
-
The Johnson-Lindenstrauss Lemma Is Optimal for Linear Dimensionality ReductionLarsen, Kasper Green / Nelson, Jelani et al. | 2016
- 83
-
Impossibility of Sketching of the 3D Transportation Metric with Quadratic CostAndoni, Alexandr / Naor, Assaf / Neiman, Ofer et al. | 2016
- 84
-
Simple Average-Case Lower Bounds for Approximate Near-Neighbor from Isoperimetric InequalitiesYin, Yitong et al. | 2016
- 85
-
Quasimetric Embeddings and Their ApplicationsMémoli, Facundo / Sidiropoulos, Anastasios / Sridhar, Vijay et al. | 2016
- 86
-
The Landscape of Communication Complexity ClassesGöös, Mika / Pitassi, Toniann / Watson, Thomas et al. | 2016
- 87
-
Information Complexity Is ComputableBraverman, Mark / Schneider, Jon et al. | 2016
- 88
-
Rényi Information Complexity and an Information Theoretic Characterization of the Partition BoundPrabhakaran, Manoj M. / Prabhakaran, Vinod M. et al. | 2016
- 89
-
On Isoperimetric Profiles and Computational ComplexityHrubes, Pavel / Yehudayoff, Amir et al. | 2016
- 90
-
Tolerant Testers of Image PropertiesBerman, Piotr / Murzabulatov, Meiram / Raskhodnikova, Sofya et al. | 2016
- 91
-
Erasure-Resilient Property TestingDixit, Kashyap / Raskhodnikova, Sofya / Thakurta, Abhradeep / Varma, Nithin et al. | 2016
- 92
-
Towards Tight Lower Bounds for Range Reporting on the RAMGrønlund, Allan / Larsen, Kasper Green et al. | 2016
- 93
-
Data Structure Lower Bounds for Document Indexing ProblemsAfshani, Peyman / Nielsen, Jesper Sindahl et al. | 2016
- 94
-
Proof Complexity Modulo the Polynomial Hierarchy: Understanding Alternation as a Source of HardnessChen, Hubie et al. | 2016
- 95
-
Past, Present, and Infinite FutureWilke, Thomas et al. | 2016
- 96
-
Thin MSO with a Probabilistic Path QuantifierBojanczyk, Mikolaj et al. | 2016
- 97
-
Deciding Piecewise Testable Separability for Regular Tree LanguagesGoubault-Larrecq, Jean / Schmitz, Sylvain et al. | 2016
- 98
-
Computation Tree Logic for Synchronization PropertiesChatterjee, Krishnendu / Doyen, Laurent et al. | 2016
- 99
-
Deciding the Topological Complexity of Büchi LanguagesSkrzypczak, Michal / Walukiewicz, Igor et al. | 2016
- 100
-
On the Skolem Problem for Continuous Linear Dynamical SystemsChonev, Ventsislav / Ouaknine, Joël / Worrell, James et al. | 2016
- 101
-
Analysing Decisive Stochastic ProcessesBertrand, Nathalie / Bouyer, Patricia / Brihaye, Thomas / Carlier, Pierre et al. | 2016
- 102
-
Composition of Stochastic Transition Systems Based on Spans and CouplingsGburek, Daniel / Baier, Christel / Klüppelholz, Sascha et al. | 2016
- 103
-
On Restricted Nonnegative Matrix FactorizationChistikov, Dmitry / Kiefer, Stefan / Marusic, Ines / Shirmohammadi, Mahsa / Worrell, James et al. | 2016
- 104
-
Proving the Herman-Protocol ConjectureBruna, Maria / Grigore, Radu / Kiefer, Stefan / Ouaknine, Joël / Worrell, James et al. | 2016
- 105
-
A Polynomial-Time Algorithm for Reachability in Branching VASS in Dimension OneGöller, Stefan / Haase, Christoph / Lazic, Ranko / Totzke, Patrick et al. | 2016
- 106
-
Reachability in Networks of Register Protocols under Stochastic SchedulersBouyer, Patricia / Markey, Nicolas / Randour, Mickael / Sangnier, Arnaud / Stan, Daniel et al. | 2016
- 107
-
A Program Logic for Union BoundsBarthe, Gilles / Gaboardi, Marco / Grégoire, Benjamin / Hsu, Justin / Strub, Pierre-Yves et al. | 2016
- 108
-
The Decidable Properties of Subrecursive FunctionsHoyrup, Mathieu et al. | 2016
- 109
-
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 ComputationsBournez, Olivier / Graça, Daniel S. / Pouly, Amaury et al. | 2016
- 110
-
Algorithmic Complexity for the Realization of an Effective Subshift By a SoficSablik, Mathieu / Schraudner, Michael et al. | 2016
- 111
-
On Word and Frontier Languages of Unsafe Higher-Order GrammarsAsada, Kazuyuki / Kobayashi, Naoki et al. | 2016
- 112
-
The Schützenberger Product for Syntactic SpacesGehrke, Mai / Petrisan, Daniela / Reggio, Luca et al. | 2016
- 113
-
Logic of Local Inference for Contextuality in Quantum Physics and BeyondKishida, Kohei et al. | 2016
- 114
-
Minimizing Resources of Sweeping and Streaming String TransducersBaschenis, Félix / Gauwin, Olivier / Muscholl, Anca / Puppis, Gabriele et al. | 2016
- 115
-
A Linear Acceleration Theorem for 2D Cellular Automata on All Complete NeighborhoodsGrandjean, Anaël / Poupet, Victor et al. | 2016
- 116
-
New Interpretation and Generalization of the Kameda-Weiner MethodTamm, Hellis et al. | 2016
- 117
-
Nesting Depth of Operators in Graph Database Queries: Expressiveness vs. Evaluation ComplexityPraveen, M. / Srivathsan, B. et al. | 2016
- 118
-
A Hierarchy of Local DecisionFeuilloley, Laurent / Fraigniaud, Pierre / Hirvonen, Juho et al. | 2016
- 119
-
Constraint Satisfaction Problems for Reducts of Homogeneous GraphsBodirsky, Manuel / Martin, Barnaby / Pinsker, Michael / Pongrácz, András et al. | 2016
- 120
-
Sensitivity of Counting QueriesArapinis, Myrto / Figueira, Diego / Gaboardi, Marco et al. | 2016
- 121
-
The Complexity of Rational SynthesisCondurache, Rodica / Filiot, Emmanuel / Gentilini, Raffaella / Raskin, Jean-François et al. | 2016
- 122
-
On the Complexity of Grammar-Based Compression over Fixed AlphabetsCasel, Katrin / Fernau, Henning / Gaspers, Serge / Gras, Benjamin / Schmid, Markus L. et al. | 2016
- 123
-
The Complexity of Downward Closure ComparisonsZetzsche, Georg et al. | 2016
- 124
-
Anti-Powers in Infinite WordsFici, Gabriele / Restivo, Antonio / Silva, Manuel / Zamboni, Luca Q. et al. | 2016
- 125
-
On Equivalence and Uniformisation Problems for Finite TransducersFiliot, Emmanuel / Jecker, Ismaël / Löding, Christof / Winter, Sarah et al. | 2016
- 126
-
The Bridge Between Regular Cost Functions and Omega-Regular LanguagesColcombet, Thomas / Fijalkow, Nathanaël et al. | 2016
- 127
-
Solutions of Word Equations Over Partially Commutative StructuresDiekert, Volker / Jez, Artur / Kufleitner, Manfred et al. | 2016
- 128
-
The Taming of the Semi-Linear SetChistikov, Dmitry / Haase, Christoph et al. | 2016
- 129
-
Characterizing Classes of Regular Languages Using Prefix Codes of Bounded Synchronization DelayDiekert, Volker / Walter, Tobias et al. | 2016
- 130
-
An Optimal Dual Fault Tolerant Reachability OracleChoudhary, Keerti et al. | 2016
- 131
-
Graph Minors for Preserving Terminal Distances Approximately - Lower and Upper BoundsCheung, Yun Kuen / Goranci, Gramoz / Henzinger, Monika et al. | 2016
- 132
-
Distance Labeling Schemes for TreesAlstrup, Stephen / Gørtz, Inge Li / Halvorsen, Esben Bistrup / Porat, Ely et al. | 2016
- 133
-
Near Optimal Adjacency Labeling Schemes for Power-Law GraphsPetersen, Casper / Rotbart, Noy / Simonsen, Jakob Grue / Wulff-Nilsen, Christian et al. | 2016
- 134
-
On the Resiliency of Randomized Routing Against Multiple Edge FailuresChiesa, Marco / Gurtov, Andrei / Madry, Aleksander / Mitrovic, Slobodan / Nikolaevskiy, Ilya / Shapira, Michael / Shenker, Scott et al. | 2016
- 135
-
Partition Bound Is Quadratically Tight for Product DistributionsHarsha, Prahladh / Jain, Rahul / Radhakrishnan, Jaikumar et al. | 2016
- 136
-
Efficient Plurality Consensus, Or: the Benefits of Cleaning up from Time to TimeBerenbrink, Petra / Friedetzky, Tom / Giakkoupis, George / Kling, Peter et al. | 2016
- 137
-
Fast, Robust, Quantizable Approximate ConsensusCharron-Bost, Bernadette / Függer, Matthias / Nowak, Thomas et al. | 2016
- 138
-
Leader Election in Unreliable Radio NetworksGhaffari, Mohsen / Newport, Calvin et al. | 2016
- 139
-
Faster Deterministic Communication in Radio NetworksCzumaj, Artur / Davies, Peter et al. | 2016
- 140
-
Networks of ComplementsBabaioff, Moshe / Blumrosen, Liad / Nisan, Noam et al. | 2016
- 141
-
House Markets with Matroid and Knapsack ConstraintsKrysta, Piotr / Zhang, Jinshan et al. | 2016
- 142
-
Reservation Exchange Markets for Internet AdvertisingGoel, Gagan / Leonardi, Stefano / Mirrokni, Vahab / Nikzad, Afshin / Paes-Leme, Renato et al. | 2016
- 143
-
Competitive Analysis of Constrained Queueing SystemsIm, Sungjin / Kulkarni, Janardhan / Munagala, Kamesh et al. | 2016
- 144
-
The Linear Voting ModelCooper, Colin / Rivera, Nicolás et al. | 2016
- 145
-
Discordant Voting Processes on Finite GraphsCooper, Colin / Dyer, Martin / Frieze, Alan / Rivera, Nicolás et al. | 2016
- 146
-
Bounds on the Voter Model in Dynamic NetworksBerenbrink, Petra / Giakkoupis, George / Kermarrec, Anne-Marie / Mallmann-Trenn, Frederik et al. | 2016
- 147
-
Bootstrap Percolation on Geometric Inhomogeneous Random GraphsKoch, Christoph / Lengler, Johannes et al. | 2016
- 148
-
Sublinear-Space Bounded-Delay Enumeration for Massive Network Analytics: Maximal CliquesConte, Alessio / Grossi, Roberto / Marino, Andrea / Versari, Luca et al. | 2016
- 149
-
On the Size and the Approximability of Minimum Temporally Connected SubgraphsAxiotis, Kyriakos / Fotakis, Dimitris et al. | 2016
- 150
-
Improved Protocols and Hardness Results for the Two-Player Cryptogenography ProblemDoerr, Benjamin / Künnemann, Marvin et al. | 2016