default search action
Yijie Han
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i4]Sairam Chaganti, Yijie Han:
Point Location in Constant Time. CoRR abs/2401.02440 (2024) - 2023
- [i3]Yijie Han, Sanjeev Saxena:
Storage in Computational Geometry. CoRR abs/2302.11821 (2023) - 2022
- [j39]Yijie Han
, Xin He:
More Efficient Parallel Integer Sorting. Int. J. Found. Comput. Sci. 33(5): 411-427 (2022) - [j38]Xin He
On Petrie cycle and Petrie tour partitions of 3- and 4-regular plane graphs. Math. Struct. Comput. Sci. 32(2): 240-256 (2022) - [c55]Junyi He
An Indoor Positioning Approach based on Vision and INS. ICNCC 2022: 135-140 - 2020
- [j37]Yijie Han:
Sorting Real Numbers in $O\big (n\sqrt{\log n}\big )$ Time and Linear Space. Algorithmica 82(4): 966-978 (2020) - [j36]Yijie Han:
Correction to: Sorting Real Numbers in $O(n\sqrt{\log n})$ Time and Linear Space. Algorithmica 82(4): 979 (2020) - [i2]Yijie Han:
Uniform Linked Lists Contraction. CoRR abs/2002.05034 (2020)
2010 – 2019
- 2019
- [c54]Yijie Han, Mishra Sneha, Md Usman Gani Syed:
An NC Algorithm for Sorting Real Numbers in O(nlogn/√loglogn) Operations. CATA 2019: 93-98 - 2018
- [j35]Yijie Han, Sanjeev Saxena:
Algorithms for testing occurrences of length 4 patterns in permutations. J. Comb. Optim. 35(1): 189-208 (2018) - [c53]Hemasree Koganti, Yijie Han:
Searching in a Sorted Linked List. ICIT 2018: 120-125 - [i1]Yijie Han:
Sorting Real Numbers in O(n√(log n)) Time and Linear Space. CoRR abs/1801.00776 (2018) - 2017
- [j34]Yijie Han
Construct a perfect word hash function in time independent of the size of integers. Inf. Process. Lett. 128: 5-10 (2017) - 2016
- [j33]Yijie Han
An O(n3loglogn/log2n) time algorithm for all pairs shortest paths. J. Discrete Algorithms 38-41: 9-19 (2016) - 2015
- [c52]Yijie Han:
A Linear Time Algorithm for Ordered Partition. FAW 2015: 89-103 - 2014
- [c51]Yijie Han, Sanjeev Saxena:
Parallel Algorithms for Testing Length Four Permutations. PAAP 2014: 81-86 - 2013
- [j32]Yijie Han:
Erratum to: Tight bound for matching. J. Comb. Optim. 26(2): 412-414 (2013) - [c50]Yijie Han, Sanjeev Saxena:
Algorithms for Testing Length Four Permutations. FAW-AAIM 2013: 17-23 - 2012
- [j31]Yijie Han:
Tight bound for matching. J. Comb. Optim. 23(3): 322-330 (2012) - [c49]Yijie Han, Xin He:
More Efficient Parallel Integer Sorting. FAW-AAIM 2012: 279-290 - [c48]Yijie Han, Tadao Takaoka:
An O(n 3 loglogn/log2 n) Time Algorithm for All Pairs Shortest Paths. SWAT 2012: 131-141 - 2010
- [j30]Yijie Han, Sanjeev Saxena, Xiaojun Shen:
An efficient parallel algorithm for building the separating tree. J. Parallel Distributed Comput. 70(6): 625-629 (2010)
2000 – 2009
- 2009
- [c47]Yijie Han:
Tight Bound for Matching. FCS 2009: 68-74 - [c46]Joel Lopes, Yijie Han:
Modified Granular Index Scheme for XML Database. IKE 2009: 200-203 - 2008
- [j29]Yijie Han:
An O ( n 3(log log n /log n )5/4) Time Algorithm for All Pairs Shortest Path. Algorithmica 51(4): 428-434 (2008) - [j28]Yijie Han:
A note of an O(n3/logn) time algorithm for all pairs shortest paths. Inf. Process. Lett. 105(3): 114-116 (2008) - [c45]Srikanth Rokkam, Yijie Han:
Data Warehousing: A Functional Overview. DMIN 2008: 362-369 - [c44]Yijie Han:
Matching for Graphs of Bounded Degree. FAW 2008: 171-173 - 2007
- [j27]Yijie Han:
Optimal parallel selection. ACM Trans. Algorithms 3(4): 38 (2007) - [j26]Richard J. La, Yijie Han:
Distribution of path durations in mobile ad hoc networks and path selection. IEEE/ACM Trans. Netw. 15(5): 993-1006 (2007) - [c43]Yijie Han:
Computing Lowest Common Ancestors in Directed Acyclic Graphs. CATA 2007: 36-37 - [c42]Yijie Han:
Maximum Flow with a Faster Way of Computing a Blocking Flow. FCS 2007: 52-56 - [c41]Hafeez Razzaq, Muhammad Fareed Arif, Yijie Han:
Mobile Agent Peer Discovery and Information Protocol, an Advance Peer Discovery Technique in P2P Networks. International Conference on Internet Computing 2007: 234-240 - [c40]Abhinay Bodapunti, Yijie Han:
TCP over Satellite, Its Evolution and Variants. ICWN 2007: 3-11 - [c39]Zhichuan Li, Yijie Han:
Modeling Organization Structures In UML. Software Engineering Research and Practice 2007: 177-182 - [c38]Nivesh Gopathi, Yijie Han:
Design of Software Systems using Web Services - An Overview and Extension. Software Engineering Research and Practice 2007: 217-223 - [c37]Muhammad Fareed Arif, Hafeez Razzaq, Yijie Han:
Multi-Agent Teacher Assistant, A Case Study Intended for Multi-Agent Applications. Software Engineering Research and Practice 2007: 501-510 - [r1]Yijie Han:
Parallel Algorithms for Maximal Independent Set and Maximal Matching. Handbook of Parallel Computing 2007 - 2006
- [j25]Yijie Han, Richard J. La, Armand M. Makowski, Seungjoon Lee:
Distribution of path durations in mobile ad-hoc networks - Palm's Theorem to the rescue. Comput. Networks 50(12): 1887-1900 (2006) - [j24]Yijie Han:
Improved algorithm for the symmetry number problem on trees. Inf. Process. Lett. 98(4): 130-132 (2006) - [c36]Yijie Han:
Improving the Efficiency of Sorting by Reversals. BIOCOMP 2006: 406-409 - [c35]Yijie Han:
Achieving O(n3/log n) Time for All Pairs Shortest Paths by Using a Smaller Table. CATA 2006: 36-37 - [c34]Yijie Han:
Improved Algorithm for the Symmetry Number Problem on Trees. CATA 2006: 38-40 - [c33]Yijie Han, Richard J. La:
Maximizing Path Durations in Mobile Ad-Hoc Networks. CISS 2006: 26-31 - [c32]Yijie Han:
An O(n3 (loglogn/logn)5/4) Time Algorithm for All Pairs Shortest Paths. ESA 2006: 411-417 - [c31]Yijie Han, Richard J. La, Hongqiang Zhang:
Path Selection in Mobile Ad-Hoc Networks and Distribution of Path Duration. INFOCOM 2006 - [c30]Yijie Han, Armand M. Makowski:
Resequencing Delays Under Multipath Routing - Asymptotics in a Simple Queueing Model. INFOCOM 2006 - [c29]Yijie Han:
An Efficient Parallel Algorithm for Building the Separating Tree. PDPTA 2006: 369-373 - 2005
- [c28]Sujaa Rani Mohan, E. K. Park, Yijie Han:
Association Rule-Based Data Mining Agents for Personalized Web Caching. COMPSAC (2) 2005: 37-38 - 2004
- [j23]Yijie Han:
Improved algorithm for all pairs shortest paths. Inf. Process. Lett. 91(5): 245-250 (2004) - [j22]Yijie Han:
Deterministic sorting in O(nloglogn) time and linear space. J. Algorithms 50(1): 96-105 (2004) - [c27]Yijie Han, Richard J. La, Tianmin Ren:
Asymptotic behavior of earliest-deadline-first scheduling with a large number of flows. CDC 2004: 3295-3300 - 2003
- [j21]Ka Wong Chong, Yijie Han, Yoshihide Igarashi, Tak Wah Lam
Improving the efficiency of parallel minimum spanning tree algorithms. Discret. Appl. Math. 126(1): 33-54 (2003) - [j20]Hong Shen, Yijie Han, Yi Pan, David J. Evans:
Optimal Parallel Algorithms for Multiselection on Mesh-Connected Computers. Int. J. Comput. Math. 80(2): 165-179 (2003) - [c26]Yijie Han:
Optimal parallel selection. SODA 2003: 1-9 - 2002
- [j19]Yijie Han, Xiaojun Shen:
Parallel Integer Sorting Is More Efficient Than Parallel Comparison Sorting on Exclusive Write PRAMs. SIAM J. Comput. 31(6): 1852-1878 (2002) - [j18]Yijie Han, Yi Pan, Hong Shen:
Sublogarithmic Deterministic Selection on Arrays with a Reconfigurable Optical Bus. IEEE Trans. Computers 51(6): 702-707 (2002) - [c25]Yijie Han, Mikkel Thorup:
Integer Sorting in 0(n sqrt (log log n)) Expected Time and Linear Space. FOCS 2002: 135-144 - [c24]Yijie Han:
Deterministic sorting in O(nlog log n) time and linear space. STOC 2002: 602-608 - 2001
- [j17]Yijie Han, Weifa Liang
Very fast parallel algorithms for approximate edge coloring. Discret. Appl. Math. 108(3): 227-238 (2001) - [j16]Yijie Han:
Improved Fast Integer Sorting in Linear Space. Inf. Comput. 170(1): 81-94 (2001) - [j15]Ka Wong Chong, Yijie Han, Tak Wah Lam
Concurrent threads and optimal parallel minimum spanning trees algorithm. J. ACM 48(2): 297-323 (2001) - [c23]Kyoosang Cho, Yijie Han, Yugyung Lee, E. K. Park:
Dynamic and Hierarchical Spatial Access Method using Integer Searching. CIKM 2001: 341-348 - [c22]Yijie Han:
Improved fast integer sorting in linear space. SODA 2001: 793-796 - 2000
- [c21]Yijie Han:
Fast Integer Sorting in Linear Space. STACS 2000: 242-253
1990 – 1999
- 1999
- [j14]Yijie Han, Yoshihide Igarashi:
Parallel PROFIT/COST Algorithms Through Fast Derandomization. Acta Informatica 36(3): 215-232 (1999) - [c20]Ka Wong Chong, Yijie Han, Yoshihide Igarashi, Tak Wah Lam
Improving Parallel Computation with Fast Integer Sorting. COCOON 1999: 452-461 - [c19]Ka Wong Chong, Yijie Han, Tak Wah Lam:
On the Parallel Time Complexity of Undirected Connectivity and Minimum Spanning Trees. SODA 1999: 225-234 - [c18]Yijie Han, Xiaojun Shen:
Parallel Integer Sorting is More Efficient than Parallel Comparison Sorting on Exclusive Write PRAMs. SODA 1999: 419-428 - 1997
- [j13]Yijie Han, Victor Y. Pan, John H. Reif:
Efficient Parallel Algorithms for Computing All Pair Shortest Paths in Directed Graphs. Algorithmica 17(4): 399-415 (1997) - 1996
- [j12]Jindong Chen, Yijie Han:
Shortest paths on a polyhedron. Int. J. Comput. Geom. Appl. 6(2): 127-144 (1996) - [j11]Yijie Han:
A Fast Derandomization Scheme and Its Applications. SIAM J. Comput. 25(1): 52-82 (1996) - 1995
- [j10]Yijie Han:
An Improvement on Parallel Computation of a Maximal Matching. Inf. Process. Lett. 56(6): 343-348 (1995) - [c17]Yijie Han, Xiaojun Shen:
Conservative Algorithms for Parallel and Sequential Integer Sorting. COCOON 1995: 324-333 - 1994
- [j9]Yijie Han, Yoshihide Igarashi, Kumiko Kanai, Kinya Miura:
Broadcasting in Faulty Binary Jumping Networks. J. Parallel Distributed Comput. 23(3): 462-467 (1994) - 1993
- [c16]Yijie Han, Yoshihide Igarashi:
Efficient Parallel Shortest Path Algorithms for Banded Matrices. ICPP (3) 1993: 223-226 - 1992
- [j8]Yijie Han, Yoshihide Igarashi, Miroslaw Truszczynski:
Indexing functions and time lower bounds for sorting on a mesh-connected computer. Discret. Appl. Math. 36(2): 141-152 (1992) - [j7]Yijie Han, Bhagirath Narahari, Hyeong-Ah Choi:
Mapping a Chain Task to Chained Processors. Inf. Process. Lett. 44(3): 141-148 (1992) - [c15]Yijie Han, Yoshihide Igarashi, Kumiko Kanai, Kinya Miura:
Fault-Tolerant Broadcasting in Binary Jumping Networks. ISAAC 1992: 145-154 - [c14]Yijie Han, Victor Y. Pan, John H. Reif:
Efficient Parallel Algorithms for Computing all Pair Shortest Paths in Directed Graphs. SPAA 1992: 353-362 - 1991
- [j6]Yijie Han:
An Optimal Linked List Prefix Algorithm on a Local Memory Computer. IEEE Trans. Computers 40(10): 1149-1153 (1991) - [c13]Jindong Chen, Yijie Han:
Storing Shortest Paths for a Polyhedron. ICCI 1991: 169-180 - [c12]Yijie Han:
A Parallel Algorithm for the PROFIT/COST Problem. ICPP (3) 1991: 107-114 - [c11]Yijie Han:
A Fast Derandomization Schemes and Its Applications. WADS 1991: 177-188 - 1990
- [j5]Yijie Han, Yoshihide Igarashi:
Time Lower Bounds for Sorting on Multi-Dimensional Mesh-Connected Processor Arrays. Inf. Process. Lett. 33(5): 233-238 (1990) - [j4]Yijie Han, Robert A. Wagner:
An Efficient and Fast Parallel-Connected Component Algorithm. J. ACM 37(3): 626-642 (1990) - [c10]Jindong Chen, Yijie Han:
Shortest Paths on a Polyhedron. SCG 1990: 360-369 - [c9]Yijie Han:
Parallel Algorithms for Linked List and Beyond. SIGAL International Symposium on Algorithms 1990: 86-100 - [c8]Yijie Han, Yoshihide Igarashi:
Derandomization by Exploiting Redundancy and Mutual Independence. SIGAL International Symposium on Algorithms 1990: 328-337
1980 – 1989
- 1989
- [j3]Yijie Han, Yoshihide Igarashi:
Time Lower Bounds for Parallel Sorting on a Mesh-Conected Processor Array. Acta Informatica 26(7): 643-655 (1989) - [j2]Yijie Han:
Parallel Algorithms for Computing Linked List Prefix. J. Parallel Distributed Comput. 6(3): 537-557 (1989) - [c7]Yijie Han:
An Optimal Linked List Prefix Algorithms on a Local Memory Computer. ACM Conference on Computer Science 1989: 278-286 - [c6]Yijie Han:
Matching Partition a Linked List and Its Optimization. SPAA 1989: 246-253 - 1988
- [c5]Yijie Han, Yoshihide Igarashi:
Time Lower Bounds for Parallel Sorting on a Mesh-Connected Processor Array. AWOC 1988: 434-443 - [c4]Yijie Han, Raphael A. Finkel:
An Optimal Scheme for Disseminating Information. ICPP (2) 1988: 198-203 - 1987
- [j1]Louis D. Duval, Robert A. Wagner, Yijie Han, Donald W. Loveland:
Finding Test-and-Treatment Procedures Using Parallel Computation. J. Parallel Distributed Comput. 4(3): 309-318 (1987) - 1986
- [c3]Louis D. Duval, Yijie Han, Robert A. Wagner, Donald W. Loveland:
Finding Test-and-Treatment Procedures Using Parallel Computation. ICPP 1986: 688-690 - [c2]Yijie Han, Robert A. Wagner:
: Parallel Algorithms for Bucket Sorting and the Data Dependent Prefix Problem. ICPP 1986: 924-930 - 1985
- [c1]Yijie Han:
A Family of Parallel Sorting Algorithms. ICPP 1985: 851-853
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:51 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: