The following pages link to Arnold L. Rosenberg (Q372949):
Displaying 45 items.
- Static strategies for worksharing with unrecoverable interruptions (Q372951) (← links)
- On scheduling \textsc{DAGs} for volatile computing platforms: area-maximizing schedules (Q456005) (← links)
- (Q645849) (redirect page) (← links)
- Static worksharing strategies for heterogeneous computers with unrecoverable interruptions (Q645850) (← links)
- Extending IC-scheduling via the sweep algorithm (Q666039) (← links)
- On clustering \textsc{Dag}s for task-hungry computing platforms (Q692974) (← links)
- Partitioning circuits for improved testability (Q920939) (← links)
- On ``exploiting'' node-heterogeneous clusters optimally (Q927390) (← links)
- The pillars of computation theory. State, encoding, nondeterminism (Q1039511) (← links)
- Uniform data encodings (Q1134520) (← links)
- Data encodings and their costs (Q1139942) (← links)
- (Q1163868) (redirect page) (← links)
- Stabbing line segments (Q1163869) (← links)
- Product-shuffle networks: Toward reconciling shuffles and butterflies (Q1199448) (← links)
- An extrinsic characterization of addressable data graphs (Q1212795) (← links)
- Storage schemes for boundedly extendible arrays (Q1237541) (← links)
- On storing concatenable arrays (Q1238626) (← links)
- Polynomial indexing of integer lattice-points. I. General conceopts and quadratic polynomials (Q1252374) (← links)
- Polynomial indexing of integer lattice-points. II. Nonexistence results for higher-degree polynomials (Q1252375) (← links)
- A note on paths embedded in trees (Q1253099) (← links)
- A tight layout of the butterfly network (Q1265167) (← links)
- Scheduling DAGs opportunistically: the dream and the reality circa 2016 (Q1693216) (← links)
- Efficient trigger-broadcasting in heterogeneous clusters (Q1779733) (← links)
- Bandwidth and pebbling (Q1838912) (← links)
- Scheduling time-constrained communication in linear networks (Q1871771) (← links)
- Obituary: Shimon Even, June 15, 1935 -- May 1, 2004 (Q1882532) (← links)
- An empirical study of dynamic scheduling on rings of processors (Q1960607) (← links)
- Multitape one-way nonwriting automata (Q2527943) (← links)
- Time-restricted sequence generation (Q2537897) (← links)
- Data graphs and addressing schemes (Q2547121) (← links)
- Multitape finite automata with rewind instructions (Q2555470) (← links)
- (Q2748499) (← links)
- ON SCHEDULING SERIES-PARALLEL DAGs TO MAXIMIZE AREA (Q2929638) (← links)
- Three-Dimensional VLSI (Q3026917) (← links)
- Perfect Storage Representations for Families of Data Structures (Q3036701) (← links)
- APPLICATION PLACEMENT ON A CLUSTER OF SERVERS (Q3065615) (← links)
- The Parking Problem for Finite-State Robots (Q3143750) (← links)
- HETEROGENEITY IN COMPUTING: INSIGHTS FROM A WORKSHARING SCHEDULING PROBLEM (Q3173483) (← links)
- (Q3206327) (← links)
- (Q3313788) (← links)
- (Q3315440) (← links)
- (Q3335001) (← links)
- Binary search trees with binary comparison cost (Q3335002) (← links)
- Optimal embeddings of butterfly-like graphs in the hypercube (Q3355251) (← links)
- On Multi-Head Finite Automata (Q5553286) (← links)
