Sort Me If You Can: How to Sort Dynamic Data (English)
- New search for: Anagnostopoulos, Aris
- New search for: Kumar, Ravi
- New search for: Mahdian, Mohammad
- New search for: Upfal, Eli
- New search for: Anagnostopoulos, Aris
- New search for: Kumar, Ravi
- New search for: Mahdian, Mohammad
- New search for: Upfal, Eli
In:
Automata, Languages and Programming
4
;
339-350
;
2009
- Article/Chapter (Book) / Electronic Resource
-
Title:Sort Me If You Can: How to Sort Dynamic Data
-
Contributors:Anagnostopoulos, Aris ( author ) / Kumar, Ravi ( author ) / Mahdian, Mohammad ( author ) / Upfal, Eli ( author )
-
Published in:Automata, Languages and Programming , 4 ; 339-350Lecture Notes in Computer Science ; 5556, 4 ; 339-350
-
Publisher:
- New search for: Springer Berlin Heidelberg
-
Place of publication:Berlin, Heidelberg
-
Publication date:2009-01-01
-
Size:12 pages
-
ISBN:
-
ISSN:
-
DOI:
-
Type of media:Article/Chapter (Book)
-
Type of material:Electronic Resource
-
Language:English
-
Keywords:
-
Source:
Table of contents eBook
The tables of contents are generated automatically and are based on the data records of the individual contributions available in the index of the TIB portal. The display of the Tables of Contents may therefore be incomplete.
- 1
-
A Survey of Stochastic Games with Limsup and Liminf ObjectivesChatterjee, Krishnendu / Doyen, Laurent / Henzinger, Thomas A. et al. | 2009
- 16
-
Tractable Optimization Problems through Hypergraph-Based Structural RestrictionsGottlob, Georg / Greco, Gianluigi / Scarcello, Francesco et al. | 2009
- 31
-
Deciding Safety Properties in Infinite-State Pi-Calculus via Behavioural TypesAcciai, Lucia / Boreale, Michele et al. | 2009
- 43
-
When Are Timed Automata Determinizable?Baier, Christel / Bertrand, Nathalie / Bouyer, Patricia / Brihaye, Thomas et al. | 2009
- 55
-
Faithful Loops for Aperiodic E-Ordered MonoidsBeaudry, Martin / Lemieux, François et al. | 2009
- 67
-
Boundedness of Monadic Second-Order Formulae over Finite WordsBlumensath, Achim / Otto, Martin / Weyer, Mark et al. | 2009
- 79
-
Semilinear Program FeasibilityBodirsky, Manuel / Jonsson, Peter / Oertzen, Timo et al. | 2009
- 91
-
Floats and Ropes: A Case Study for Formal Numerical Program VerificationBoldo, Sylvie et al. | 2009
- 103
-
Reachability in Stochastic Timed GamesBouyer, Patricia / Forejt, Vojtěch et al. | 2009
- 115
-
Equations Defining the Polynomial Closure of a Lattice of Regular LanguagesBranco, Mário J. J. / Pin, Jean-Éric et al. | 2009
- 127
-
Approximating Markov Processes by AveragingChaput, Philippe / Danos, Vincent / Panangaden, Prakash / Plotkin, Gordon et al. | 2009
- 139
-
The Theory of Stabilisation Monoids and Regular Cost FunctionsColcombet, Thomas et al. | 2009
- 151
-
A Tight Lower Bound for Determinization of Transition Labeled Büchi AutomataColcombet, Thomas / Zdanowski, Konrad et al. | 2009
- 163
-
On Constructor Rewrite Systems and the Lambda-CalculusLago, Ugo / Martini, Simone et al. | 2009
- 175
-
On Regular Temporal Logics with Past,Dax, Christian / Klaedtke, Felix / Lange, Martin et al. | 2009
- 188
-
Forward Analysis for WSTS, Part II: Complete WSTSFinkel, Alain / Goubault-Larrecq, Jean et al. | 2009
- 200
-
Qualitative Concurrent Stochastic Games with Imperfect InformationGripon, Vincent / Serre, Olivier et al. | 2009
- 212
-
Diagrammatic Confluence and CompletionJouannaud, Jean-Pierre / Oostrom, Vincent et al. | 2009
- 223
-
Complexity of Model Checking Recursion Schemes for Fragments of the Modal Mu-CalculusKobayashi, Naoki / Ong, C. -H. Luke et al. | 2009
- 235
-
LTL Path Checking Is Efficiently ParallelizableKuhtz, Lars / Finkbeiner, Bernd et al. | 2009
- 247
-
An Explicit Formula for the Free Exponential Modality of Linear LogicMelliès, Paul-André / Tabareau, Nicolas / Tasson, Christine et al. | 2009
- 261
-
Decidability of the Guarded Fragment with the Transitive ClosureMichaliszyn, Jakub et al. | 2009
- 273
-
Weak Alternating Timed AutomataParys, Pawel / Walukiewicz, Igor et al. | 2009
- 285
-
A Decidable Characterization of Locally Testable Tree LanguagesPlace, Thomas / Segoufin, Luc et al. | 2009
- 297
-
The Complexity of Nash Equilibria in Simple Stochastic Multiplayer GamesUmmels, Michael / Wojtczak, Dominik et al. | 2009
- 309
-
Google’s Auction for TV AdsNisan, Noam / Bayer, Jason / Chandra, Deepak / Franji, Tal / Gardner, Robert / Matias, Yossi / Rhodes, Neil / Seltzer, Misha / Tom, Danny / Varian, Hal et al. | 2009
- 328
-
Graph Sparsification in the Semi-streaming ModelAhn, Kook Jin / Guha, Sudipto et al. | 2009
- 339
-
Sort Me If You Can: How to Sort Dynamic DataAnagnostopoulos, Aris / Kumar, Ravi / Mahdian, Mohammad / Upfal, Eli et al. | 2009
- 351
-
Maximum Bipartite Flow in Networks with Adaptive Channel WidthAzar, Yossi / Mądry, Aleksander / Moscibroda, Thomas / Panigrahi, Debmalya / Srinivasan, Aravind et al. | 2009
- 363
-
Mediated Population ProtocolsChatzigiannakis, Ioannis / Michail, Othon / Spirakis, Paul G. et al. | 2009
- 375
-
Rumor Spreading in Social NetworksChierichetti, Flavio / Lattanzi, Silvio / Panconesi, Alessandro et al. | 2009
- 387
-
MANETS: High Mobility Can Make Up for Low Transmission PowerClementi, Andrea E. F. / Pasquale, Francesco / Silvestri, Riccardo et al. | 2009
- 399
-
Multiple Random Walks and Interacting Particle SystemsCooper, Colin / Frieze, Alan / Radzik, Tomasz et al. | 2009
- 411
-
Derandomizing Random Walks in Undirected Graphs Using Locally Fair Exploration StrategiesCooper, Colin / Ilcinkas, David / Klasing, Ralf / Kosowski, Adrian et al. | 2009
- 423
-
On a Network Generalization of the Minmax TheoremDaskalakis, Constantinos / Papadimitriou, Christos H. et al. | 2009
- 435
-
Rate-Based Transition Systems for Stochastic Process CalculiNicola, Rocco / Latella, Diego / Loreti, Michele / Massink, Mieke et al. | 2009
- 447
-
Improved Algorithms for Latency Minimization in Wireless NetworksFanghänel, Alexander / Keßelheim, Thomas / Vöcking, Berthold et al. | 2009
- 459
-
Efficient Methods for Selfish Network DesignFotakis, Dimitris / Kaporis, Alexis C. / Spirakis, Paul G. et al. | 2009
- 472
-
Smoothed Analysis of Balancing NetworksFriedrich, Tobias / Sauerwald, Thomas / Vilenchik, Dan et al. | 2009
- 484
-
Names Trump Malice: Tiny Mobile Agents Can Tolerate Byzantine FailuresGuerraoui, Rachid / Ruppert, Eric et al. | 2009
- 496
-
Multi-armed Bandits with Metric Switching CostsGuha, Sudipto / Munagala, Kamesh et al. | 2009
- 508
-
Algorithms for Secretary Problems on Graphs and HypergraphsKorula, Nitish / Pál, Martin et al. | 2009
- 521
-
Leader Election in Ad Hoc Radio Networks: A Keen Ear HelpsKowalski, Dariusz R. / Pelc, Andrzej et al. | 2009
- 534
-
Secure Function Collection with Sublinear StorageIbrahim, Maged H. / Kiayias, Aggelos / Yung, Moti / Zhou, Hong-Sheng et al. | 2009
- 546
-
Worst-Case Efficiency Analysis of Queueing DisciplinesMosk-Aoyama, Damon / Roughgarden, Tim et al. | 2009
- 558
-
On Observing Dynamic Prioritised Actions in SOCPugliese, Rosario / Tiezzi, Francesco / Yoshida, Nobuko et al. | 2009
- 571
-
A Distributed and Oblivious HeapScheideler, Christian / Schmid, Stefan et al. | 2009
- 583
-
Proportional Response Dynamics in the Fisher MarketZhang, Li et al. | 2009