Gerth Stølting Brodal, Sven Skyum  Home/Search
Context
Related
| brics.dk/~gerth/Pa...icsrs9642.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: brics.dk/~gerth/pub26 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We show that the problem of computing all contiguous k-ary compositions of a sequence of n values under an associative and commutative operator requires 3 k\Gamma1 k+1 n \Gamma O(k) operations. For the operator max we show in contrast that in the decision tree model the complexity is i 1 + \Theta(1= p k) j n \Gamma O(k). Finally we show that the complexity of the corresponding on-line problem for the operator max is i 2 \Gamma 1 k\Gamma1 j n \Gamma O(k). This work was... (Update)
Active bibliography (related documents): More All
0.5: On Graph Complexity - Jukna (Correct)
0.2: Analysis of An Approach for the Set Maxima Problem - Liberatore (Correct)
0.2: The Set-Maxima Problem: an Overview - Desper (1998) (Correct)
Similar documents based on text: More All
1.4: The Complexity of Identifying Large Equivalence Classes - Binderup, Frandsen.. (1998) (Correct)
1.3: R^n- and G^n-Logics - Hintermeier, Kirchner, Mosses (1996) (Correct)
1.3: Lower Bounds for Dynamic Transitive Closure, Planar Point .. - Husfeldt, Rauhe, Skyum (1996) (Correct)
BibTeX entry: (Update)
@misc{ brodal-complexity,
author = "Gerth Stølting Brodal and Sven Skyum",
title = "The Complexity of Computing the k-ary Composition of a Binary Associative
Operator",
url = "citeseer.ist.psu.edu/324451.html" }
Citations (may not include all citations):100 Volume I: Fundamental Algorithms (context) - Knuth, of - 1968
53 Volume III: Sorting and Searching (context) - Knuth, of - 1973
12 Optimal randomized algorithms for local sorting and set-maxi.. (context) - Goddard, Kenyon et al. - 1993
5 A linear time approach to the set maxima problem (context) - Bar-Noy, Motwani et al. - 1992
2 a family of boolean matrices (context) - Andreev - 1986
1 CASOP: A fast algorithm for computing the n-ary composition .. (context) - Cooper, Kitchen - 1990
1 Some remarks on boolean sums (context) - Mehlhorn - 1979
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC