Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
26
click to vote
ICFP
2010
ACM
favorite
Email
discuss
report
148
views
Programming Languages
»
more
ICFP 2010
»
The reduceron reconfigured
13 years 9 months ago
Download
www.cs.york.ac.uk
The leading implementations of graph reduction all target conventional processors designed for low-level imperative execution. In this paper, we present a processor specially designed to perform graph-reduction. Our processor
Matthew Naylor, Colin Runciman
Real-time Traffic
Graph Reduction
|
ICFP 2010
|
Low-level Imperative Execution
|
Programming Languages
|
Sequential Graph Reduction
|
claim paper
Post Info
More Details (n/a)
Added
09 Nov 2010
Updated
09 Nov 2010
Type
Conference
Year
2010
Where
ICFP
Authors
Matthew Naylor, Colin Runciman
Comments
(0)
Researcher Info
Programming Languages Study Group
Computer Vision