LOOP (programming language)

Known as: Loop 
LOOP is a programming language designed by Uwe Schöning, along with GOTO and WHILE. The only operations supported in the language are assignment… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1959-2017
0246819592017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
With an explosion of popularity of online photo sharing, we can trivially collect a huge number of photo streams for any… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2011
Highly Cited
2011
Branch divergence has a significant impact on the performance of GPU programs. We propose two novel software-based optimizations… (More)
  • figure 3
  • figure 4
  • figure 2
  • figure 12
  • figure 10
Is this relevant?
2010
2010
Emerging applications like smart environments and observation systems can benefit significantly by making use of semantics… (More)
  • figure 1
  • figure 3
  • figure 2
  • figure 4
  • table 1
Is this relevant?
Highly Cited
2006
Highly Cited
2006
It was recently reported that all known face and combined greedy-face routing variants cannot guarantee message delivery in… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2002
2002
Digital subscriber lines (DSLs) offer carriers the possibility of exploiting the existing loop plant to deliver high-speed data… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1993
1993
A graphical model for describing schemes and instances of object-databases and a graphical data manipulation language based on… (More)
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1992
Highly Cited
1992
~lw advantage of , capability of rallel machines, application programs must contain sufficient parallelism, and this parallelism… (More)
  • table 1
  • figure 3
  • figure 5
  • figure 8
  • figure 11,1
Is this relevant?
1990
1990
We present a method for tracing a curve that is represented as the contour of a function in Euclidean space of any dimension. The… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1989
Highly Cited
1989
. I* this paperfw, extend1 the class of 'problems that can be effectively compiled by parallelizing compilers. This is… (More)
  • figure 1
  • figure 5
  • figure 7
  • figure 8
  • figure 9
Is this relevant?
Highly Cited
1988
Highly Cited
1988
Parallelizing compilers promise to exploit the parallelism available in a given program, particularly parallelism that is too low… (More)
Is this relevant?