Algorithmen - Eine Einführung

Cormen, Thomas H.; Leiserson, Charles E.; Rivest, Ronald L.; Stein, Clifford

doi:10.1515/9783110522013

Cited by 1,576 publications

(2,385 citation statements)

References 0 publications

Supporting

Mentioning

2,250

Contrasting

Unclassified

131

Order By: Relevance

“…The algorithm of Floyd and Warshall (cf. [9]) has been the choice of several parallel implementation as the algorithm allows one to study cache blocking techniques. Examples of this approach can be seen in Buluc et al [5], Matsumoto et al [28] and Katz et al [23].…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Applications of Ear Decomposition to Efficient Heterogeneous Algorithms for Shortest Path/Cycle Problems

Dutta

Chaitanya

Kothapalli

et al. 2018

IJNC

View full text Add to dashboard Cite

Graph algorithms play an important role in several fields of sciences and engineering. Prominent among them are the All-Pairs-Shortest-Paths (APSP) and related problems. Indeed there are several efficient implementations for such problems on a variety of modern multi-and manycore architectures.It can be noticed that for several graph problems, parallelism offers only a limited success as current parallel architectures have severe short-comings when deployed for most graph algorithms. At the same time, some of these graphs exhibit clear structural properties due to their sparsity. This calls for particular solution strategies aimed at scalable processing of large, sparse graphs on modern parallel architectures.In this paper, we study the applicability of an ear decomposition of graphs to problems such as all-pairs-shortest-paths and minimum cost cycle basis. Through experimentation, we show that the resulting solutions are scalable in terms of both memory usage and also their speedup over best known current implementations. We believe that our techniques have the potential to be relevant for designing scalable solutions for other computations on large sparse graphs.

show abstract

Section: Related Workmentioning

confidence: 99%

“…From each node v in G r , we essentially run the algorithm of Dijkstra [9] that finds the shortest paths from v to all other nodes t in G r . In short, we obtain all the shortest path values S r [s, t] | ∀{s, t} ∈ G r .…”

Section: Phase Ii: Processingmentioning

confidence: 99%

Applications of Ear Decomposition to Efficient Heterogeneous Algorithms for Shortest Path/Cycle Problems

Dutta

Chaitanya

Kothapalli

et al. 2018

IJNC

View full text Add to dashboard Cite

show abstract

“…All the candidates use number-theoretic algorithms. For a good introduction to this area see 9,13]. The rst pricing function is the simplest, but has no shortcut.…”

Section: Pricing Functionsmentioning

confidence: 99%

Pricing via Processing or Combatting Junk Mail

Dwork

Naor

Lecture Notes in Computer Science

878

610

View full text Add to dashboard Cite

We present a computational technique for combatting junk mail, in particular, and controlling access to a shared resource, in general. The main idea is to require a user to compute a moderately hard, but not intractable, function in order to gain access to the resource, thus preventing frivolous use. To this end we suggest several pricing functions, based on, respectively, extracting square roots modulo a prime, the Fiat-Shamir signature scheme, and the Ong-Schnorr-Shamir (cracked) signature scheme.A Preliminary version of this paper was presented at Crypto'92

show abstract

“…This algorithm is a little similar to HSR (it will be mentioned in section 5.2), but it's more reasonable than HSR. Its time complexity is O(n log n) because the Sort Algorithm by which we sort time series is Heapsort [18].…”

Section: Analysis Of Algorithmsmentioning

confidence: 99%

Efficient Time Series Data Classification and Compression in Distributed Monitoring

Jin

et al.

Emerging Technologies in Knowledge Discovery and Data Mining

View full text Add to dashboard Cite

Abstract. As a key issue in distributed monitoring, time series data are a series of values collected in terms of sequential time stamps. Requesting them is one of the most frequent requests in a distributed monitoring system. However, the large scale of these data users request may not only cause heavy loads to the clients, but also cost long transmission time. In order to solve the problem, we design an efficient two-step method: first classify various sets of time series according to their sizes, and then compress the time series with relatively large size by appropriate compression algorithms. Finally, we test our method, and the results show that: 1) This two-step approach is really able to reduce the users' response time after requesting the monitoring data.2) The compression effects of the algorithms designed by us are satisfactory.

show abstract

Algorithmen - Eine Einführung

Cited by 1,576 publications

References 0 publications

Applications of Ear Decomposition to Efficient Heterogeneous Algorithms for Shortest Path/Cycle Problems

Applications of Ear Decomposition to Efficient Heterogeneous Algorithms for Shortest Path/Cycle Problems

Pricing via Processing or Combatting Junk Mail

Efficient Time Series Data Classification and Compression in Distributed Monitoring

Contact Info

Product

Resources

About