Arnold L. Rosenberg

Arnold L. Rosenberg's AcademicInfluence.com Rankings

Arnold L. Rosenberg

Computer Science

#1830

World Rank

#1899

Historical Rank

#873

USA Rank

Database

#824

World Rank

#865

Historical Rank

#257

USA Rank

computer-science Degrees

Download Badge

Computer Science

Arnold L. Rosenberg's Degrees

PhD Mathematics University of California, Berkeley

Why Is Arnold L. Rosenberg Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Arnold Leonard Rosenberg is an American computer scientist. He is a distinguished university professor emeritus at the University of Massachusetts Amherst, and despite his retirement from UMass he continues to hold research positions at Northeastern University and Colorado State University.

(See a Problem?)

Arnold L. Rosenberg's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Differential Forms on Regular Affine Algebras (1962) (445)
Rapid identification of repeated patterns in strings, trees and arrays (1972) (320)
-Theory and Algebraic Geometry: Connections with Quadratic Forms and Division Algebras (1994) (276)
Embedding graphs in books: a layout problem with applications to VLSI design (1985) (262)
The Diogenes Approach to Testable Fault-Tolerant Arrays of Processors (1983) (261)
Group Action Graphs and Parallel Architectures (1990) (228)
Noncommutative Algebraic Geometry and Representations of Quantized Algebras (1995) (207)
Finding topic words for hierarchical summarization (2001) (191)
Laying out Graphs Using Queues (1992) (173)
Noncommutative smooth spaces (1998) (166)
Optimal simulations of tree machines (1986) (157)
Exhaustive Generation of Bit Patterns with Applications to VLSI Self-Testing (1983) (140)
Comparing Queues and Stacks as Mechanisms for Laying out Graphs (1992) (130)
Finiteness of the injective hull (1958) (129)
Using the compiler to improve cache replacement decisions (2002) (129)
Three-Dimensional VLSI: a case study (1983) (126)
NSF/IEEE-TCPP curriculum initiative on parallel and distributed computing: core topics for undergraduates (2011) (118)
Counter machines and counter languages (1968) (117)
Galois Theory and Cohomology of Commutative Rings (1978) (111)
Work-preserving emulations of fixed-connection networks (1989) (105)
Stabbing line segments (1982) (101)
On Embedding Rectangular Grids in Square Grids (1982) (97)
Structure of Wittrings and Quotients of Abelian Group Rings (1972) (95)
Cost Trade-offs in Graph Embeddings, with Applications (1983) (94)
On the time required to recognize properties of graphs: a problem (1973) (93)
Three-Dimensional Circuit Layouts (1984) (92)
Real-Time Definable Languages (1967) (92)
Automorphisms of separable algebras (1961) (91)
Application Placement on a Cluster of Servers (2007) (91)
A Dictionary Machine (for VLSI) (1982) (86)
A Tool for Prioritizing DAGMan Jobs and its Evaluation (2006) (86)
On multi-head finite automata (1965) (85)
Efficient Embeddings of Trees in Hypercubes (1992) (84)
Multitape One-Way Nonwriting Automata (1968) (83)
Issues in the Study of Graph Embeddings (1980) (79)
Real-Time Simulation of Multihead Tape Units (1972) (75)
On the Dimension of Modules and Algebras, VIII. Dimension of Tensor Products (1957) (72)
Universal Graphs for Bounded-Degree Trees and Planar Graphs (1989) (72)
Graph Separators, with Applications (2001) (70)
Time- and space-optimality in B-trees (1981) (68)
Differential operators on noncommutative rings (1997) (67)
Signatures on semilocal rings (1973) (67)
Sharing partitionable workloads in heterogeneous NOWs: greedier is not better (2001) (65)
Optimal sharing of bags of tasks in heterogeneous clusters (2003) (59)
Optimal simulations by Butterfly Networks (1988) (59)
Scheduling Time-Constrained Communication in Linear Networks (2002) (56)
Toward a theory for scheduling dags in Internet-based computing (2006) (56)
On scheduling mesh-structured computations for Internet-based computing (2004) (56)
Product-Shuffle Networks: Toward Reconciling Shuffles and Butterflies (1992) (55)
The Spectrum of Abelian Categories and Reconstruction of Schemes (2020) (55)
Preserving Proximity in Arrays (1975) (55)
Data Graphs and Addressing Schemes (1971) (54)
An Optimal Strategies for Cycle-Stealing in Networks of Workstations (1997) (54)
A Machine Realization of the Linear Context-Free Languages (1967) (52)
Allocating Storage for Extendible Arrays (1974) (52)
Localization for quantum groups (1999) (51)
Noncommutative schemes (1998) (50)
On the cost-ineffectiveness of redundancy in commercial P2P computing (2005) (48)
Comparing the structure of power-law graphs and the Internet AS graph (2004) (43)
The Structure of the Infinite General Linear Group (1958) (42)
Three-Dimensional Integrated Circuitry (1981) (42)
Signatures of fields and extension theory. (1982) (40)
Optimal 2, 3-Trees (1979) (40)
HiHCoHP-Toward a realistic communication model for hierarchical hyperclusters of heterogeneous processors (2001) (40)
Guidelines for scheduling some common computation-dags for Internet-based computing (2005) (39)
A Tight Layout of the Butterfly Network (1996) (39)
A Comparison of Dag-Scheduling Strategies for Internet-Based Computing (2007) (39)
STRUCTURE OF WITT RINGS, QUOTIENTS OF ABELIAN GROUP RINGS, AND ORDERINGS OF FIELDS (1971) (39)
Sums of Squares in Some Integral Domains (1980) (38)
Encoding Data Structures in Trees (1979) (38)
The Number of Irreducible Representations of Simple Rings with No Minimal Ideals (1953) (37)
Optimal emulations by butterfly-like networks (1996) (37)
Blocks and centres of group algebras (1961) (34)
Efficient pairing functions-and why you should care (2002) (34)
Succinct and representational Witt rings. (1980) (33)
An algorithmic model for heterogeneous hyper-clusters: rationale and experience (2005) (32)
Graphs that are Almost Binary Trees (1982) (32)
Scheduling Time-Constrained Communication in Linear Networks (1998) (32)
Cohomology of infinite algebras (1956) (32)
Hashing Schemes for Extendible Arrays (1977) (32)
Scattering and Gathering Messages in Networks of Processors (1993) (31)
Optimal Schedules for Cycle-Stealing in a Network of Workstations with a Bag-of-Tasks Workload (2002) (31)
Managing Storage for Extendible Arrays (1975) (28)
GRAPH EMBEDDINGS 1988: Recent Breakthroughs, New Directions (1988) (28)
Augmented Ring Networks (2001) (28)
Theoretical Computer Science, Essays in Memory of Shimon Even (2006) (28)
Scheduling Tree-Dags Using FIFO Queues: A Control-Memory Trade-Off (1996) (27)
Addressable Data Graphs (1972) (26)
Reduced forms and reduced Witt rings of higher level (1985) (26)
Perfect Storage Representations for Families of Data Structures (1983) (25)
A Hypergraph Model for Fault-Tolerant VLSI Processor Arrays (1985) (25)
Galois theory of continuous transformation rings (1955) (24)
Guidelines for data-parallel cycle-stealing in networks of workstations (1998) (23)
On n-tape finite state acceptors (1964) (23)
Minimal-Comparison 2, 3-Trees (1978) (23)
Cellular ANTomata (2007) (22)
The Cartan-Brauer-Hua theorem for matrix and local matrix rings (1956) (22)
The Pillars of Computation Theory - State, Encoding, Nondeterminism (2009) (22)
Advances in IC-Scheduling Theory: Scheduling Expansive and Reductive Dags and Scheduling Dags via Duality (2007) (22)
Batch-Scheduling Dags for Internet-Based Computing (2005) (22)
The significance of program dependences for software testing, debugging, and maintenance (1989) (21)
Polynomial Indexing of integer Lattice-Points I. General Concepts and Quadratic Polynomials* (1978) (21)
Accountable Web-computing (2002) (20)
Applying IC-Scheduling Theory to Familiar Classes of Computations (2007) (20)
Amitsur's complex for inseparable fields (1962) (20)
On Bufferless Routing of Variable Length Messages in Leveled Networks (1996) (20)
Compact B-trees (1979) (19)
Work-preserving emulations of fixed-connection networks (1997) (19)
Extending IC-Scheduling via the Sweep Algorithm (2008) (18)
The left spectrum, the Levitzki radical, and noncommutative schemes. (1990) (18)
On scheduling dag s for volatile computing platforms: Area-maximizing schedules (2012) (18)
On Scheduling Series-Parallel DAGs to Maximize Area (2014) (17)
Cycles in Networks (1991) (17)
Work-Preserving Emulations of Fixed-Connection Networks (Extended Abstract) (1989) (17)
The physical mapping problem for parallel architectures (1988) (17)
A Theorem of Harrison, Kummer Theory, and Galois Algebras (1966) (17)
The map of the Witt ring of a domain into the Witt ring of its field of fractions (1975) (17)
Toward understanding heterogeneity in computing (2010) (17)
Noncommutative local algebra (1994) (16)
Bandwidth and pebbling (1983) (16)
Limited Random Access Turing Machines (1968) (16)
On scheduling complex dags for Internet-based computing (2005) (15)
Optimal embeddings of butterfly-like graphs in the hypercube (1990) (15)
Guidelines for data-parallel cycle-stealing in networks of workstations. II. On maximizing guaranteed output (1999) (14)
Scheduling DAG-based workflows on single cloud instances: High-performance and cost effectiveness with a static scheduler (2017) (14)
Time-Restricted Sequence Generation (1970) (14)
An AREA-Oriented Heuristic for Scheduling DAGs on Volatile Computing Platforms (2015) (14)
Reconstruction of Schemes (2007) (14)
Signatures and Semi Signatures of Abstract Witt Rings and Witt Rings of Semilocal Rings (1978) (14)
Polynomial indexing of integer lattice-points II. Nonexistence results for higher-degree polynomials (1978) (14)
Static Strategies for Worksharing with Unrecoverable Interruptions (2013) (14)
Literacy for all in parallel and distributed computing: guidelines for an undergraduate core curriculum (2012) (13)
Uniform Data Encodings (1980) (13)
Assessing the Computational Benefits of AREA-Oriented DAG-Scheduling (2011) (13)
Bounds on the costs of data encodings (1978) (13)
Cellular ANTomata: Food-Finding and Maze-Threading (2008) (13)
Bounded-Collision Memory-Mapping Schemes for Data Structures with Applications to Parallel Memories (2007) (13)
Data encodings and their costs (1978) (12)
Parallel Architectures and Their Efficient Use (1993) (12)
Minimal-Cost Brother Trees (1984) (12)
Area-Maximizing Schedules for Series-Parallel DAGs (2010) (12)
The spectrum of the algebra of skew differential operators and the irreducible representations of the quantum Heisenberg algebra (1991) (12)
Optimal architecture-independent scheduling of fine-grain tree-sweep computations (1995) (12)
The unitary irreducible representations of the quantum heisenberg algebra (1992) (11)
On Constructing DAG-Schedules with Large AREAs (2014) (11)
Fault-Tolerant Interconnection Networks: A Graph-Theoretic Approach (1983) (11)
The zero-dimensional Galois cohomology of Witt rings (1970) (11)
The Global Dimensions of Ore Extensions and Weyl Algebras (1976) (11)
Grothendieck and Wittrings of hermetian forms over Dedekind rings (1972) (10)
Turing Machines with Several Read-Write Heads (Preliminary Report) (1967) (10)
On “Exploiting” Node-Heterogeneous Clusters Optimally (2008) (10)
Symmetries in Data Graphs (1972) (10)
External Hashing Schemes for Collections of Data Structures (1980) (10)
Topics in Parallel and Distributed Computing: Introducing Concurrency in Undergraduate Courses (2015) (9)
Static strategies forworksharing with unrecoverable interruptions (2009) (9)
Optimal Embeddings of the FFT Graph in the Hypercube (1988) (9)
Thoughts on parallelism and concurrency in compiling curricula (1995) (9)
On the Independence of Real-Time Definability and Certain Structural Properties of Context-Free Languages (1968) (9)
Vertex Types in Book-Embeddings (1987) (9)
Optimal Simulations of Tree Machines (Preliminary Version) (1986) (9)
Interval Hypergraphs (1987) (8)
Asymptotically optimal worksharing in HNOWs: how long is "sufficiently long?" (2003) (8)
Partitioning circuits for improved testability (1986) (8)
The Reconfigurable Ring of Processors: Efficient Algorithms via Hypercube Simulation (1995) (8)
Topics in Parallel and Distributed Computing (2018) (8)
On scheduling dags to maximize area (2009) (8)
On Scheduling Expansive and Reductive Dags for Internet-Based Computing (2006) (8)
Dimension of Ideals in Polynomial Rings (1958) (8)
What Is a Multilevel Array? (1975) (8)
Diogenes, Circa 1986 (1986) (8)
An empirical study of dynamic scheduling on rings of processors (1996) (8)
Processor-Time Tradeoffs for Cayley Graph Interconnection Networks (1991) (8)
Efficient trigger-broadcasting in heterogeneous clusters (2005) (8)
Subrings of simple rings with minimal ideals (1952) (7)
Interconnection Networks and Mapping and Scheduling Parallel Computations: Dimacs Workshop, February 7-9, 1994 (1995) (7)
An algorithmic model for heterogeneous clusters: rationale and experience (2004) (7)
Cost Tradeoffs in Graph Embeddings, with Applications (Preliminary Version) (1981) (7)
Optimal Clustering of Tree-Sweep Computations for High-Latency Parallel Environments (1999) (7)
Parallel Architectures and Their Efficient Use: First Heinz Nixdorf Symposium Paderborn, Germany, November 11-13, 1992 Proceedings (1993) (7)
Improving Replacement Decisions in Set-Associative Caches TITLE2: (2001) (7)
Computed Access in Ragged Arrays (1974) (7)
Review: D. G. Northcott, An introduction to homological algebra (1961) (7)
Real-time solutions of the origin-crossing problem (1968) (7)
The reconfigurable ring of processors: fine-grained tree-structured computations (1994) (7)
Thirteenth annual IEEE Symposium on switching and automata theory (1974) (7)
A Pebble Game for Internet-Based Computing (2006) (7)
NSF/IEEE-TCPP curriculum initiative on parallel and distributed computing: core topics for undergraduates (abstract only) (2014) (6)
Multitape Finite Automata with Rewind Instructions (1967) (6)
Toward Efficient Scheduling of Evolving Computations on Rings of Processors (1996) (6)
Bounding damage from link destruction, with application to the internet (2007) (6)
Improving Replacement Decisions in Set-Associative Caches (2001) (6)
Needed: a theoretical basis for heterogeneous parallel computing (1994) (6)
Zero divisors and commutativity of rings (1953) (6)
On Clustering Tasks in IC-Optimal Dags (2008) (6)
Finite-dimensional simple subalgebras of the ring of all continuous linear transformations (1954) (6)
Balancing Communication in Ring-Structured Networks (1993) (6)
The Hardest Natural Languages (1979) (6)
Optimal Simulations by Butterfly Networks (Preliminary Version) (1988) (6)
Scheduling DAGs Opportunistically: The Dream and the Reality Circa 2016 (2016) (6)
Real Time Counter Machines (Preliminary Version) (1967) (6)
Finding Topic Words for Hierarchical Summarization ( DRAFT ) (2001) (6)
Graph Layout Using Queues (1989) (6)
Global Dimension of Ore Extensions (1976) (6)
Link-heterogeneity vs. node-heterogeneity in clusters (2010) (5)
Managing storage for extendible arrays (Extended Abstract) (1974) (5)
Statistical predictors of computing power in heterogeneous clusters (2010) (5)
Shuffle-Oriented Interconnection Networks (1988) (5)
On Uniformly Inserting One Data Structure into Another (1981) (5)
Tensor products of semiprimary algebras (1957) (5)
Reconstruction of groups (2003) (5)
On clustering DAGs for task-hungry computing platforms (2011) (5)
Addendum to Amitsur's complex for purely inseparable fields (1964) (5)
On Optimal Strategies for Stealing Cycles (1995) (5)
Proceedings of the 3rd ACM symposium on Parallel algorithms and architectures (1994) (5)
The Diogenes design methodology: toward automatic physical layout (1986) (4)
Static worksharing strategies for heterogeneous computers with unrecoverable interruptions (2011) (4)
Optimal Sharing of Partitionable Workloads in Heterogeneous Networks of Workstations (2000) (4)
Changing Challenges for Collaborative Algorithmics (2006) (4)
On Bufferless Routing of Variable-length Message in Leveled Networks (Extended Abstract) (1993) (4)
Theoretical research on networks: models and methodology (1997) (4)
The Existence of Fiber Functors (2000) (4)
Proceedings of the 4th ACM symposium on Parallel algorithms and architectures (1994) (4)
Suffixes of Addressable Data Graphs (1973) (4)
Binary search trees with binary comparison cost (1984) (4)
On Validating Parallel Architectures via Graph Embeddings (1988) (4)
An extrinsic characterization of addressable data graphs (1974) (4)
Optimal schedules for data-parallel cycle-stealing in networks of workstations (extended abstract) (2000) (4)
The Parking Problem for Finite-State Robots (2012) (4)
Cayley Graphs and Direct-Product Graphs (1991) (3)
Static Worksharing Strategies for Heterogeneous Computers with Unrecoverable Failures (2009) (3)
Region Management by Finite-State Robots (2014) (3)
Graphs that are almost binary trees (Preliminary Version) (1981) (3)
On storing ragged arrays by hashing (1976) (3)
On embedding graphs in grids, RC 7559 (32668) (1980) (3)
An enhanced dag-scheduling theory for Internet-based computing (2006) (3)
Special SIGACT issueFourth Annual ACM Symposium on Theory of Computing (1976) (3)
Transitions in extendible arrays (1973) (3)
Operations on and (1962) (3)
Partitioning Circuits for Improved Testability 1 (3)
Better Parallel Architectures via Emulations (1992) (3)
On computing distances between leaves in a complete tree (1980) (3)
Bio-Inspired Pattern Processing by Cellular ANTomata (2018) (3)
Ants in Parking Lots (2010) (3)
Finite-State Robots in the Land of Rationalia (2012) (3)
A Note on Paths Embedded in Trees (1979) (2)
On Nakayama’s extension of the ^{()} theorems (1954) (2)
On Storing Concatenable Arrays (1977) (2)
To BSP or not to BSP in heterogeneous NOWs (2003) (2)
Minced trees, with applications to fault-tolerant VLSI processor arrays (1986) (2)
On scheduling collaborative computations on the Internet, I: mesh-DAGs and their close relatives (2003) (2)
Addressable data graphs (Extended Abstract) (1971) (2)
c-Perfect Hashing Schemes for Binary Trees, with Applications to Parallel Memories (2003) (2)
Advances in a Dag-Scheduling Theory for Internet-Based Computing (2006) (2)
Hashing schemes for extendible arrays (Extended Abstract) (1975) (2)
Path-robust multi-channel wireless networks (2009) (2)
Data graphs and addressing schemes (Extended Abstract) (1970) (2)
Salvage-Embeddings of Complete Trees (1995) (2)
Using Emulations to Enhance the Performance of Parallel Architectures (1999) (2)
Homological dimension and transcendence degree (1982) (2)
Finite-State Robots in a Warehouse: Achieving Linear Parallel Speedup While Rearranging Objects (2013) (2)
On trading task reallocation for thread management in partitionable multiprocessors (1996) (2)
Centralizers and forms of algebras (1973) (2)
Tolerating Faults in Synchronization Networks (1992) (2)
Storage schemes for boundedly extendible arrays (1977) (1)
The Diogenes Design Methodolog: From Embedding to Layout (1987) (1)
Monochromatic Paths and Triangulated Graphs (1998) (1)
The Changing Challenges of Collaborative Algorithmics (2005) (1)
Noncommutative Affine Schemes (1995) (1)
Operations on Tor and Ext (1962) (1)
Generalized addressing schemes for data graphs (1974) (1)
Exposing graph uniformities via algebraic specification (1990) (1)
On Batch-Scheduling Dags for Internet-Based Computing September 19 , 2006 (2006) (1)
A Realistic Cost Measure for Binary Search Trees (1981) (1)
Heterogeneity in Computing: Insights from a Worksharing Scheduling Problem (2011) (1)
Storage representations for tree-like data structures (1979) (1)
A Cost-Effective Streamlining of the Diogenes Design Methodology (1995) (1)
A Note on Ambiguity of Context-Free Languages and Presentations of Semilinear Sets (1970) (1)
Signatures on semi-local rings; research announcement (1971) (1)
The VLSI Revolution in Theoretical Circles (1984) (1)
Scheduling Matters: Area-Oriented Heuristic for Resource Management (2016) (1)
Proceedings of the Thirteenth Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 2001, Heraklion, Crete Island, Greece, July 4-6, 2001 (2001) (1)
50 Years of TOCS (2016) (1)
On Scheduling Computation-Dags for Internet-Based Computing (2004) (1)
Algorithmic Insights into Finite-State Robots (2015) (1)
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures (2003) (1)
Applied mathematics. (1974) (1)
K-theory and algebraic geometry : connections with quadratic forms and division algebras : Summer Research Institute on Quadratic Forms and Division Algebras, July 6-24, 1992, University of California, Santa Barbara (1995) (1)
Toward a core undergraduates curriculum in parallel and distributed computing (2012) (1)
c-Perfect Hashing Schemes for Arrays , with Applications to Parallel Memories (2003) (1)
Extension of derivations in continuous transformation rings (1955) (1)
A "Big-Ideas" Computation Theory Course for the Undergraduate (2008) (0)
On balancing computational load on rings of processors (1994) (0)
Cellular ANTomata as Engines for Highly Parallel Pattern Processing (2016) (0)
Designing and Using Parallel Architectures (1989) (0)
A " B-i " C T C   U 1 the Ideal Computation Theory Course 1.1 Course Goals (2007) (0)
Online Automata: Exemplars of “State” (2010) (0)
Best Paper Award recipients: 2006 International Parallel and Distributed Processing Symposium (2007) (0)
Proceedings of the Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 2002, Winnipeg, Manitoba, Canada, August 11-13, 2002 (2002) (0)
Understanding Computation: Pillars, Paradigms, Principles (2022) (0)
How to share a bag of tasks optimally in a heterogeneous cluster - three models, three answers (2004) (0)
Greedy "Exploitation" Is Close to Optimal on Node-Heterogeneous Clusters (2011) (0)
“Doing” Mathematics: A Toolkit for Mathematical Reasoning (2020) (0)
Robust Multi-Channel Wireless Networks (2007) (0)
A Model for Cycle-Stealing in Networks of Workstation Progress and Problems (1998) (0)
Editors’ Introduction and Roadmap (2018) (0)
Editors' Introduction and Roadmap (2018) (0)
Introduction (2020) (0)
Cellular ANTomata: A Tool for Early PDC Education (2017) (0)
Nondeterminism in Computability Theory (2010) (0)
MONOCHROMATIC PATHS AND TRIANGULATED (1995) (0)
Editor's foreword (2005) (0)
Nondeterministic Online Automata (2010) (0)
Editor's foreword (2005) (0)
Efficient emulations of interconnection networks (1989) (0)
Summation: A Complex Whole from Simple Parts (2020) (0)
Sets and Their Algebras: The Stem Cells of Mathematics (2020) (0)
On storing arbitrarily many extendible arrays of arbitrary dimensions (1975) (0)
Obituary: Shimon Even (2004) (0)
Nano-Technology and the Nanny State (2017) (0)
Finite Automata and Regular Languages (2010) (0)
The Diogenes Design Methodology: An Algorithmic Step Toward Efficient Configuration Circuitry (1986) (0)
Planned object duplication strategies in dynamic PRR meshes (2003) (0)
Three-Dimensional VLSI Layouts (1981) (0)
Editorial: Special FOCS Issue - Twenty-Second Annual IEEE Symposium on Foundations of Computer Science. (1984) (0)
IPDPS 2007 Organization (2007) (0)
PETER: Robots that watch the skies (2008) (0)
Editor's foreword (2005) (0)
A Cost Efficient Streamlining of the Diogenes Methology (1993) (0)
Applications of the Myhill–Nerode Theorem (2010) (0)
Editorial statement (2005) (0)
Enrichment Topic: “Efficient” Pairing Functions, with Applications (2010) (0)
Editorial Message (2013) (0)
Scalability within Algorithmics (2013) (0)
Optimal Simulations by Butterfly Networks: Extended Abstract, (1987) (0)
The Art of Counting: Combinatorics, with Applications to Probability and Statistics (2020) (0)
Algorithms - Scheduling I On Scheduling Dags to Maximize Area (2009) (0)
50 Years of TOCS (2016) (0)
10th workshop on Advances in Parallel and Distributed Computational Models - APDCM'08 (2008) (0)
IPDPS 2005 Organization (2005) (0)
Numbers III: Operational Representations and Their Consequences (2020) (0)
The Vertigo of Infinity: Handling the Very Large and the Infinite (2020) (0)
EduPar-20 Invited Panel (2020) (0)
Corrigendum: `` Allocating Storage for Extendible Arrays'' (1975) (0)
Special FOCS issue Sixteenth Annual Symposium on Foundations of Computer Science (1976) (0)
Scheduling trees using FIFO queues: a control-memory tradeoff (1994) (0)
1-1-1979 Optimal 2 , 3-Trees (2016) (0)
U n Balancing Lomput ational Load on Kings 01 rrocessors (1994) (0)
Technical Session 1 - Scheduling and Mapping (2010) (0)
Understand Mathematics, Understand Computing: Discrete Mathematics That All Computing Students Should Know (2020) (0)
Numbers II Building the Integers and Building with the Integers (2020) (0)
Proceedings of the First Heinz Nixdorf Symposium on Parallel Architectures and Their Efficient Use (1992) (0)
Editor’s Foreword (1997) (0)
Static Strategies for Worksharing with Unrecoverable Interruptions (Extended version) (2009) (0)
Appendix A – Chapters and topics (2015) (0)
Special FOCS issue—twenty-second annual IEEE symposium on foundations of computer science (1984) (0)
Application Placement on a Cluster of Servers ( extended abstract ) (0)
GALOIS THEORY OF CONTINUOUS (2010) (0)
CUPM Report to the Board of Governors, August 1972 (1973) (0)
Numbers I: The Basics of Our Number System (2020) (0)
The Left Spectrum and Irreducible Representations of ‘Small’ Quantized and Classical Rings (1995) (0)
Graphs II: Graphs for Computing and Communicating (2020) (0)
Recurrences: Rendering Complex Structure Manageable (2020) (0)
Graphs I: Representing Relationships Mathematically (2020) (0)
An abstract treatment of the module of quadratic forms over a semilocal ring (1978) (0)
Static Strategies for Worksharing with Unrecoverable Interruptions (2012) (0)
Theoretical Research on Networks: Models and Methodology 1 Crucial Concerns for Theoretical Researchers (1997) (0)
outing of Varia Le (1996) (0)
Noncommutative Local Algebra and Representations of certain rings of mathematical physics (1995) (0)
Skew PBW monads and representations (1995) (0)
Node-Visit Optimal 1-2 Brother Trees (1979) (0)
Zero divisors and commutativity of rings : technical report no. 1 (1952) (0)
Operations on ${\rm Tor}$ and ${\rm Ext}$ (1962) (0)
Book Review: An introduction to homological algebra (1961) (0)
Equivalent topological properties of the space of signatures of a semilocal ring (2022) (0)
Noncommutative spaces.dvi (2011) (0)
Book Review: Structure of Rings (1957) (0)
On constructing DAG‐schedules with large areas (2015) (0)
Review: Nathan Jacobson, Structure of Rings (1957) (0)
Selected Papers on Noncommutative Geometry (2014) (0)
GALOIS THEORY OF CONTINUOUS TRANSFORMATION RINGS ( 1 ) (2010) (0)
Problems for Solution: 4415-4419 (1950) (0)
American Mathematical Society Edited by with the Cooperation of Index to Volume 15 [december Cohomology of Groups in Arbitrary Categories (0)
Some Further Thoughts on the Ph.D. in Mathematics (1970) (0)
Six spectra and two dimensions of an abelian category (1995) (0)
The 20th Heterogeneity in Computing Workshop (HCW 2011) (2011) (0)
EXTENSION OF DERIVATIONS IN CONTINUOUS TRANSFORMATION RINGS(1) (2010) (0)
On Trading Task Reallocation for Thread Management in MultiprocessorsLixin (2007) (0)
Cellular ANTomata (Extended Abstract) (2007) (0)
Countability and Uncountability: The Precursors of “Encoding” (2010) (0)
DIFFERENTIAL FORMS ON REGULAR (2017) (0)
THE JUNE MEETING IN MISSOULA The four hundred ninety-third meeting of the American Mathe - (2007) (0)
Invited talk: structure in parallel processor arrays (1988) (0)
Noncommutative Projective Spectrum (1995) (0)
Arithmetic: Putting Numbers to Work (2020) (0)

This paper list is powered by the following services:

Other Resources About Arnold L. Rosenberg

en.wikipedia.org

What Schools Are Affiliated With Arnold L. Rosenberg?

Arnold L. Rosenberg is affiliated with the following schools:

Arnold L. Rosenberg's Academic­Influence.com Rankings