Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

6

CPM
1999
Springer

favoriteEmaildiscussreport

94views Combinatorics» more CPM 1999»

Finding Maximal Pairs with Bounded Gap

13 years 9 months ago

Finding Maximal Pairs with Bounded Gap

Download www.brics.dk

Gerth Stølting Brodal, Rune B. Lyngsø

Real-time Traffic

Combinatorics | CPM 1999 |

claim paper

Related Content

» Finding Lower Bounds for Nondeterministic State Complexity Is Hard

» The Statistical Significance of MaxGap Clusters

» Finding regulatory elements and regulatory motifs a general probabilistic framework

» Santa Claus Meets Hypergraph Matchings

» An algorithm for automated closure during assembly

» Edgedisjoint paths in Planar graphs with constant congestion

» Improved Hardness of Approximation for Stackelberg ShortestPath Pricing

» Symmetric Allocations for Distributed Storage

» Support envelopes a technique for exploring the structure of association patterns

Post Info
More Details (n/a)

Added	04 Aug 2010
Updated	04 Aug 2010
Type	Conference
Year	1999
Where	CPM
Authors	Gerth Stølting Brodal, Rune B. Lyngsø, Christian N. S. Pedersen, Jens Stoye

Comments (0)