| |
 |      |
                                              |
Note: Links lead to the DBLP on the Web. Assaf Schuster Orna Grumberg , Tamir Heyman , Assaf Schuster: A Work-Efficient Distributed Algorithm for Reachability Analysis. CAV 2003 : 54-66 Emil-Dan Kohn , Assaf Schuster: A Transparent Software Distributed Shared Memory. Euro-Par 2003 : 1180-1189 Assaf Schuster, Ran Wolff , Dan Trock : A High-Performance Distributed Algorithm for Mining Association Rules. ICDM 2003 : 291-298 Ran Wolff , Assaf Schuster: Association Rule Mining in Peer-to-Peer Systems. ICDM 2003 : 363-370 Eli Poznianski , Assaf Schuster: Efficient On-the-Fly Data Race Detection in Multithreaded C++ Programs. IPDPS 2003 : 287 Eli Pozniansky , Assaf Schuster: Efficient on-the-fly data race detection in multihreaded C++ programs. PPOPP 2003 : 179-190 Assaf Schuster: Scalable Distributed Model Checking: Experiences, Lessons, and Expectations. Electr. Notes Theor. Comput. Sci. 89 (1): (2003) Shoham Ben-David , Orna Grumberg , Tamir Heyman , Assaf Schuster: Scalable distributed on-the-fly symbolic model checking. STTT 4 (4): 496-504 (2003) 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) Orna Grumberg , Tamir Heyman , Assaf Schuster: Distributed Symbolic Model Checking for µ-Calculus. CAV 2001 : 350-362 Nitzan Niv , Assaf Schuster: Transparent Adaptation of Sharing Granularity in MultiView-Based DSM Systems. IPDPS 2001 : 38 Assaf Schuster, Ran Wolff : Communication Efficient Distributed Mining of Association Rules. SIGMOD Conference 2001 Roy Friedman , Eli Biham , Ayal Itzkovitz , Assaf Schuster: Symphony: An Infrastructure for Managing Virtual Servers. Cluster Computing 4 (3): 221-233 (2001) Nitzan Niv , Assaf Schuster: Transparent adaptation of sharing granularity in MultiView-based DSM systems. Softw., Pract. Exper. 31 (15): 1439-1459 (2001) Tamir Heyman , Daniel Geist , Orna Grumberg , Assaf Schuster: Achieving Scalability in Parallel Reachability Analysis of Very Large Circuits. CAV 2000 : 20-35 Shoham Ben-David , Tamir Heyman , Orna Grumberg , Assaf Schuster: Scalable Distributed On-the-Fly Symbolic Model Checking. FMCAD 2000 : 390-404 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 Alex Gontmakher , Assaf Schuster: Java consistency: nonoperational characterizations for Java memory behavior. ACM Trans. Comput. Syst. 18 (4): 333-386 (2000) Pascal Berthomé , Torben Hagerup , Ilan Newman , Assaf Schuster: Self-Simulation for the Passive Optical Star. J. Algorithms 34 (1): 128-147 (2000) 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) 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) 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) 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 Ayal Itzkovitz , Nitzan Niv , Assaf Schuster: Dynamic Adaptation of Sharing Granularity in DSM Systems. ICPP 1999 : 220-227 Ayal Itzkovitz , Assaf Schuster: MultiView and Millipage - Fine-Grain Sharing in Page-Based DSMs. OSDI 1999 : 215-228 Mordecai J. Golin , Assaf Schuster: Optimal Point-to-point Broadcast Algorithms Via Lopsided Trees. Discrete Applied Mathematics 93 (2-3): 233-263 (1999) 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) Assaf Schuster, Lea Shalev : Using Remote Access Histories for Thread Scheduling in Distributed Shared Memory Systems. DISC 1998 : 347-362 Alex Gontmakher , Assaf Schuster: Characterization for Java Memory Behavior. IPPS/SPDP 1998 : 682-686 Aviad Cohen , Yuri Rabinovich , Assaf Schuster, Hadas Shachnai : Optimal Bounds on Tail Probabilities - A Simplified Approach. IPPS/SPDP Workshops 1998 : 341-350 Adi Bar-Lev , Ayal Itzkovitz , Alon Raviv , Assaf Schuster: Parallel Vertex-To-Vertex Radiosity on a Distributed Shared Memory System. IRREGULAR 1998 : 238-250 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) Amir Ben-Dor , Shai Halevi , Assaf Schuster: Potential Function Analysis of Greedy Hot-Potato Routing. Theory Comput. Syst. 31 (1): 41-61 (1998) Dmitry Kogan , Assaf Schuster: Collecting Garbage Pages in a Distributed Shared Memory with Reduced Memory and Communication Overhead. ESA 1997 : 308-325 Ayal Itzkovitz , Assaf Schuster, Lea Shalev : Supporting multiple parallel programming paradigms on top of the Millipede virtual parallel machine. HIPS 1997 : 25-34 Mordecai J. Golin , Assaf Schuster: Optimal point-to-point broadcast algorithms via lopsided trees. ISTCS 1997 : 63-73 Ishai Ben-Aroya , Ilan Newman , Assaf Schuster: Randomized Single-Target Hot-Potato Routing. J. Algorithms 23 (1): 101-120 (1997) Roy Friedman , Maxim Goldin , Ayal Itzkovitz , Assaf Schuster: MILLIPEDE: Easy Parallel Programming in Available Distributed Environments. Softw., Pract. Exper. 27 (8): 929-965 (1997) Ishai Ben-Aroya , Donald D. Chinn , Assaf Schuster: A Lower Bound for Nearly Minimal Adaptive and Hot Potato Algorithms. ESA 1996 : 471-485 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 Pascal Berthomé , Th. Duboux , Torben Hagerup , Ilan Newman , Assaf Schuster: Self-Simulation for the Passive Optical Star Model. ESA 1995 : 369-380 Ishai Ben-Aroya , Ilan Newman , Assaf Schuster: Randomized Single-Target Hot-Potato Routing. ISTCS 1995 : 20-29 Ishai Ben-Aroya , Tamar Eilam , Assaf Schuster: Greedy Hot-Potato Routing on the Two-Dimensional Mesh. Distributed Computing 9 (1): 3-19 (1995) Ilan Newman , Assaf Schuster: Hot-Potato Algorithms for Permutation Routing. IEEE Trans. Parallel Distrib. Syst. 6 (11): 1168-1176 (1995) Yosi Ben-Asher , Klaus-Jörn Lange , David Peleg , Assaf Schuster: The Complexity of Reconfiguring Network Models Inf. Comput. 121 (1): 41-58 (1995) Yosi Ben-Asher , Assaf Schuster: The Complexity of Data Reduction on a Reconfigurable Linear Array. J. Algorithms 18 (2): 322-357 (1995) Yosi Ben-Asher , Dan Gordon , Assaf Schuster: Efficient Self-Simulation Algorithms for Reconfigurable Arrays. J. Parallel Distrib. Comput. 30 (1): 1-22 (1995) Ilan Newman , Assaf Schuster: Hot Potato Worm Routing via Store-and-Forward Packet Routing. J. Parallel Distrib. Comput. 30 (1): 76-84 (1995) Yosi Ben-Asher , Gudula Rünger , Reinhard Wilhelm , Assaf Schuster: Implementing 2DT on a Multiprocessor. CC 1994 : 113-127 Ishai Ben-Aroya , Assaf Schuster: Greedy Hot-Potato Routing on the Mesh. ESA 1994 : 365-376 Amir Ben-Dor , Shai Halevi , Assaf Schuster: Potential Function Analysis of Greedy Hot-Potato Routing. PODC 1994 : 225-234 Yosi Ben-Asher , Dan Gordon , Assaf Schuster: Efficient Self Simulation Algorithms for Reconfigurable Arrays. ESA 1993 : 25-36 Yosi Ben-Asher , Aviad Cohen , Assaf Schuster: Low Crosstalk Address Encodings for Optical Message Switching Systems.. IPPS 1993 : 768-772 Ilan Newman , Assaf Schuster: Hot-Potato Worm Routing is Almost as Easy as Store-and-Forward Packet Routing. ISTCS 1993 : 202-211 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 Yosi Ben-Asher , Assaf Schuster: The Bus-Usage Method for the Analysis of Reconfiguring Networks Algorithms. IPPS 1992 : 146-149 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 Yosi Ben-Asher , David Peleg , Assaf Schuster: The Complexity of Reconfiguring Network Models. ISTCS 1992 : 79-90 Yosi Ben-Asher , David Egozi , Assaf Schuster: 2-D SIMD Algorithms for Perfect Shuffle Networks. J. Parallel Distrib. Comput. 16 (3): 250-257 (1992) Yosi Ben-Asher , David Peleg , R. Ramaswami , Assaf Schuster: The POwer of Reconfiguration. ICALP 1991 : 139-150 Yonatan Aumann , Assaf Schuster: Improved Memory Utilization in Deterministic PRAM Simulation. J. Parallel Distrib. Comput. 12 (2): 146-151 (1991) Yosi Ben-Asher , David Peleg , R. Ramaswami , Assaf Schuster: The Power of Reconfiguration. J. Parallel Distrib. Comput. 13 (2): 139-153 (1991) Yosi Ben-Asher , Assaf Schuster: Ranking on Reconfigurable Networks. Parallel Processing Letters 1 : 149-156 (1991) Yosi Ben-Asher , David Egozi , Assaf Schuster: 2-D SIMD Algorithms in the Perfect Shuffle Networks. ISCA 1989 : 88-95 Eli Shamir , Assaf Schuster: Communication Aspects of Networks Based on Geometric Incidence Relations. Theor. Comput. Sci. 64 (1): 83-96 (1989) 1 [ 46 ] [ 49 ] 2 [ 5 ] 3 [ 35 ] 4 [ 16 ] [ 23 ] [ 24 ] [ 27 ] [ 29 ] [ 34 ] 5 [ 2 ] [ 3 ] [ 4 ] [ 6 ] [ 7 ] [ 8 ] [ 9 ] [ 10 ] [ 11 ] [ 13 ] [ 14 ] [ 17 ] [ 19 ] [ 20 ] [ 21 ] 6 [ 50 ] [ 58 ] 7 [ 15 ] [ 33 ] 8 [ 25 ] [ 47 ] 9 [ 43 ] [ 53 ] 10 [ 27 ] [ 34 ] 11 [ 9 ] [ 13 ] [ 36 ] 12 [ 25 ] 13 [ 2 ] [ 7 ] 14 [ 23 ] [ 46 ] [ 49 ] 15 [ 46 ] [ 49 ] 16 [ 26 ] [ 28 ] [ 43 ] [ 53 ] 17 [ 51 ] [ 57 ] 18 [ 26 ] [ 28 ] 19 [ 30 ] [ 40 ] 20 [ 37 ] [ 48 ] 21 [ 14 ] [ 19 ] 22 [ 44 ] 23 [ 50 ] [ 51 ] [ 56 ] [ 57 ] [ 58 ] [ 65 ] 24 [ 43 ] 25 [ 25 ] [ 47 ] 26 [ 15 ] [ 33 ] 27 [ 50 ] [ 51 ] [ 56 ] [ 57 ] [ 58 ] [ 65 ] 28 [ 26 ] [ 28 ] [ 31 ] [ 35 ] [ 39 ] [ 41 ] [ 42 ] [ 43 ] [ 53 ] 29 [ 43 ] 30 [ 43 ] 31 [ 32 ] [ 45 ] 32 [ 64 ] 33 [ 21 ] 34 [ 12 ] [ 18 ] [ 22 ] [ 24 ] [ 25 ] [ 29 ] [ 47 ] 35 [ 42 ] [ 52 ] [ 55 ] 36 [ 4 ] [ 6 ] [ 8 ] [ 21 ] 37 [ 61 ] 38 [ 60 ] 39 [ 36 ] 40 [ 4 ] [ 6 ] 41 [ 35 ] 42 [ 44 ] 43 [ 11 ] [ 17 ] 44 [ 36 ] 45 [ 31 ] [ 38 ] 46 [ 1 ] 47 [ 9 ] 48 [ 46 ] [ 49 ] 49 [ 63 ] 50 [ 43 ] 51 [ 11 ] [ 17 ] 52 [ 54 ] [ 62 ] [ 63 ] 53 [ 39 ]  ©2004 Association for Computing Machinery |
