DBLP: Yijie Han

	2012
j31		Yijie Han: Tight bound for matching. J. Comb. Optim. 23(3): 322-330 (2012)
c47		Yijie Han, Xin He: More Efficient Parallel Integer Sorting. FAW-AAIM 2012: 279-290
c46		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 Distrib. Comput. 70(6): 625-629 (2010)
	2009
c45		Yijie Han: Tight Bound for Matching. FCS 2009: 68-74
c44		Joel Lopes, Yijie Han: Modified Granular Index Scheme for XML Database. IKE 2009: 200-203
	2008
j29		Yijie Han: An O ( n ³(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(n³/logn) time algorithm for all pairs shortest paths. Inf. Process. Lett. 105(3): 114-116 (2008)
c43		Srikanth Rokkam, Yijie Han: Data Warehousing: A Functional Overview. DMIN 2008: 362-369
c42		Yijie Han: Matching for Graphs of Bounded Degree. FAW 2008: 171-173
	2007
j27		Yijie Han: Optimal parallel selection. ACM Transactions on Algorithms 3(4) (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)
c41		Yijie Han: Computing Lowest Common Ancestors in Directed Acyclic Graphs. Computers and Their Applications 2007: 36-37
c40		Yijie Han: Maximum Flow with a Faster Way of Computing a Blocking Flow. FCS 2007: 52-56
c39		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
c38		Abhinay Bodapunti, Yijie Han: TCP over Satellite, Its Evolution and Variants. ICWN 2007: 3-11
c37		Zhichuan Li, Yijie Han: Modeling Organization Structures In UML. Software Engineering Research and Practice 2007: 177-182
c36		Nivesh Gopathi, Yijie Han: Design of Software Systems using Web Services - An Overview and Extension. Software Engineering Research and Practice 2007: 217-223
c35		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
	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. Computer 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)
c34		Yijie Han: Improving the Efficiency of Sorting by Reversals. BIOCOMP 2006: 406-409
c33		Yijie Han: Achieving O(n³/log n) Time for All Pairs Shortest Paths by Using a Smaller Table. Computers and Their Applications 2006: 36-37
c32		Yijie Han: Improved Algorithm for the Symmetry Number Problem on Trees. Computers and Their Applications 2006: 38-40
c31		Yijie Han: An O(n³ (loglogn/logn)^5/4) Time Algorithm for All Pairs Shortest Paths. ESA 2006: 411-417
c30		Yijie Han, Richard J. La, Hongqiang Zhang: Path Selection in Mobile Ad-Hoc Networks and Distribution of Path Duration. INFOCOM 2006
c29		Yijie Han, Armand M. Makowski: Resequencing Delays Under Multipath Routing - Asymptotics in a Simple Queueing Model. INFOCOM 2006
c28		Yijie Han: An Efficient Parallel Algorithm for Building the Separating Tree. PDPTA 2006: 369-373
	2005
c27		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)
	2003
j21		Ka Wong Chong, Yijie Han, Yoshihide Igarashi, Tak Wah Lam: Improving the efficiency of parallel minimum spanning tree algorithms. Discrete Applied Mathematics 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, Xiaojun Shen: Very fast parallel algorithms for approximate edge coloring. Discrete Applied Mathematics 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
	1999
j14		Yijie Han, Yoshihide Igarashi: Parallel PROFIT/COST Algorithms Through Fast Derandomization. Acta Inf. 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. Geometry 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 Distrib. Comput. 23(3): 462-467 (1994)
	1993
c16		Yijie Han, Yoshihide Igarashi: Efficient Parallel Shortest Path Algorithms for Banded Matrices. ICPP 1993: 223-226
	1992
j8		Yijie Han, Yoshihide Igarashi, Miroslaw Truszczynski: Indexing functions and time lower bounds for sorting on a mesh-connected computer. Discrete Applied Mathematics 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. Symposium on Computational Geometry 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
	1989
j3		Yijie Han, Yoshihide Igarashi: Time Lower Bounds for Parallel Sorting on a Mesh-Conected Processor Array. Acta Inf. 26(7): 643-655 (1989)
j2		Yijie Han: Parallel Algorithms for Computing Linked List Prefix. J. Parallel Distrib. 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 Distrib. Comput. 4(3): 309-318 (1987)
	1986
c3		Luis 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

2012

j31

Yijie Han: Tight bound for matching. J. Comb. Optim. 23(3): 322-330 (2012)

c47

Yijie Han, Xin He: More Efficient Parallel Integer Sorting. FAW-AAIM 2012: 279-290

c46

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 Distrib. Comput. 70(6): 625-629 (2010)

2009

c45

Yijie Han: Tight Bound for Matching. FCS 2009: 68-74

c44

Joel Lopes, Yijie Han: Modified Granular Index Scheme for XML Database. IKE 2009: 200-203

2008

j29

Yijie Han: An O ( n ³(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(n³/logn) time algorithm for all pairs shortest paths. Inf. Process. Lett. 105(3): 114-116 (2008)

c43

Srikanth Rokkam, Yijie Han: Data Warehousing: A Functional Overview. DMIN 2008: 362-369

c42

Yijie Han: Matching for Graphs of Bounded Degree. FAW 2008: 171-173

2007

j27

Yijie Han: Optimal parallel selection. ACM Transactions on Algorithms 3(4) (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)

c41

Yijie Han: Computing Lowest Common Ancestors in Directed Acyclic Graphs. Computers and Their Applications 2007: 36-37

c40

Yijie Han: Maximum Flow with a Faster Way of Computing a Blocking Flow. FCS 2007: 52-56

c39

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

c38

Abhinay Bodapunti, Yijie Han: TCP over Satellite, Its Evolution and Variants. ICWN 2007: 3-11

c37

Zhichuan Li, Yijie Han: Modeling Organization Structures In UML. Software Engineering Research and Practice 2007: 177-182

c36

Nivesh Gopathi, Yijie Han: Design of Software Systems using Web Services - An Overview and Extension. Software Engineering Research and Practice 2007: 217-223

c35

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

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. Computer 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)

c34

Yijie Han: Improving the Efficiency of Sorting by Reversals. BIOCOMP 2006: 406-409

c33

Yijie Han: Achieving O(n³/log n) Time for All Pairs Shortest Paths by Using a Smaller Table. Computers and Their Applications 2006: 36-37

c32

Yijie Han: Improved Algorithm for the Symmetry Number Problem on Trees. Computers and Their Applications 2006: 38-40

c31

Yijie Han: An O(n³ (loglogn/logn)^5/4) Time Algorithm for All Pairs Shortest Paths. ESA 2006: 411-417

c30

Yijie Han, Richard J. La, Hongqiang Zhang: Path Selection in Mobile Ad-Hoc Networks and Distribution of Path Duration. INFOCOM 2006

c29

Yijie Han, Armand M. Makowski: Resequencing Delays Under Multipath Routing - Asymptotics in a Simple Queueing Model. INFOCOM 2006

c28

Yijie Han: An Efficient Parallel Algorithm for Building the Separating Tree. PDPTA 2006: 369-373

2005

c27

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)

2003

j21

Ka Wong Chong, Yijie Han, Yoshihide Igarashi, Tak Wah Lam: Improving the efficiency of parallel minimum spanning tree algorithms. Discrete Applied Mathematics 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, Xiaojun Shen: Very fast parallel algorithms for approximate edge coloring. Discrete Applied Mathematics 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

1999

j14

Yijie Han, Yoshihide Igarashi: Parallel PROFIT/COST Algorithms Through Fast Derandomization. Acta Inf. 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. Geometry 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

Yijie Han, Yoshihide Igarashi, Kumiko Kanai, Kinya Miura: Broadcasting in Faulty Binary Jumping Networks. J. Parallel Distrib. Comput. 23(3): 462-467 (1994)

1993

c16

Yijie Han, Yoshihide Igarashi: Efficient Parallel Shortest Path Algorithms for Banded Matrices. ICPP 1993: 223-226

1992

Yijie Han, Yoshihide Igarashi, Miroslaw Truszczynski: Indexing functions and time lower bounds for sorting on a mesh-connected computer. Discrete Applied Mathematics 36(2): 141-152 (1992)

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

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

Yijie Han, Yoshihide Igarashi: Time Lower Bounds for Sorting on Multi-Dimensional Mesh-Connected Processor Arrays. Inf. Process. Lett. 33(5): 233-238 (1990)

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. Symposium on Computational Geometry 1990: 360-369

Yijie Han: Parallel Algorithms for Linked List and Beyond. SIGAL International Symposium on Algorithms 1990: 86-100

Yijie Han, Yoshihide Igarashi: Derandomization by Exploiting Redundancy and Mutual Independence. SIGAL International Symposium on Algorithms 1990: 328-337

1989

Yijie Han, Yoshihide Igarashi: Time Lower Bounds for Parallel Sorting on a Mesh-Conected Processor Array. Acta Inf. 26(7): 643-655 (1989)

Yijie Han: Parallel Algorithms for Computing Linked List Prefix. J. Parallel Distrib. Comput. 6(3): 537-557 (1989)

Yijie Han: An Optimal Linked List Prefix Algorithms on a Local Memory Computer. ACM Conference on Computer Science 1989: 278-286

Yijie Han: Matching Partition a Linked List and Its Optimization. SPAA 1989: 246-253

1988

Yijie Han, Yoshihide Igarashi: Time Lower Bounds for Parallel Sorting on a Mesh-Connected Processor Array. AWOC 1988: 434-443

Yijie Han, Raphael A. Finkel: An Optimal Scheme for Disseminating Information. ICPP (2) 1988: 198-203

1987

Louis D. Duval, Robert A. Wagner, Yijie Han, Donald W. Loveland: Finding Test-and-Treatment Procedures Using Parallel Computation. J. Parallel Distrib. Comput. 4(3): 309-318 (1987)

1986

Luis D. Duval, Yijie Han, Robert A. Wagner, Donald W. Loveland: Finding Test-and-Treatment Procedures Using Parallel Computation. ICPP 1986: 688-690

Yijie Han, Robert A. Wagner: : Parallel Algorithms for Bucket Sorting and the Data Dependent Prefix Problem. ICPP 1986: 924-930

1985

Yijie Han: A Family of Parallel Sorting Algorithms. ICPP 1985: 851-853

1	Muhammad Fareed Arif	[c39] [c35]
2	Abhinay Bodapunti	[c38]
3	Jindong Chen	[j12] [c13] [c10]
4	Kyoosang Cho	[c23]
5	Hyeong-Ah Choi	[j7]
6	Ka Wong Chong	[j21] [j15] [c20] [c19]
7	Louis D. Duval	[j1]
8	Luis D. Duval	[c3]
9	David J. Evans	[j20]
10	Raphael A. Finkel	[c4]
11	Nivesh Gopathi	[c36]
12	Xin He	[c47]
13	Yoshihide Igarashi	[j21] [j14] [c20] [j9] [c16] [j8] [c15] [j5] [c8] [j3] [c5]
14	Kumiko Kanai	[j9] [c15]
15	Richard J. La	[j26] [j25] [c30]
16	Tak Wah Lam	[j21] [j15] [c20] [c19]
17	Seungjoon Lee	[j25]
18	Yugyung Lee	[c23]
19	Zhichuan Li	[c37]
20	Weifa Liang	[j17]
21	Joel Lopes	[c44]
22	Donald W. Loveland	[j1] [c3]
23	Armand M. Makowski	[j25] [c29]
24	Kinya Miura	[j9] [c15]
25	Sujaa Rani Mohan	[c27]
26	Bhagirath Narahari	[j7]
27	Victor Y. Pan	[j13] [c14]
28	Yi Pan	[j20] [j18]
29	E. K. Park (Eun Kyo Park)	[c27] [c23]
30	Hafeez Razzaq	[c39] [c35]
31	John H. Reif	[j13] [c14]
32	Srikanth Rokkam	[c43]
33	Sanjeev Saxena	[j30]
34	Hong Shen	[j20] [j18]
35	Xiaojun Shen	[j30] [j19] [j17] [c18] [c17]
36	Tadao Takaoka	[c46]
37	Mikkel Thorup	[c25]
38	Miroslaw Truszczynski	[j8]
39	Robert A. Wagner	[j4] [j1] [c3] [c2]
40	Hongqiang Zhang	[c30]

Yijie Han

Coauthor Index