The following pages link to Assaf Schuster (Q192371):
Displaying 39 items.
- Top-\(k\) vectorial aggregation queries in a distributed environment (Q635316) (← links)
- A scheduling framework for large-scale, parallel, and topology-aware applications (Q666224) (← links)
- Distributed symbolic model checking for \(\mu\)-calculus (Q816198) (← links)
- Collecting garbage pages in a distributed shared memory with reduced memory and communication overhead (Q826100) (← links)
- A platform-independent distributed runtime for standard multithreaded Java (Q853757) (← links)
- Scaling model checking of dataraces using dynamic information (Q882147) (← links)
- Communication aspects of networks based on geometric incidence relations (Q1119610) (← links)
- Improved memory utilization in deterministic PRAM simulation (Q1177088) (← links)
- Optimal point-to-point broadcast algorithms via lopsided trees (Q1296579) (← links)
- (Q1384706) (redirect page) (← links)
- Potential function analysis of greedy hot-potato routing (Q1384707) (← links)
- A lower bound for nearly minimal adaptive and hot potato algorithms (Q1393080) (← links)
- A scalable parallel algorithm for reachability analysis of very large circuits (Q1871864) (← links)
- The complexity of reconfiguring network models (Q1898112) (← links)
- A work-efficient distributed algorithm for reachability analysis (Q2431764) (← links)
- (Q2754071) (← links)
- Distributed geometric query monitoring using prediction models (Q2790135) (← links)
- Randomized Single-Target Hot-Potato Routing (Q3128988) (← links)
- VERIFYING VERY LARGE INDUSTRIAL CIRCUITS USING 100 PROCESSES AND BEYOND (Q3426787) (← links)
- 3-Valued Circuit SAT for STE with Automatic Refinement (Q3510816) (← links)
- Efficient Dynamic Aggregation (Q3524297) (← links)
- Hybrid BDD and All-SAT Method for Model Checking (Q3630184) (← links)
- The Complexity of Data Reduction on a Reconfigurable Linear Array (Q4327826) (← links)
- (Q4553260) (← links)
- A lower bound for nearly minimal adaptive and hot potato algorithms (Q4595508) (← links)
- Transparent adaptation of sharing granularity in MultiView-based DSM systems (Q4791065) (← links)
- FAST, EFFICIENT MUTUAL AND SELF SIMULATIONS FOR SHARED MEMORY AND RECONFIGURABLE MESH (Q4820153) (← links)
- (Q4942227) (← links)
- Self-Simulation for the Passive Optical Star (Q4943073) (← links)
- Greedy hot-potato routing on the two-dimensional mesh (Q5136999) (← links)
- Veracity radius (Q5177271) (← links)
- Potential function analysis of greedy hot-potato routing (Q5361413) (← links)
- A Local Algorithm for Ad Hoc Majority Voting via Charge Fusion (Q5464198) (← links)
- Formal Methods in Computer-Aided Design (Q5492986) (← links)
- Correct Hardware Design and Verification Methods (Q5493223) (← links)
- Computer Aided Verification (Q5900670) (← links)
- Interactive-rate animation generation by parallel progressive ray-tracing on distributed-memory machines (Q5938703) (← links)
- Self-simulation for the Passive Optical Star model (Q6102315) (← links)
- (Q6126301) (← links)
