Skip to search formSkip to main contentSkip to account menu

Graph reduction

Known as: Combinator graph reduction, Reduction 
In computer science, graph reduction implements an efficient version of non-strict evaluation, an evaluation strategy where the arguments to a… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2016
Review
2016
A system level view of cellular processes for human and several organisms can be cap- tured by analyzing molecular interaction… 
2007
2007
For trunk packing problems only few approximation schemes are known, mostly designed for the European standard DIN 70020 [6] with… 
2007
2007
This paper presents a way of controling topology in wireless ad hoc networks while using a realistic physical layer. We first… 
1999
1999
The auction approach for the shortest path problem (SPP) as introduced by Bertsekas is tested experimentally. Parallel algorithms… 
Highly Cited
1993
Highly Cited
1993
1993
1993
In a parallel graph reduction system, speculative evaluation can increase parallelism by performing potentially useful… 
1992
1992
Many heap-oriented languages such as Lisp and Id depend on run-time garbage collection to reclaim storage. Garbage collection can… 
1988
1988
The execution has been studied of four small and four medium‐sized SASL programs, when interpreted by a variant of Turner's…