| 2012 | ||
|---|---|---|
| 39 | Ori Rottenstreich, Isaac Keslassy: The Bloom paradox: When not to use a Bloom filter? INFOCOM 2012: 1638-1646 | |
| 38 | Ori Rottenstreich, Yossi Kanizo, Isaac Keslassy: The Variable-Increment Counting Bloom Filter. INFOCOM 2012: 1880-1888 | |
| 37 | Erez Tsidon, Iddo Hanniel, Isaac Keslassy: Estimators also need shared values to grow together. INFOCOM 2012: 1889-1897 | |
| 36 | Yossi Kanizo, David Hay, Isaac Keslassy: Hash tables with finite buckets are less resistant to deletions. Computer Networks 56(4): 1376-1389 (2012) | |
| 2011 | ||
| 35 | Isaac Keslassy, Kirill Kogan, Gabriel Scalosub, Michael Segal: Providing performance guarantees in multipass network processors. INFOCOM 2011: 3191-3199 | |
| 34 | Tsahee Zidenberg, Isaac Keslassy, Uri C. Weiser: Multi-Amdahl: Optimal Resource Sharing with Multiple Program Execution Segments CoRR abs/1105.2960: (2011) | |
| 33 | Alexander Shpiner, Isaac Keslassy: Modeling the interactions of congestion control and switch scheduling. Computer Networks 55(6): 1257-1275 (2011) | |
| 32 | Evgeni Krimer, Isaac Keslassy, Avinoam Kolodny, Isask'har Walter, Mattan Erez: Static timing analysis for modeling QoS in networks-on-chip. J. Parallel Distrib. Comput. 71(5): 687-699 (2011) | |
| 2010 | ||
| 31 | Ori Rottenstreich, Isaac Keslassy: Worst-Case TCAM Rule Expansion. INFOCOM 2010: 456-460 | |
| 30 | Ori Rottenstreich, Isaac Keslassy: On the code length of TCAM coding schemes. ISIT 2010: 1908-1912 | |
| 29 | Alexander Shpiner, Isaac Keslassy: A switch-based approach to throughput collapse and starvation in data centers. IWQoS 2010: 1-9 | |
| 28 | Josef Kanizo, David Hay, Isaac Keslassy: Maximum Bipartite Matching Size And Application to Cuckoo Hashing CoRR abs/1007.1946: (2010) | |
| 27 | Hagit Attiya, David Hay, Isaac Keslassy: Packet-Mode Emulation of Output-Queued Switches. IEEE Trans. Computers 59(10): 1378-1391 (2010) | |
| 26 | Itamar Cohen, Ori Rottenstreich, Isaac Keslassy: Statistical Approach to Networks-on-Chip. IEEE Trans. Computers 59(6): 748-761 (2010) | |
| 25 | Bill Lin, Isaac Keslassy: The Concurrent Matching Switch Architecture. IEEE/ACM Trans. Netw. 18(4): 1330-1343 (2010) | |
| 2009 | ||
| 24 | Asaf Baron, Ran Ginosar, Isaac Keslassy: The Capacity Allocation Paradox. INFOCOM 2009: 1359-1367 | |
| 23 | Josef Kanizo, David Hay, Isaac Keslassy: Optimal Fast Hashing. INFOCOM 2009: 2500-2508 | |
| 22 | Josef Kanizo, David Hay, Isaac Keslassy: The Crosspoint-Queued Switch. INFOCOM 2009: 729-737 | |
| 21 | Alexander Shpiner, Isaac Keslassy: Modeling the interactions of congestion control and switch scheduling. IWQoS 2009: 1-9 | |
| 20 | Evgeni Krimer, Mattan Erez, Isaac Keslassy, Avinoam Kolodny, Isask'har Walter: Packet-level static timing analysis for NoCs. NOCS 2009: 88 | |
| 19 | Mark Shifrin, Isaac Keslassy: Small-buffer networks. Computer Networks 53(14): 2552-2565 (2009) | |
| 18 | Bin Lin, Isaac Keslassy: The interleaved matching switch architecture. IEEE Transactions on Communications 57(12): 3732-3742 (2009) | |
| 2008 | ||
| 17 | Itamar Cohen, Ori Rottenstreich, Isaac Keslassy: Statistical Approach to NoC Design. NOCS 2008: 171-180 | |
| 16 | Mark Shifrin, Isaac Keslassy: Modeling TCP in Small-Buffer Networks. Networking 2008: 667-678 | |
| 2007 | ||
| 15 | Bill Lin, Isaac Keslassy: Frame-aggregated concurrent matching switch. ANCS 2007: 107-116 | |
| 14 | Hadas Kogan, Isaac Keslassy: Fundamental Complexity of Optical Systems. INFOCOM 2007: 2506-2510 | |
| 13 | Hadas Kogan, Isaac Keslassy: Optimal-Complexity Optical Router. INFOCOM 2007: 706-714 | |
| 2006 | ||
| 12 | Bill Lin, Isaac Keslassy: The Concurrent Matching Switch Architecture. INFOCOM 2006 | |
| 11 | Hagit Attiya, David Hay, Isaac Keslassy: Packet-mode emulation of output-queued switches. SPAA 2006: 138-147 | |
| 2005 | ||
| 10 | Bill Lin, Isaac Keslassy: A Scalable Switch for Service Guarantees. Hot Interconnects 2005: 93-99 | |
| 9 | Isaac Keslassy, Cheng-Shang Chang, Nick McKeown, Duan-Shin Lee: Optimal load-balancing. INFOCOM 2005: 1712-1722 | |
| 8 | Srikanth Arekapudi, Shang-Tse Chuang, Isaac Keslassy, Nick McKeown: Using Hardware to Configure a Load-Balanced Switch. IEEE Micro 25(1): 70-78 (2005) | |
| 7 | Isaac Keslassy, Murali S. Kodialam, T. V. Lakshman, Dimitrios Stiliadis: On guaranteed smooth scheduling for input-queued switches. IEEE/ACM Trans. Netw. 13(6): 1364-1375 (2005) | |
| 2004 | ||
| 6 | Isaac Keslassy, Shang-Tse Chuang, Nick McKeown: A Load-Balanced Switch with an Arbitrary Number of Linecards. INFOCOM 2004 | |
| 5 | Guido Appenzeller, Isaac Keslassy, Nick McKeown: Sizing router buffers. SIGCOMM 2004: 281-292 | |
| 2003 | ||
| 4 | Isaac Keslassy, Murali S. Kodialam, T. V. Lakshman, Dimitrios Stiliadis: On Guaranteed Smooth Scheduling For Input-Queued Switches. INFOCOM 2003 | |
| 3 | Isaac Keslassy, Shang-Tse Chuang, Kyoungsik Yu, David Miller, Mark Horowitz, Olav Solgaard, Nick McKeown: Scaling internet routers using optics. SIGCOMM 2003: 189-200 | |
| 2002 | ||
| 2 | Isaac Keslassy, Nick McKeown: Maintaining Packet Order In Two-stage Switches. INFOCOM 2002 | |
| 2001 | ||
| 1 | Mark Kalman, Isaac Keslassy, Daniel Wang, Bernd Girod: Classification of compound images based on transform coefficient likelihood. ICIP (1) 2001: 750-753 | |
Colors in the list of coauthors
Last update Fri May 25 01:42:58 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page