Skip to search formSkip to main contentSkip to account menu

Arnold L. Rosenberg

Arnold Leonard Rosenberg (born February 11, 1941) is an American computer scientist. He is a distinguished university professor emeritus at the… 
Wikipedia (opens in a new tab)

Related topics

Related topics

11 relations
Aanderaa–Karp–Rosenberg conjectureComputer scientistData structureGraph theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Teaching Practices, School Support and Bullying
Research in recent years indicates that schools, and in particular teaching practices, play an essential role in preventing… 
2011
2011
Statistical measures for quantifying task and machine heterogeneities
We study heterogeneous computing (HC) systems that consist of a set of different machines that have varying capabilities. These… 
Review
2008
Review
2008
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
This volume consists of papers that were presented at the 20th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA… 
2003
2003
A Golden Age for JACM
I was Editor-in-Chief ofJACMfrom 1966 to 1968, having served a term as Editorin-Chief of theCommunications of ACMjust previously… 
2003
2003
A Method for Creating Near-Optimal Instances of a Certified Write-All Algorithm (Extended Abstract)
This paper shows how to create near-optimal instances of the Certified Write-All algorithm called AWT that was introduced by… 
Review
2001
Review
2001
The history and contribution of theoretical computer science
1991
1991
Structure in monotone complexity
In this work we study complexity classes in monotone computation. Our main contributions are the following: (1) A consistent… 
1984
1984
Fault-Tolerant VLSI Processor Arrays Via Laser Welding'' Arnold L. Rosenberg.
We study here a strategy for constructing fault-tolerant VLSI processor arrays that achieves tolerance to faults by running buses… 
Highly Cited
1977
Highly Cited
1977
Recent technical reports
Certain questions concerning the arithmetic complexity of unlvarlate polynomial evaluation are considered. Given an operator… 
Review
1975
Review
1975
Review: Patrick C. Fischer, Albert R. Meyer, Arnold L. Rosenberg, Time-Restricted Sequence Generation
mains of computable functions, and the generable sets, the ranges. The standard relationships between various forms of… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)