default search action
Sailesh Kumar
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2013
- [c17]Alex X. Liu, Eric Norige, Sailesh Kumar:
A few bits are enough - ASIC friendly Regular Expression matching for high speed network security systems. ICNP 2013: 1-10 - 2011
- [c16]Nan Hua, Eric Norige, Sailesh Kumar, Bill Lynch:
Non-crypto Hardware Hash Functions for High Performance Networking ASICs. ANCS 2011: 156-166 - 2010
- [c15]Bill Lynch, Sailesh Kumar:
Smart memory. Hot Chips Symposium 2010: 1
2000 – 2009
- 2009
- [c14]Domenico Ficara, Stefano Giordano
, Sailesh Kumar, Bill Lynch:
Divide and discriminate: algorithm for deterministic and fast hash lookups. ANCS 2009: 133-142 - 2008
- [j1]Patrick Crowley, Sailesh Kumar, John Maschmeyer:
Exploiting Locality to Ameliorate Packet Queue Contention and Serialization. J. Instr. Level Parallelism 10 (2008) - [c13]Sailesh Kumar, Jonathan S. Turner, Patrick Crowley:
Peacock Hashing: Deterministic and Updatable Hashing for High Performance Networking. INFOCOM 2008: 101-105 - 2007
- [c12]Sailesh Kumar, Balakrishnan Chandrasekaran, Jonathan S. Turner, George Varghese:
Curing regular expressions matching algorithms from insomnia, amnesia, and acalculia. ANCS 2007: 155-164 - [c11]Sailesh Kumar, Jonathan S. Turner, Patrick Crowley, Michael Mitzenmacher:
HEXA: Compact Data Structures for Faster Packet Processing. ICNP 2007: 246-255 - [c10]Jonathan S. Turner, Patrick Crowley, John D. DeHart, Amy Freestone, Brandon Heller, Fred Kuhns, Sailesh Kumar, John W. Lockwood, Jing Lu, Michael Wilson, Charles Wiseman, David Zar:
Supercharging planetlab: a high performance, multi-application, overlay network platform. SIGCOMM 2007: 85-96 - 2006
- [c9]Sailesh Kumar, Michela Becchi, Patrick Crowley, Jonathan S. Turner:
CAMP: fast and efficient IP lookup architecture. ANCS 2006: 51-60 - [c8]Sailesh Kumar, Jonathan S. Turner, John Williams:
Advanced algorithms for fast and scalable deep packet inspection. ANCS 2006: 81-92 - [c7]Sailesh Kumar, John Maschmeyer, Patrick Crowley:
Exploiting locality to ameliorate packet queue contention and serialization. Conf. Computing Frontiers 2006: 279-290 - [c6]Sailesh Kumar, Sarang Dharmapurikar, Fang Yu, Patrick Crowley, Jonathan S. Turner:
Algorithms to accelerate multiple regular expressions matching for deep packet inspection. SIGCOMM 2006: 339-350 - 2005
- [c5]Sailesh Kumar, Patrick Crowley:
Segmented hash: an efficient hash table implementation for high performance networking subsystems. ANCS 2005: 91-103 - [c4]Sarang Dharmapurikar, Sailesh Kumar, John W. Lockwood, Patrick Crowley:
Optimizing memory bandwidth of a multi-channel packet buffer. GLOBECOM 2005: 6 - [c3]Sailesh Kumar, Patrick Crowley, Jonathan S. Turner:
Design of Randomized Multichannel Packet Storage for High Performance Routers. Hot Interconnects 2005: 100-106 - [c2]Sailesh Kumar, Jonathan S. Turner, Patrick Crowley:
Addressing Queuing Bottlenecks at High Speeds. Hot Interconnects 2005: 107-113 - 2002
- [c1]Raja Venkatesh, Sailesh Kumar, Joji Philip, Sunil Shukla:
A Fault Modeling Technique to Test Memory BIST Algorithms. MTDT 2002: 109-116
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:48 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: