Algorithmic paradigm

Known as: Algorithm design paradigm 
An algorithmic paradigm, algorithm design paradigm, algorithmic technique, or algorithmic strategy is a generic method or approach which underlies… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1980-2017
024619802017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
This paper proposes a new algorithmic paradigm - k-level asynchronous (KLA) - that bridges level-synchronous and asynchronous… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
2010
2010
Valiant introduced match gate computation and holographic algorithms. A number of seemingly exponential time problems can be… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2006
Highly Cited
2006
This paper studies jump flooding as an algorithmic paradigm in the general purpose computation with GPU. As an example… (More)
  • figure 2
  • figure 4
  • figure 3
  • figure 5
  • figure 7
Is this relevant?
2005
2005
We define an algorithmic paradigm, the stack model, that captures many primal-dual and local-ratio algorithms for approximating… (More)
  • figure 5
  • figure 6
Is this relevant?
2004
2004
In the state-based self-stabilizing algorithmic paradigm for distributed computing, each node has only a local view of the system… (More)
Is this relevant?
2004
2004
In the self-stabilizing algorithmic paradigm for distributed computing each node has only a local view of the system, yet in a… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2000
2000
Suppose that a parallel algorithm can include any number of parallel threads. Each thread can proceed without ever having to busy… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
1992
Highly Cited
1992
In recent years, Markov chain simulation has emerged as a powerful algorithmic paradigm. Its chief application is to the random… (More)
Is this relevant?
1987
1987
Consider a setF ofn functions defined on a common intervalU. A ranked function overF is defined from the functions ofF by using… (More)
Is this relevant?
Highly Cited
1980
Highly Cited
1980
Most results in the field of algorithm design are single algorithms that solve single problems. In this paper we discuss… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • figure 7
Is this relevant?