Reordering Buffer Management with a Logarithmic Guarantee in General Metric Spaces (Englisch)
Freier Zugriff
- Neue Suche nach: Kohler, Matthias
- Neue Suche nach: Räcke, Harald
- Neue Suche nach: Kohler, Matthias
- Neue Suche nach: Räcke, Harald
- Neue Suche nach: Chatzigiannakis, Ioannis
- Neue Suche nach: Indyk, Piotr
- Neue Suche nach: Kuhn, Fabian
- Neue Suche nach: Muscholl, Anca
In:
LIPIcs, Volume 80, ICALP 2017
: 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)
;
80
;
33:1-33:12
;
2017
-
ISBN:
-
ISSN:
- Aufsatz (Konferenz) / Elektronische Ressource
-
Titel:Reordering Buffer Management with a Logarithmic Guarantee in General Metric Spaces
-
Beteiligte:Kohler, Matthias ( Autor:in ) / Räcke, Harald ( Autor:in ) / Chatzigiannakis, Ioannis ( Herausgeber:in ) / Indyk, Piotr ( Herausgeber:in ) / Kuhn, Fabian ( Herausgeber:in ) / Muscholl, Anca ( Herausgeber:in )
-
Erschienen in:LIPIcs, Volume 80, ICALP 2017 : 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017) ; 80 ; 33:1-33:12Leibniz International Proceedings in Informatics (LIPIcs) ; 80 ; 33:1-33:12
-
Verlag:
- Neue Suche nach: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
-
Erscheinungsdatum:07.07.2017
-
Format / Umfang:12 pages , 430668 byte
-
Anmerkungen:LIPIcs, Vol. 80, 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017), pages 33:1-33:12
-
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
-
Orbit-Finite Sets and Their Algorithms (Invited Talk)Bojanczyk, Mikolaj et al. | 2017
- 2
-
Efficient Algorithms for Graph-Related Problems in Computer-Aided Verification (Invited Talk)Henzinger, Monika et al. | 2017
- 3
-
Local Computation Algorithms (Invited Talk)Rubinfeld, Ronitt et al. | 2017
- 4
-
Fast and Powerful Hashing Using Tabulation (Invited Talk)Thorup, Mikkel et al. | 2017
- 5
-
Optimal Unateness Testers for Real-Valued Functions: Adaptivity HelpsBaleshzar, Roksana / Chakrabarty, Deeparnab / Pallavoor, Ramesh Krishnan S. / Raskhodnikova, Sofya / Seshadhri, C. et al. | 2017
- 6
-
Sublinear Random Access Generators for Preferential Attachment GraphsEven, Guy / Levi, Reut / Medina, Moti / Rosén, Adi et al. | 2017
- 7
-
Sublinear Time Estimation of Degree Distribution Moments: The Degeneracy ConnectionEden, Talya / Ron, Dana / Seshadhri, C. et al. | 2017
- 8
-
Near-Optimal Closeness Testing of Discrete Histogram DistributionsDiakonikolas, Ilias / Kane, Daniel M. / Nikishkin, Vladimir et al. | 2017
- 9
-
Deleting and Testing Forbidden Patterns in Multi-Dimensional ArraysBen-Eliezer, Omri / Korman, Simon / Reichman, Daniel et al. | 2017
- 10
-
On the Value of Penalties in Time-Inconsistent PlanningAlbers, Susanne / Kraft, Dennis et al. | 2017
- 11
-
Efficient Approximations for the Online Dispersion ProblemChen, Jing / Li, Bo / Li, Yingkai et al. | 2017
- 12
-
Online Covering with Sum of $ell_q$-Norm ObjectivesNagarajan, Viswanath / Shen, Xiangkun et al. | 2017
- 13
-
Dynamic Beats Fixed: On Phase-Based Algorithms for File MigrationBienkowski, Marcin / Byrka, Jaroslaw / Mucha, Marcin et al. | 2017
- 14
-
The Infinite Server ProblemCoester, Christian / Koutsoupias, Elias / Lazos, Philip et al. | 2017
- 15
-
Quantum Automata Cannot Detect Biased Coins, Even in the LimitKindler, Guy / O'Donnell, Ryan et al. | 2017
- 16
-
A New Holant Dichotomy Inspired by Quantum ComputationBackens, Miriam et al. | 2017
- 17
-
Efficient Quantum Algorithms for Simulating Lindblad EvolutionCleve, Richard / Wang, Chunhao et al. | 2017
- 18
-
Controlled Quantum AmplificationDohotaru, Catalin / Høyer, Peter et al. | 2017
- 19
-
Approximating Language Edit Distance Beyond Fast Matrix Multiplication: Ultralinear Grammars Are Where Parsing Becomes Hard!Jayaram, Rajesh / Saha, Barna et al. | 2017
- 20
-
Conditional Lower Bounds for All-Pairs Max-FlowKrauthgamer, Robert / Trabelsi, Ohad et al. | 2017
- 21
-
On the Fine-Grained Complexity of One-Dimensional Dynamic ProgrammingKünnemann, Marvin / Paturi, Ramamohan / Schneider, Stefan et al. | 2017
- 22
-
On Problems Equivalent to (min,+)-ConvolutionCygan, Marek / Mucha, Marcin / Wegrzycki, Karol / Wlodarczyk, Michal et al. | 2017
- 23
-
On Finding the Jaccard CenterBury, Marc / Schwiegelshohn, Chris et al. | 2017
- 24
-
The Polytope-Collision ProblemAlmagor, Shaull / Ouaknine, Joël / Worrell, James et al. | 2017
- 25
-
Dynamic Time Warping and Geometric Edit Distance: Breaking the Quadratic BarrierGold, Omer / Sharir, Micha et al. | 2017
- 26
-
Efficient Construction of Probabilistic Tree EmbeddingsBlelloch, Guy E. / Gu, Yan / Sun, Yihan et al. | 2017
- 27
-
Approximating Partition Functions of Bounded-Degree Boolean Counting Constraint Satisfaction ProblemsGalanis, Andreas / Goldberg, Leslie Ann / Yang, Kuan et al. | 2017
- 28
-
Inapproximability of the Independent Set Polynomial Below the Shearer ThresholdGalanis, Andreas / Goldberg, Leslie Ann / Stefankovic, Daniel et al. | 2017
- 29
-
The Complexity of Holant Problems over Boolean Domain with Non-Negative WeightsLin, Jiabao / Wang, Hanpin et al. | 2017
- 30
-
Polynomial-Time Rademacher Theorem, Porosity and RandomnessGalicki, Alex et al. | 2017
- 31
-
A QPTAS for the General Scheduling Problem with Identical Release DatesAntoniadis, Antonios / Hoeksma, Ruben / Meißner, Julie / Verschae, José / Wiese, Andreas et al. | 2017
- 32
-
Improved Algorithms for MST and Metric-TSP InterdictionLinhares, André / Swamy, Chaitanya et al. | 2017
- 33
-
Reordering Buffer Management with a Logarithmic Guarantee in General Metric SpacesKohler, Matthias / Räcke, Harald et al. | 2017
- 34
-
Correlated Rounding of Multiple Uniform Matroids and Multi-Label ClassificationChen, Shahar / Di Castro, Dotan / Karnin, Zohar / Lewin-Eytan, Liane / Naor, Joseph (Seffi) / Schwartz, Roy et al. | 2017
- 35
-
When the Optimum is also Blind: a New Perspective on Universal OptimizationAdamczyk, Marek / Grandoni, Fabrizio / Leonardi, Stefano / Wlodarczyk, Michal et al. | 2017
- 36
-
Reusable Garbled Deterministic Finite Automata from Learning With ErrorsAgrawal, Shweta / Singh, Ishaan Preet et al. | 2017
- 37
-
Round-Preserving Parallel Composition of Probabilistic-Termination Cryptographic ProtocolsCohen, Ran / Coretti, Sandro / Garay, Juan / Zikas, Vassilis et al. | 2017
- 38
-
Cryptanalysis of Indistinguishability Obfuscations of Circuits over GGH13Apon, Daniel / Döttling, Nico / Garg, Sanjam / Mukherjee, Pratyay et al. | 2017
- 39
-
Non-Uniform Attacks Against PseudoentropyPietrzak, Krzysztof / Skorski, Maciej et al. | 2017
- 40
-
Interactive Oracle Proofs with Constant Rate and Query ComplexityBen-Sasson, Eli / Chiesa, Alessandro / Gabizon, Ariel / Riabzev, Michael / Spooner, Nicholas et al. | 2017
- 41
-
Dynamic Parameterized Problems and AlgorithmsAlman, Josh / Mnich, Matthias / Vassilevska Williams, Virginia et al. | 2017
- 42
-
Decremental Data Structures for Connectivity and Dominators in Directed GraphsGeorgiadis, Loukas / Dueholm Hansen, Thomas / Italiano, Giuseppe F. / Krinninger, Sebastian / Parotsidis, Nikos et al. | 2017
- 43
-
General Bounds for Incremental MaximizationBernstein, Aaron / Disser, Yann / Groß, Martin et al. | 2017
- 44
-
Deterministic Partially Dynamic Single Source Shortest Paths in Weighted GraphsBernstein, Aaron et al. | 2017
- 45
-
Testing Core Membership in Public Goods EconomiesBodwin, Greg et al. | 2017
- 46
-
Revenue Maximization in Stackelberg Pricing Games: Beyond the Combinatorial SettingBöhnlein, Toni / Kratsch, Stefan / Schaudt, Oliver et al. | 2017
- 47
-
Online Market IntermediationGiannakopoulos, Yiannis / Koutsoupias, Elias / Lazos, Philip et al. | 2017
- 48
-
Tight Lower Bounds for Multiplicative Weights Algorithmic FamiliesGravin, Nick / Peres, Yuval / Sivan, Balasubramanian et al. | 2017
- 49
-
The Power of Shared Randomness in Uncertain CommunicationGhazi, Badih / Sudan, Madhu et al. | 2017
- 50
-
Separation of AC^0[oplus] Formulas and CircuitsRossman, Benjamin / Srinivasan, Srikanth et al. | 2017
- 51
-
Sensitivity Conjecture and Log-Rank Conjecture for Functions with Small Alternating NumbersLin, Chengyu / Zhang, Shengyu et al. | 2017
- 52
-
Randomized Communication vs. Partition NumberGöös, Mika / Jayram, T. S. / Pitassi, Toniann / Watson, Thomas et al. | 2017
- 53
-
Approximate Bounded IndistinguishabilityBogdanov, Andrej / Williamson, Christopher et al. | 2017
- 54
-
Finding Detours is Fixed-Parameter TractableBezáková, Ivona / Curticapean, Radu / Dell, Holger / Fomin, Fedor V. et al. | 2017
- 55
-
Further Approximations for Demand Matching: Matroid Constraints and Minor-Closed GraphsAhmadian, Sara / Friggstad, Zachary et al. | 2017
- 56
-
Covering Vectors by Spaces: Regular MatroidsFomin, Fedor V. / Golovach, Petr A. / Lokshtanov, Daniel / Saurabh, Saket et al. | 2017
- 57
-
Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph ClassesGiannopoulou, Archontia C. / Pilipczuk, Michal / Raymond, Jean-Florent / Thilikos, Dimitrios M. / Wrochna, Marcin et al. | 2017
- 58
-
k-Distinct In- and Out-Branchings in DigraphsGutin, Gregory / Reidl, Felix / Wahlström, Magnus et al. | 2017
- 59
-
Fast Regression with an $ell_infty$ GuaranteePrice, Eric / Song, Zhao / Woodruff, David P. et al. | 2017
- 60
-
Embeddings of Schatten Norms with Applications to Data StreamsLi, Yi / Woodruff, David P. et al. | 2017
- 61
-
On Fast Decoding of High-Dimensional Signals from One-Bit MeasurementsNakos, Vasileios et al. | 2017
- 62
-
String Inference from Longest-Common-Prefix ArrayKärkkäinen, Juha / Piatkowski, Marcin / Puglisi, Simon J. et al. | 2017
- 63
-
Neighborhood Complexity and Kernelization for Nowhere Dense Classes of GraphsEickmeyer, Kord / Giannopoulou, Archontia C. / Kreutzer, Stephan / Kwon, O-joung / Pilipczuk, Michal / Rabinovich, Roman / Siebertz, Sebastian et al. | 2017
- 64
-
Additive Spanners and Distance Oracles in Quadratic TimeKnudsen, Mathias Bæk Tejs et al. | 2017
- 65
-
Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk GraphsFomin, Fedor V. / Lokshtanov, Daniel / Panolan, Fahad / Saurabh, Saket / Zehavi, Meirav et al. | 2017
- 66
-
A Polynomial-Time Randomized Reduction from Tournament Isomorphism to Tournament AsymmetrySchweitzer, Pascal et al. | 2017
- 67
-
A (1+epsilon)-Approximation for Unsplittable Flow on a Path in Fixed-Parameter Running TimeWiese, Andreas et al. | 2017
- 68
-
Linear-Time Kernelization for Feedback Vertex SetIwata, Yoichi et al. | 2017
- 69
-
Exact Algorithms via Multivariate SubroutinesGaspers, Serge / Lee, Edward J. et al. | 2017
- 70
-
Exploring the Complexity of Layout Parameters in Tournaments and Semi-Complete DigraphsBarbero, Florian / Paul, Christophe / Pilipczuk, Michal et al. | 2017
- 71
-
Packing Cycles Faster Than Erdos-PosaLokshtanov, Daniel / Mouawad, Amer E. / Saurabh, Saket / Zehavi, Meirav et al. | 2017
- 72
-
An Efficient Strongly Connected Components Algorithm in the Fault Tolerant ModelBaswana, Surender / Choudhary, Keerti / Roditty, Liam et al. | 2017
- 73
-
Preserving Distances in Very Faulty GraphsBodwin, Greg / Grandoni, Fabrizio / Parter, Merav / Vassilevska Williams, Virginia et al. | 2017
- 74
-
All-Pairs 2-Reachability in O(n^w log n) TimeGeorgiadis, Loukas / Graf, Daniel / Italiano, Giuseppe F. / Parotsidis, Nikos / Uznanski, Przemyslaw et al. | 2017
- 75
-
Edge-OrdersSchlipf, Lena / Schmidt, Jens M. et al. | 2017
- 76
-
Relaxations of Graph IsomorphismMancinska, Laura / Roberson, David E. / Samal, Robert / Severini, Simone / Varvitsiotis, Antonios et al. | 2017
- 77
-
Honest Signaling in Zero-Sum Games Is Hard, and Lying Is Even HarderRubinstein, Aviad et al. | 2017
- 78
-
A Birthday Repetition Theorem and Complexity of Approximating Dense CSPsManurangsi, Pasin / Raghavendra, Prasad et al. | 2017
- 79
-
Inapproximability of Maximum Edge Biclique, Maximum Balanced Biclique and Minimum k-Cut from the Small Set Expansion HypothesisManurangsi, Pasin et al. | 2017
- 80
-
On the Bit Complexity of Sum-of-Squares ProofsRaghavendra, Prasad / Weitz, Benjamin et al. | 2017
- 81
-
The Dependent Doors Problem: An Investigation into Sequential Decisions without FeedbackKorman, Amos / Rodeh, Yoav et al. | 2017
- 82
-
A Tight Lower Bound for the Capture Time of the Cops and Robbers GameBrandt, Sebastian / Emek, Yuval / Uitto, Jara / Wattenhofer, Roger et al. | 2017
- 83
-
Stochastic Control via Entropy CompressionAchlioptas, Dimitris / Iliopoulos, Fotis / Vlassis, Nikos et al. | 2017
- 84
-
Approximation Strategies for Generalized Binary Search in Weighted TreesDereniowski, Dariusz / Kosowski, Adrian / Uznanski, Przemyslaw / Zou, Mengchuan et al. | 2017
- 85
-
Tighter Hard Instances for PPSZPudlák, Pavel / Scheder, Dominik / Talebanfard, Navid et al. | 2017
- 86
-
Subspace Designs Based on Algebraic Function FieldsGuruswami, Venkatesan / Xing, Chaoping / Yuan, Chen et al. | 2017
- 87
-
Bipartite Perfect Matching in Pseudo-Deterministic NCGoldwasser, Shafi / Grossman, Ofer et al. | 2017
- 88
-
A Linear Lower Bound for Incrementing a Space-Optimal Integer Representation in the Bit-Probe ModelRaskin, Mikhail et al. | 2017
- 89
-
Rerouting Flows When Links FailMatuschke, Jannik / McCormick, S. Thomas / Oriolo, Gianpaolo et al. | 2017
- 90
-
The Parameterized Complexity of Positional GamesBonnet, Édouard / Gaspers, Serge / Lambilliotte, Antonin / Rümmele, Stefan / Saffidine, Abdallah et al. | 2017
- 91
-
Directed Hamiltonicity and Out-Branchings via Generalized LaplaciansBjörklund, Andreas / Kaski, Petteri / Koutis, Ioannis et al. | 2017
- 92
-
Improved Hardness for Cut, Interdiction, and Firefighter ProblemsLee, Euiwoong et al. | 2017
- 93
-
Subspace-Invariant AC^0 FormulasRossman, Benjamin et al. | 2017
- 94
-
On the Complexity of Quantified Integer ProgrammingChistikov, Dmitry / Haase, Christoph et al. | 2017
- 95
-
Word Equations in Nondeterministic Linear SpaceJez, Artur et al. | 2017
- 96
-
Solutions of Twisted Word Equations, EDT0L Languages, and Context-Free GroupsDiekert, Volker / Elder, Murray et al. | 2017
- 97
-
Pumping Lemma for Higher-order LanguagesAsada, Kazuyuki / Kobayashi, Naoki et al. | 2017
- 98
-
A Strategy for Dynamic Programs: Start over and Muddle ThroughDatta, Samir / Mukherjee, Anish / Schwentick, Thomas / Vortmeier, Nils / Zeume, Thomas et al. | 2017
- 99
-
Definability by Horn Formulas and Linear Time on Cellular AutomataBacquey, Nicolas / Grandjean, Etienne / Olive, Frédéric et al. | 2017
- 100
-
Asynchronous Distributed Automata: A Characterization of the Modal Mu-FragmentReiter, Fabian et al. | 2017
- 101
-
A Counterexample to Thiagarajan's Conjecture on Regular Event StructuresChalopin, Jérémie / Chepoi, Victor et al. | 2017
- 102
-
*-Liftings for Differential PrivacyBarthe, Gilles / Espitau, Thomas / Hsu, Justin / Sato, Tetsuya / Strub, Pierre-Yves et al. | 2017
- 103
-
Bisimulation Metrics for Weighted AutomataBalle, Borja / Gourdeau, Pascale / Panangaden, Prakash et al. | 2017
- 104
-
On the Metric-Based Approximate Minimization of Markov ChainsBacci, Giovanni / Bacci, Giorgio / Larsen, Kim G. / Mardare, Radu et al. | 2017
- 105
-
Expressiveness of Probabilistic Modal Logics, RevisitedFijalkow, Nathanaël / Klin, Bartek / Panangaden, Prakash et al. | 2017
- 106
-
Emptiness of Zero Automata Is DecidableBojanczyk, Mikolaj / Gimbert, Hugo / Kelmendi, Edon et al. | 2017
- 107
-
Characterizing Definability in Decidable Fixpoint LogicsBenedikt, Michael / Bourhis, Pierre / Vanden Boom, Michael et al. | 2017
- 108
-
Conservative Extensions in Guarded and Two-Variable FragmentsJung, Jean Christoph / Lutz, Carsten / Martel, Mauricio / Schneider, Thomas / Wolter, Frank et al. | 2017
- 109
-
Models and Termination of Proof Reduction in the lambda Pi-Calculus Modulo TheoryDowek, Gilles et al. | 2017
- 110
-
Proof Complexity Meets AlgebraAtserias, Albert / Ochremiak, Joanna et al. | 2017
- 111
-
A Circuit-Based Approach to Efficient EnumerationAmarilli, Antoine / Bourhis, Pierre / Jachiet, Louis / Mengel, Stefan et al. | 2017
- 112
-
Automata-Based Stream ProcessingAlur, Rajeev / Mamouras, Konstantinos / Stanford, Caleb et al. | 2017
- 113
-
On Reversible TransducersDartois, Luc / Fournier, Paulin / Jecker, Ismaël / Lhote, Nathan et al. | 2017
- 114
-
Which Classes of Origin Graphs Are Generated by TransducersBojanczyk, Mikolaj / Daviaud, Laure / Guillon, Bruno / Penelle, Vincent et al. | 2017
- 115
-
Continuity and Rational FunctionsCadilhac, Michaël / Carton, Olivier / Paperman, Charles et al. | 2017
- 116
-
A Universal Ordinary Differential EquationBournez, Olivier / Pouly, Amaury et al. | 2017
- 117
-
Regular Separability of Parikh AutomataClemente, Lorenzo / Czerwinski, Wojciech / Lasota, Slawomir / Paperman, Charles et al. | 2017
- 118
-
An Efficient Algorithm to Decide Periodicity of b-Recognisable Sets Using MSDF ConventionBoigelot, Bernard / Mainz, Isabelle / Marsault, Victor / Rigo, Michel et al. | 2017
- 119
-
Polynomial-Space Completeness of Reachability for Succinct Branching VASS in Dimension OneFigueira, Diego / Lazic, Ranko / Leroux, Jérôme / Mazowiecki, Filip / Sutre, Grégoire et al. | 2017
- 120
-
Satisfiability and Model Checking for the Logic of Sub-Intervals under the Homogeneity AssumptionBozzelli, Laura / Molinari, Alberto / Montanari, Angelo / Peron, Adriano / Sala, Pietro et al. | 2017
- 121
-
Threshold Constraints with Guarantees for Parity Objectives in Markov Decision ProcessesBerthon, Raphaël / Randour, Mickael / Raskin, Jean-François et al. | 2017
- 122
-
Synchronizability of Communicating Finite State Machines is not DecidableFinkel, Alain / Lozes, Etienne et al. | 2017
- 123
-
Admissiblity in Concurrent GamesBasset, Nicolas / Geeraerts, Gilles / Raskin, Jean-François / Sankur, Ocan et al. | 2017
- 124
-
Improved Algorithms for Computing the Cycle of Minimum Cost-to-Time Ratio in Directed GraphsBringmann, Karl / Dueholm Hansen, Thomas / Krinninger, Sebastian et al. | 2017
- 125
-
Simple Greedy Algorithms for Fundamental Multidimensional Graph ProblemsBilò, Vittorio / Caragiannis, Ioannis / Fanelli, Angelo / Flammini, Michele / Monaco, Gianpiero et al. | 2017
- 126
-
Stochastic k-Server: How Should Uber Work?Dehghani, Sina / Ehsani, Soheil / Hajiaghayi, MohammadTaghi / Liaghat, Vahid / Seddighin, Saeed et al. | 2017
- 127
-
Multiple Source Dual Fault Tolerant BFS TreesGupta, Manoj / Khan, Shahbaz et al. | 2017
- 128
-
Near-Optimal Induced Universal Graphs for Bounded Degree GraphsAbrahamsen, Mikkel / Alstrup, Stephen / Holm, Jacob / Knudsen, Mathias Bæk Tejs / Stöckel, Morten et al. | 2017
- 129
-
Universal Framework for Wireless Scheduling ProblemsÁsgeirsson, Eyjólfur I. / Halldórsson, Magnús M. / Tonoyan, Tigran et al. | 2017
- 130
-
Streaming Communication ProtocolsBoczkowski, Lucas / Kerenidis, Iordanis / Magniez, Frédéric et al. | 2017
- 131
-
Testable Bounded Degree Graph Properties Are Random Order StreamableMonemizadeh, Morteza / Muthukrishnan, S. / Peng, Pan / Sohler, Christian et al. | 2017
- 132
-
Deterministic Graph Exploration with AdviceGorain, Barun / Pelc, Andrzej et al. | 2017
- 133
-
Combinatorial Secretary Problems with Ordinal InformationHoefer, Martin / Kodric, Bojana et al. | 2017
- 134
-
Selling Complementary Goods: Dynamics, Efficiency and RevenueBabaioff, Moshe / Blumrosen, Liad / Nisan, Noam et al. | 2017
- 135
-
Saving Critical Nodes with Firefighters is FPTChoudhari, Jayesh / Dasgupta, Anirban / Misra, Neeldhara / Ramanujan, M. S. et al. | 2017
- 136
-
On the Transformation Capability of Feasible Mechanisms for Programmable MatterMichail, Othon / Skretas, George / Spirakis, Paul G. et al. | 2017
- 137
-
Distributed Monitoring of Network Properties: The Power of Hybrid NetworksGmyr, Robert / Hinnenthal, Kristian / Scheideler, Christian / Sohler, Christian et al. | 2017
- 138
-
Randomized Rumor Spreading RevisitedDoerr, Benjamin / Kostrygin, Anatolii et al. | 2017
- 139
-
Randomized Load Balancing on Networks with Stochastic InputsCai, Leran / Sauerwald, Thomas et al. | 2017
- 140
-
Opinion Dynamics in Networks: Convergence, Stability and Lack of ExplosionMai, Tung / Panageas, Ioannis / Vazirani, Vijay V. et al. | 2017
- 141
-
Hardness of Computing and Approximating Predicates and Functions with Leaderless Population ProtocolsBelleville, Amanda / Doty, David / Soloveichik, David et al. | 2017