Range majority in constant time and linear space (Englisch)
- Neue Suche nach: Durocher, Stephane
- Neue Suche nach: He, Meng
- Neue Suche nach: Munro, J. Ian
- Neue Suche nach: Nicholson, Patrick K.
- Neue Suche nach: Skala, Matthew
- Neue Suche nach: Durocher, Stephane
- Neue Suche nach: He, Meng
- Neue Suche nach: Munro, J. Ian
- Neue Suche nach: Nicholson, Patrick K.
- Neue Suche nach: Skala, Matthew
In:
Information and Computation
;
222
;
169-179
;
2012
-
ISSN:
- Aufsatz (Zeitschrift) / Elektronische Ressource
-
Titel:Range majority in constant time and linear space
-
Beteiligte:Durocher, Stephane ( Autor:in ) / He, Meng ( Autor:in ) / Munro, J. Ian ( Autor:in ) / Nicholson, Patrick K. ( Autor:in ) / Skala, Matthew ( Autor:in )
-
Erschienen in:Information and Computation ; 222 ; 169-179
-
Verlag:
- Neue Suche nach: Elsevier Inc.
-
Erscheinungsdatum:01.01.2012
-
Format / Umfang:11 pages
-
ISSN:
-
DOI:
-
Medientyp:Aufsatz (Zeitschrift)
-
Format:Elektronische Ressource
-
Sprache:Englisch
-
Datenquelle:
Inhaltsverzeichnis – Band 222
Zeige alle Jahrgänge und Ausgaben
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
-
38th International Colloquium on Automata, Languages and ProgrammingAceto, Luca / Henzinger, Monika / Sgall, Jiří et al. | 2012
- 2
-
Algebraic independence and blackbox identity testingBeecken, M. / Mittmann, J. / Saxena, N. et al. | 2012
- 20
-
Local matching dynamics in social networksHoefer, Martin et al. | 2012
- 36
-
Fault-tolerant compact routing schemes for general graphsChechik, Shiri et al. | 2012
- 45
-
A 1.488 approximation algorithm for the uncapacitated facility location problemLi, Shi et al. | 2012
- 59
-
Linear programming in the semi-streaming model with application to the maximum matching problemAhn, Kook Jin / Guha, Sudipto et al. | 2012
- 80
-
Limits on the computational power of random stringsAllender, Eric / Friedman, Luke / Gasarch, William et al. | 2012
- 93
-
Approximation algorithms for spanner problems and Directed Steiner ForestBerman, Piotr / Bhattacharyya, Arnab / Makarychev, Konstantin / Raskhodnikova, Sofya / Yaroslavtsev, Grigory et al. | 2012
- 108
-
Generic expression hardness results for primitive positive formula comparisonBova, Simone / Chen, Hubie / Valeriote, Matthew et al. | 2012
- 121
-
Approximating the termination value of one-counter MDPs and stochastic gamesBrázdil, Tomáš / Brožek, Václav / Etessami, Kousha / Kučera, Antonín et al. | 2012
- 139
-
On the semantics of Markov automataDeng, Yuxin / Hennessy, Matthew et al. | 2012
- 169
-
Range majority in constant time and linear spaceDurocher, Stephane / He, Meng / Munro, J. Ian / Nicholson, Patrick K. / Skala, Matthew et al. | 2012
- 180
-
Popular matchings in the stable marriage problemHuang, Chien-Chung / Kavitha, Telikepalli et al. | 2012
- 195
-
Permanent does not have succinct polynomial size arithmetic circuits of constant depthJansen, Maurice / Santhanam, Rahul et al. | 2012
- 208
-
Nondeterminism is essential in small two-way finite automata with few reversalsKapoutsis, Christos A. et al. | 2012
- 228
-
Relating computational effects by ⊤⊤-liftingKatsumata, Shin-ya et al. | 2012
- 247
-
Constructing differential categories and deconstructing categories of gamesLaird, Jim / Manzonetto, Giulio / McCusker, Guy et al. | 2012
- 265
-
Vertex cover in graphs with locally few colorsKuhn, Fabian / Mastrolilli, Monaldo et al. | 2012
- 278
-
Clustering with local restrictionsLokshtanov, Daniel / Marx, Dániel et al. | 2012
- 293
-
Primal-dual approximation algorithms for Node-Weighted Steiner Forest on planar graphsMoldenhauer, Carsten et al. | 2012
- i
-
Editorial Board| 2012