default search action
Haibin Lu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2009
- [j13]Zhiyu Peng
, Xin Zhou, Linchuan Li, Xiangchun Yu, Hongjiang Li
Arabidopsis Hormone Database: a comprehensive genetic and phenotypic information database for plant hormone research in Arabidopsis. Nucleic Acids Res. 37(Database-Issue): 975-982 (2009) - [j12]Wenjun Zeng
Path-Diversity P2P Overlay Retransmission for Reliable IP-Multicast. IEEE Trans. Multim. 11(5): 960-971 (2009) - 2008
- [j11]Haibin Lu:
On a trie partitioning algorithm for power-efficient TCAMs. Int. J. Commun. Syst. 21(2): 115-133 (2008) - 2007
- [j10]Mian Pan, Haibin Lu:
Build shape-shifting tries for fast IP lookup in O(n) time. Comput. Commun. 30(18): 3787-3795 (2007) - [j9]Haibin Lu, Sartaj Sahni:
O(logW) multidimensional packet classification. IEEE/ACM Trans. Netw. 15(2): 462-472 (2007) - [c12]Yingnan Zhu, Wenjun Zeng
Exploiting Overlay Path-Diversity for Scalable Reliable Multicast. ICME 2007: 44-47 - [c11]Sartaj Sahni, Haibin Lu:
Dynamic Tree Bitmap for IP Lookup and Update. ICN 2007: 79 - 2006
- [c10]Haibin Lu, Mian Pan:
Partition Filter Set for Power-Efficient Packet Classification. GLOBECOM 2006 - [c9]Wenjun Zeng
Path-Diversity Overlay Retransmission Architecture for Reliable Multicast. ICME 2006: 1681-1684 - 2005
- [j8]Haibin Lu:
A Novel High-Order Tree for Secure Multicast Key Management. IEEE Trans. Computers 54(2): 214-224 (2005) - [j7]Haibin Lu, Kun Suk Kim, Sartaj K. Sahni:
Prefix and Interval-Partitioned Dynamic IP Router-Tables. IEEE Trans. Computers 54(5): 545-557 (2005) - [j6]Haibin Lu, Sartaj Sahni:
A B-Tree Dynamic Router-Table Design. IEEE Trans. Computers 54(7): 813-824 (2005) - [j5]Haibin Lu, Sartaj Sahni:
Conflict detection and resolution in two-dimensional prefix router tables. IEEE/ACM Trans. Netw. 13(6): 1353-1363 (2005) - 2004
- [j4]Haibin Lu, Sartaj Sahni:
O(log n) Dynamic Router-Tables for Prefixes and Ranges. IEEE Trans. Computers 53(10): 1217-1230 (2004) - [j3]Haibin Lu, Sartaj Sahni:
Enhanced Interval Trees for Dynamic IP Router-Tables. IEEE Trans. Computers 53(12): 1615-1628 (2004) - [c8]Haibin Lu, Kun Suk Kim, Sartaj Sahni:
Prefix- and interval-partitioned router-tables [IP routing]. GLOBECOM 2004: 1590-1594 - [c7]Haibin Lu, Sartaj K. Sahni:
A B-tree dynamic router-table design. ISCC 2004: 840-845 - [c6]Haibin Lu, Sartaj K. Sahni:
Dynamic IP router-tables using highest-priority matching. ISCC 2004: 858-863 - [c5]Haibin Lu, Junqiang Lan, Xinhua Zhuang:
Advanced pyramid broadcasting for video-on-demand. ISMSE 2004: 28-34 - [r1]Sartaj Sahni, Kun Suk Kim, Haibin Lu:
IP Router Tables. Handbook of Data Structures and Applications 2004 - 2003
- [j2]Sartaj Sahni, Kun Suk Kim, Haibin Lu:
Data Structures for One-Dimensional Packet Classification Using Most-Specific-Rule Matching. Int. J. Found. Comput. Sci. 14(3): 337-358 (2003) - [c4]Haibin Lu, Sartaj Sahni:
O(log n) Dynamic Router-Tables For Ranges. ISCC 2003: 91-96 - 2002
- [j1]Yu Jin Zhang, Haibin Lu:
A hierarchical organization scheme for video data. Pattern Recognit. 35(11): 2381-2387 (2002) - [c3]Sartaj Sahni, Kun Suk Kim, Haibin Lu:
Data Structures For One-Dimensional Packet Classification Using Most-Specific-Rule Matching. ISPAN 2002: 3-
1990 – 1999
- 1999
- [c2]Haibin Lu, Y. J. Zhang, Y. R. Yao:
Robust Gradual Scene Change Detection. ICIP (3) 1999: 304-308 - [c1]Haibin Lu, Yu Jin Zhang:
Detecting Abrupt Scene Change Using Neural Network. VISUAL 1999: 291-298
Coauthor Index
aka: Sartaj K. Sahni
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-10-31 20:15 CET 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: