| 2008 |
|---|
| 118 | EE | Kfir Karmon,
Liran Liss,
Assaf Schuster:
GWiQ-P: an efficient decentralized grid-wide quota enforcement protocol.
Operating Systems Review 42(1): 111-118 (2008) |
| 117 | EE | Arik Friedman,
Ran Wolff,
Assaf Schuster:
Providing k-anonymity in data mining.
VLDB J. accepted for publication: (2008) |
| 2007 |
|---|
| 116 | | Werner Dubitzky,
Assaf Schuster,
Peter M. A. Sloot,
Michael Schroeder,
Mathilde Romberg:
Distributed, High-Performance and Grid Computing in Computational Biology , International Workshop, GCCB 2006, Eilat, Israel, January 21, 2007, Proceeding
Springer 2007 |
| 115 | EE | Orna Grumberg,
Assaf Schuster,
Avi Yadgar:
3-Valued Circuit SAT for STE with Automatic Refinement.
ATVA 2007: 457-473 |
| 114 | EE | Alex Gontmakher,
Avi Mendelson,
Assaf Schuster,
Gregory Shklover:
Code Compilation for an Explicitly Parallel Register-Sharing Architecture.
ICPP 2007: 58 |
| 113 | EE | Izchak Sharfman,
Assaf Schuster,
Daniel Keren:
Aggregate Threshold Queries in Sensor Networks.
IPDPS 2007: 1-10 |
| 112 | EE | Alex Gontmakher,
Avi Mendelson,
Assaf Schuster:
Using fine grain multithreading for energy efficient computing.
PPOPP 2007: 259-269 |
| 111 | EE | Izchak Sharfman,
Assaf Schuster,
Daniel Keren:
A geometric approach to monitoring threshold functions over distributed data streams.
ACM Trans. Database Syst. 32(4): (2007) |
| 110 | EE | Eli Pozniansky,
Assaf Schuster:
MultiRace: efficient on-the-fly data race detection in multithreaded C++ programs.
Concurrency and Computation: Practice and Experience 19(3): 327-340 (2007) |
| 109 | EE | Limor Fix,
Orna Grumberg,
Amnon Heyman,
Tamir Heyman,
Assaf Schuster:
Verifying Very Large Industrial Circuits Using 100 Processes and Beyond.
Int. J. Found. Comput. Sci. 18(1): 45-62 (2007) |
| 108 | EE | Denis Krivitski,
Assaf Schuster,
Ran Wolff:
A Local Facility Location Algorithm for Large-scale Distributed Systems.
J. Grid Comput. 5(4): 361-378 (2007) |
| 107 | EE | Ohad Shacham,
Mooly Sagiv,
Assaf Schuster:
Scaling model checking of dataraces using dynamic information.
J. Parallel Distrib. Comput. 67(5): 536-550 (2007) |
| 2006 |
|---|
| 106 | EE | Yitzhak Birk,
Idit Keidar,
Liran Liss,
Assaf Schuster:
Efficient Dynamic Aggregation.
DISC 2006: 90-104 |
| 105 | | Valentin Kravtsov,
Thomas Niessen,
Vlado Stankovski,
Assaf Schuster:
Service-based Resource Brokering for Grid-Based Data Mining.
GCA 2006: 163-169 |
| 104 | EE | Mark Silberstein,
Dan Geiger,
Assaf Schuster:
A Distributed System for Genetic Linkage Analysis.
GCCB 2006: 110-123 |
| 103 | EE | Mark Silberstein,
Dan Geiger,
Assaf Schuster,
Miron Livny:
Scheduling Mixed Workloads in Multi-grids: The Grid Execution Hierarchy.
HPDC 2006: 291-302 |
| 102 | EE | Mark Silberstein,
Gabriel Kliot,
Artyom Sharov,
Assaf Schuster,
Miron Livny:
Materializing Highly Available Grids.
HPDC 2006: 321-323 |
| 101 | EE | Noam Palatin,
Arie Leizarowitz,
Assaf Schuster,
Ran Wolff:
Mining for misconfigured machines in grid systems.
KDD 2006: 687-692 |
| 100 | EE | Arik Friedman,
Assaf Schuster,
Ran Wolff:
k-Anonymous Decision Tree Induction.
PKDD 2006: 151-162 |
| 99 | EE | Yitzhak Birk,
Idit Keidar,
Liran Liss,
Assaf Schuster,
Ran Wolff:
Veracity radius: capturing the locality of distributed computations.
PODC 2006: 102-111 |
| 98 | EE | Izchak Sharfman,
Assaf Schuster,
Daniel Keren:
A geometric approach to monitoring threshold functions over distributed data streams.
SIGMOD Conference 2006: 301-312 |
| 97 | EE | Orna Grumberg,
Tamir Heyman,
Assaf Schuster:
A work-efficient distributed algorithm for reachability analysis.
Formal Methods in System Design 29(2): 157-175 (2006) |
| 96 | EE | Michael Factor,
Assaf Schuster,
Konstantin Shagin:
A Platform-Independent Distributed Runtime for Standard Multithreaded Java.
International Journal of Parallel Programming 34(2): 113-142 (2006) |
| 95 | EE | Idit Keidar,
Assaf Schuster:
Want scalable computing?: speculate!
SIGACT News 37(3): 59-66 (2006) |
| 2005 |
|---|
| 94 | EE | Limor Fix,
Orna Grumberg,
Amnon Heyman,
Tamir Heyman,
Assaf Schuster:
Verifying Very Large Industrial Circuits Using 100 Processes and Beyond.
ATVA 2005: 11-25 |
| 93 | EE | Orna Grumberg,
Tamir Heyman,
Nili Ifergan,
Assaf Schuster:
Achieving Speedups in Distributed Symbolic Reachability Analysis Through Asynchronous Computation.
CHARME 2005: 129-145 |
| 92 | EE | Denis Krivitski,
Assaf Schuster,
Ran Wolff:
A Local Facility Location Algorithm for Sensor Networks.
DCOSS 2005: 368-375 |
| 91 | EE | Sergey Polyakov,
Assaf Schuster:
Verification of the Java Causality Requirements.
Haifa Verification Conference 2005: 224-246 |
| 90 | EE | Ohad Shacham,
Mooly Sagiv,
Assaf Schuster:
Scaling model checking of dataraces using dynamic information.
PPOPP 2005: 107-118 |
| 89 | | Amir Bar-Or,
Ran Wolff,
Assaf Schuster,
Daniel Keren:
Decision Tree Induction in High Dimensional, Hierarchically Distributed Databases.
SDM 2005 |
| 88 | EE | Orna Grumberg,
Tamir Heyman,
Assaf Schuster:
Distributed Symbolic Model Checking for µ-Calculus.
Formal Methods in System Design 26(2): 197-219 (2005) |
| 87 | EE | Amir Bar-Or,
Daniel Keren,
Assaf Schuster,
Ran Wolff:
Hierarchical Decision Tree Induction in Distributed Genomic Databases.
IEEE Trans. Knowl. Data Eng. 17(8): 1138-1151 (2005) |
| 86 | EE | Liran Liss,
Yitzhak Birk,
Assaf Schuster:
In-Kernel Integration of Operating System and Infiniband Functions for High Performance Computing Clusters: A DSM Example.
IEEE Trans. Parallel Distrib. Syst. 16(9): 830-840 (2005) |
| 85 | EE | Assaf Schuster,
Ran Wolff,
Dan Trock:
A high-performance distributed algorithm for mining association rules.
Knowl. Inf. Syst. 7(4): 458-475 (2005) |
| 84 | EE | Vadim Iosevich,
Assaf Schuster:
Software Distributed Shared Memory: a VIA-based implementation and comparison of sequential consistency with home-based lazy release consistency.
Softw., Pract. Exper. 35(8): 755-786 (2005) |
| 2004 |
|---|
| 83 | EE | Assaf Schuster,
Ran Wolff,
Bobi Gilburd:
Privacy-preserving association rule mining in large-scale distributed systems.
CCGRID 2004: 411-418 |
| 82 | EE | Yitzhak Birk,
Liran Liss,
Assaf Schuster,
Ran Wolff:
A Local Algorithm for Ad Hoc Majority Voting via Charge Fusion.
DISC 2004: 275-289 |
| 81 | EE | Vadim Iosevich,
Assaf Schuster:
Distributed Shared Memory: To Relax or Not to Relax?
Euro-Par 2004: 198-205 |
| 80 | EE | Orna Grumberg,
Assaf Schuster,
Avi Yadgar:
Memory Efficient All-Solutions SAT Solver and Its Application for Reachability Analysis.
FMCAD 2004: 275-289 |
| 79 | EE | Bobi Gilburd,
Assaf Schuster,
Ran Wolff:
Privacy-Preserving Data Mining on Data Grids in the Presence of Malicious Participants.
HPDC 2004: 225-234 |
| 78 | EE | Vadim Iosevich,
Assaf Schuster:
A comparison of sequential consistency with home-based lazy release consistency for software distributed shared memory.
ICS 2004: 306-315 |
| 77 | EE | Michael Factor,
Assaf Schuster,
Konstantin Shagin:
A Distributed Runtime for Java: Yesterday and Today.
IPDPS 2004 |
| 76 | EE | Vadim Iosevich,
Assaf Schuster:
Multithreaded Home-Based Lazy Release Consistency over VIA.
IPDPS 2004 |
| 75 | EE | Bobi Gilburd,
Assaf Schuster,
Ran Wolff:
k-TTP: a new privacy model for large-scale distributed environments.
KDD 2004: 563-568 |
| 74 | EE | Michael Factor,
Assaf Schuster,
Konstantin Shagin:
Instrumentation of standard libraries in object-oriented languages: the twin class hierarchy approach.
OOPSLA 2004: 288-300 |
| 73 | | Vlado Stankovski,
Michael May,
Jürgen Franke,
Assaf Schuster,
Damian McCourt,
Werner Dubitzky:
A Service-Centric Perspective for Data Mining in Complex Problem Solving Environments.
PDPTA 2004: 780-787 |
| 72 | EE | Assaf Schuster,
Ran Wolff:
Communication-Efficient Distributed Mining of Association Rules.
Data Min. Knowl. Discov. 8(2): 171-196 (2004) |
| 2003 |
|---|
| 71 | EE | Orna Grumberg,
Tamir Heyman,
Assaf Schuster:
A Work-Efficient Distributed Algorithm for Reachability Analysis.
CAV 2003: 54-66 |
| 70 | EE | Michael Factor,
Assaf Schuster,
Konstantin Shagin:
JavaSplit: A Runtime for Execution of Monolithic Java Programs on Heterogeneous Collections of Commodity Workstations.
CLUSTER 2003: 110-117 |
| 69 | EE | Emil-Dan Kohn,
Assaf Schuster:
A Transparent Software Distributed Shared Memory.
Euro-Par 2003: 1180-1189 |
| 68 | EE | Assaf Schuster,
Ran Wolff,
Dan Trock:
A High-Performance Distributed Algorithm for Mining Association Rules.
ICDM 2003: 291-298 |
| 67 | EE | Ran Wolff,
Assaf Schuster:
Association Rule Mining in Peer-to-Peer Systems.
ICDM 2003: 363-370 |
| 66 | EE | Eli Poznianski,
Assaf Schuster:
Efficient On-the-Fly Data Race Detection in Multithreaded C++ Programs.
IPDPS 2003: 287 |
| 65 | EE | Eli Pozniansky,
Assaf Schuster:
Efficient on-the-fly data race detection in multihreaded C++ programs.
PPOPP 2003: 179-190 |
| 64 | EE | Assaf Schuster:
Scalable Distributed Model Checking: Experiences, Lessons, and Expectations.
Electr. Notes Theor. Comput. Sci. 89(1): (2003) |
| 63 | EE | Alex Gontmakher,
Sergey Polyakov,
Assaf Schuster:
Complexity Of Verifying Java Shared Memory Execution.
Parallel Processing Letters 13(4): 721-733 (2003) |
| 62 | EE | Shoham Ben-David,
Orna Grumberg,
Tamir Heyman,
Assaf Schuster:
Scalable distributed on-the-fly symbolic model checking.
STTT 4(4): 496-504 (2003) |
| 2002 |
|---|
| 61 | EE | Michael Factor,
Assaf Schuster,
Konstantin Shagin:
Execution of monolithic Java programs on large non-dedicated collections of commodity workstations.
Java Grande 2002: 227 |
| 60 | | Tamir Heyman,
Daniel Geist,
Orna Grumberg,
Assaf Schuster:
A Scalable Parallel Algorithm for Reachability Analysis of Very Large Circuits.
Formal Methods in System Design 21(3): 317-338 (2002) |
| 2001 |
|---|
| 59 | EE | Orna Grumberg,
Tamir Heyman,
Assaf Schuster:
Distributed Symbolic Model Checking for µ-Calculus.
CAV 2001: 350-362 |
| 58 | | Nitzan Niv,
Assaf Schuster:
Transparent Adaptation of Sharing Granularity in MultiView-Based DSM Systems.
IPDPS 2001: 38 |
| 57 | EE | Assaf Schuster,
Ran Wolff:
Communication Efficient Distributed Mining of Association Rules.
SIGMOD Conference 2001: 473-484 |
| 56 | | Roy Friedman,
Eli Biham,
Ayal Itzkovitz,
Assaf Schuster:
Symphony: An Infrastructure for Managing Virtual Servers.
Cluster Computing 4(3): 221-233 (2001) |
| 55 | | Nitzan Niv,
Assaf Schuster:
Transparent adaptation of sharing granularity in MultiView-based DSM systems.
Softw., Pract. Exper. 31(15): 1439-1459 (2001) |
| 2000 |
|---|
| 54 | | Tamir Heyman,
Daniel Geist,
Orna Grumberg,
Assaf Schuster:
Achieving Scalability in Parallel Reachability Analysis of Very Large Circuits.
CAV 2000: 20-35 |
| 53 | EE | Shoham Ben-David,
Tamir Heyman,
Orna Grumberg,
Assaf Schuster:
Scalable Distributed On-the-Fly Symbolic Model Checking.
FMCAD 2000: 390-404 |
| 52 | EE | Yariv Aridor,
Michael Factor,
Avi Teperman,
Tamar Eilam,
Assaf Schuster:
A high performance cluster JVM presenting a pure single system image.
Java Grande 2000: 168-177 |
| 51 | EE | Alex Gontmakher,
Assaf Schuster:
Java consistency: nonoperational characterizations for Java memory behavior.
ACM Trans. Comput. Syst. 18(4): 333-386 (2000) |
| 50 | | Pascal Berthomé,
Torben Hagerup,
Ilan Newman,
Assaf Schuster:
Self-Simulation for the Passive Optical Star.
J. Algorithms 34(1): 128-147 (2000) |
| 49 | EE | Yariv Aridor,
Michael Factor,
Avi Teperman,
Tamar Eilam,
Assaf Schuster:
Transparently Obtaining Scalability for Java Applications on a Cluster.
J. Parallel Distrib. Comput. 60(10): 1159-1193 (2000) |
| 48 | EE | Dmitry Kogan,
Assaf Schuster:
Remote Reference Counting: Distributed Garbage Collection with Low Communication and Computation Overhead.
J. Parallel Distrib. Comput. 60(10): 1260-1292 (2000) |
| 47 | EE | Amit Reisman,
Craig Gotsman,
Assaf Schuster:
Interactive-Rate Animation Generation by Parallel Progressive Ray-Tracing on Distributed-Memory Machines.
J. Parallel Distrib. Comput. 60(9): 1074-1102 (2000) |
| 46 | EE | Ayal Itzkovitz,
Nitzan Niv,
Assaf Schuster:
Dynamic adaptation of sharing granularity in DSM systems.
Journal of Systems and Software 55(1): 19-32 (2000) |
| 1999 |
|---|
| 45 | EE | Roy Friedman,
Assaf Schuster,
Ayal Itzkovitz,
Eli Biham,
Erez Hadad,
Vladislav Kalinovsky,
Sergey Kleyman,
Roman Vitenberg:
Symphony: Managing Virtual Servers in the Global Village.
Euro-Par 1999: 777-784 |
| 44 | EE | Ayal Itzkovitz,
Nitzan Niv,
Assaf Schuster:
Dynamic Adaptation of Sharing Granularity in DSM Systems.
ICPP 1999: 220-227 |
| 43 | EE | Ayal Itzkovitz,
Assaf Schuster:
MultiView and Millipage - Fine-Grain Sharing in Page-Based DSMs.
OSDI 1999: 215-228 |
| 42 | EE | Mordecai J. Golin,
Assaf Schuster:
Optimal Point-to-point Broadcast Algorithms Via Lopsided Trees.
Discrete Applied Mathematics 93(2-3): 233-263 (1999) |
| 41 | | Ayal Itzkovitz,
Assaf Schuster,
Oren Zeev-Ben-Mordehai:
Toward Integration of Data Race Detection in DSM Systems.
J. Parallel Distrib. Comput. 59(2): 180-203 (1999) |
| 1998 |
|---|
| 40 | EE | Assaf Schuster,
Lea Shalev:
Using Remote Access Histories for Thread Scheduling in Distributed Shared Memory Systems.
DISC 1998: 347-362 |
| 39 | EE | Alex Gontmakher,
Assaf Schuster:
Characterization for Java Memory Behavior.
IPPS/SPDP 1998: 682-686 |
| 38 | | Aviad Cohen,
Yuri Rabinovich,
Assaf Schuster,
Hadas Shachnai:
Optimal Bounds on Tail Probabilities - A Simplified Approach.
IPPS/SPDP Workshops 1998: 341-350 |
| 37 | | Adi Bar-Lev,
Ayal Itzkovitz,
Alon Raviv,
Assaf Schuster:
Parallel Vertex-To-Vertex Radiosity on a Distributed Shared Memory System.
IRREGULAR 1998: 238-250 |
| 36 | | Ishai Ben-Aroya,
Donald D. Chinn,
Assaf Schuster:
A Lower Bound for Nearly Minimal Adaptive and Hot Potato Algorithms.
Algorithmica 21(4): 347-376 (1998) |
| 35 | EE | Ayal Itzkovitz,
Assaf Schuster,
Lea Shalev:
Thread migration and its applications in distributed shared memory systems.
Journal of Systems and Software 42(1): 71-87 (1998) |
| 34 | | Amir Ben-Dor,
Shai Halevi,
Assaf Schuster:
Potential Function Analysis of Greedy Hot-Potato Routing.
Theory Comput. Syst. 31(1): 41-61 (1998) |
| 1997 |
|---|
| 33 | | Dmitry Kogan,
Assaf Schuster:
Collecting Garbage Pages in a Distributed Shared Memory with Reduced Memory and Communication Overhead.
ESA 1997: 308-325 |
| 32 | EE | Ayal Itzkovitz,
Assaf Schuster,
Lea Shalev:
Supporting multiple parallel programming paradigms on top of the Millipede virtual parallel machine.
HIPS 1997: 25-34 |
| 31 | EE | Mordecai J. Golin,
Assaf Schuster:
Optimal point-to-point broadcast algorithms via lopsided trees.
ISTCS 1997: 63-73 |
| 30 | | Ishai Ben-Aroya,
Ilan Newman,
Assaf Schuster:
Randomized Single-Target Hot-Potato Routing.
J. Algorithms 23(1): 101-120 (1997) |
| 29 | | Roy Friedman,
Maxim Goldin,
Ayal Itzkovitz,
Assaf Schuster:
MILLIPEDE: Easy Parallel Programming in Available Distributed Environments.
Softw., Pract. Exper. 27(8): 929-965 (1997) |
| 1996 |
|---|
| 28 | | Ishai Ben-Aroya,
Donald D. Chinn,
Assaf Schuster:
A Lower Bound for Nearly Minimal Adaptive and Hot Potato Algorithms.
ESA 1996: 471-485 |
| 27 | | Roy Friedman,
Maxim Goldin,
Ayal Itzkovitz,
Assaf Schuster:
Millipede: Easy Parallel Programming in Available Distributed Environments (Extended Abstract).
Euro-Par, Vol. I 1996: 84-87 |
| 26 | EE | Yossi Matias,
Assaf Schuster:
Fast, Efficient Mutual and Self Simulations for Shared Memory and Reconfigurable Mesh.
Parallel Algorithms Appl. 8(3-4): 195-221 (1996) |
| 1995 |
|---|
| 25 | | Pascal Berthomé,
Th. Duboux,
Torben Hagerup,
Ilan Newman,
Assaf Schuster:
Self-Simulation for the Passive Optical Star Model.
ESA 1995: 369-380 |
| 24 | | Ishai Ben-Aroya,
Ilan Newman,
Assaf Schuster:
Randomized Single-Target Hot-Potato Routing.
ISTCS 1995: 20-29 |
| 23 | | Ishai Ben-Aroya,
Tamar Eilam,
Assaf Schuster:
Greedy Hot-Potato Routing on the Two-Dimensional Mesh.
Distributed Computing 9(1): 3-19 (1995) |
| 22 | EE | Ilan Newman,
Assaf Schuster:
Hot-Potato Algorithms for Permutation Routing.
IEEE Trans. Parallel Distrib. Syst. 6(11): 1168-1176 (1995) |
| 21 | | Yosi Ben-Asher,
Klaus-Jörn Lange,
David Peleg,
Assaf Schuster:
The Complexity of Reconfiguring Network Models
Inf. Comput. 121(1): 41-58 (1995) |
| 20 | | Yosi Ben-Asher,
Assaf Schuster:
The Complexity of Data Reduction on a Reconfigurable Linear Array.
J. Algorithms 18(2): 322-357 (1995) |
| 19 | EE | Yosi Ben-Asher,
Dan Gordon,
Assaf Schuster:
Efficient Self-Simulation Algorithms for Reconfigurable Arrays.
J. Parallel Distrib. Comput. 30(1): 1-22 (1995) |
| 18 | EE | Ilan Newman,
Assaf Schuster:
Hot Potato Worm Routing via Store-and-Forward Packet Routing.
J. Parallel Distrib. Comput. 30(1): 76-84 (1995) |
| 1994 |
|---|
| 17 | | Yosi Ben-Asher,
Gudula Rünger,
Reinhard Wilhelm,
Assaf Schuster:
Implementing 2DT on a Multiprocessor.
CC 1994: 113-127 |
| 16 | | Ishai Ben-Aroya,
Assaf Schuster:
Greedy Hot-Potato Routing on the Mesh.
ESA 1994: 365-376 |
| 15 | | Amir Ben-Dor,
Shai Halevi,
Assaf Schuster:
Potential Function Analysis of Greedy Hot-Potato Routing.
PODC 1994: 225-234 |
| 1993 |
|---|
| 14 | | Yosi Ben-Asher,
Dan Gordon,
Assaf Schuster:
Efficient Self Simulation Algorithms for Reconfigurable Arrays.
ESA 1993: 25-36 |
| 13 | | Yosi Ben-Asher,
Aviad Cohen,
Assaf Schuster:
Low Crosstalk Address Encodings for Optical Message Switching Systems..
IPPS 1993: 768-772 |
| 12 | | Ilan Newman,
Assaf Schuster:
Hot-Potato Worm Routing is Almost as Easy as Store-and-Forward Packet Routing.
ISTCS 1993: 202-211 |
| 11 | | Yosi Ben-Asher,
Gudula Rünger,
Assaf Schuster,
Reinhard Wilhelm:
2DT-FP: An FP Based Programming Language for Efficient Parallel Programming of Multiprocessor Networks.
PARLE 1993: 42-55 |
| 1992 |
|---|
| 10 | | Yosi Ben-Asher,
Assaf Schuster:
The Bus-Usage Method for the Analysis of Reconfiguring Networks Algorithms.
IPPS 1992: 146-149 |
| 9 | | Yosi Ben-Asher,
Aviad Cohen,
Assaf Schuster,
Jop F. Sibeyn:
The Impact of Task-Length Parameters on the Performance of the Random Load-Balancing Algorithm.
IPPS 1992: 82-85 |
| 8 | | Yosi Ben-Asher,
David Peleg,
Assaf Schuster:
The Complexity of Reconfiguring Network Models.
ISTCS 1992: 79-90 |
| 7 | | Yosi Ben-Asher,
David Egozi,
Assaf Schuster:
2-D SIMD Algorithms for Perfect Shuffle Networks.
J. Parallel Distrib. Comput. 16(3): 250-257 (1992) |
| 1991 |
|---|
| 6 | | Yosi Ben-Asher,
David Peleg,
R. Ramaswami,
Assaf Schuster:
The POwer of Reconfiguration.
ICALP 1991: 139-150 |
| 5 | | Yonatan Aumann,
Assaf Schuster:
Improved Memory Utilization in Deterministic PRAM Simulation.
J. Parallel Distrib. Comput. 12(2): 146-151 (1991) |
| 4 | | Yosi Ben-Asher,
David Peleg,
R. Ramaswami,
Assaf Schuster:
The Power of Reconfiguration.
J. Parallel Distrib. Comput. 13(2): 139-153 (1991) |
| 3 | | Yosi Ben-Asher,
Assaf Schuster:
Ranking on Reconfigurable Networks.
Parallel Processing Letters 1: 149-156 (1991) |
| 1989 |
|---|
| 2 | EE | Yosi Ben-Asher,
David Egozi,
Assaf Schuster:
2-D SIMD Algorithms in the Perfect Shuffle Networks.
ISCA 1989: 88-95 |
| 1 | | Eli Shamir,
Assaf Schuster:
Communication Aspects of Networks Based on Geometric Incidence Relations.
Theor. Comput. Sci. 64(1): 83-96 (1989) |
