dblp.uni-trier.dewww.uni-trier.de

Yanjun Zhang Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

*2009
24EEJianbo Su, Yanjun Zhang: Integration of a plug-and-play desktop robotic system. Robotica 27(3): 403-409 (2009)
2007
23EEZhixiong Zhou, Hu He, Yanjun Zhang, Yihe Sun, Adriel Cheng: A 2-Dimension Force-Directed Scheduling Algorithm for Register-File-Connectivity Clustered VLIW Architecture. ASAP 2007: 371-376
22EEZhibin Zhang, Yanjun Zhang, Li Guo, Binxing Fang: LASF: A Flow Scheduling Policy in Stateful Packet Inspection Systems. ISCC 2007: 87-93
21EEYang Xu, Hu He, Zhou Zhixiong, Yanjun Zhang, Yihe Sun: Heuristic on a Novel Power Management System Cooperating with Compiler. J. Low Power Electronics 3(1): 22-27 (2007)
2006
20EEZheng Shen, Hu He, Yanjun Zhang, Yihe Sun: VS-ISA: A Video Specific Instruction Set Architecture for ASIP Design. IIH-MSP 2006: 587-592
19EEDawn N. Jutla, Peter Bodorik, Yanjun Zhang: PeCAN: An architecture for users' privacy-aware electronic commerce contexts on the semantic web. Inf. Syst. 31(4-5): 295-320 (2006)
2005
18EEYanjun Zhang, Hu He, Yihe Sun: A new register file access architecture for software pipelining in VLIW processors. ASP-DAC 2005: 627-630
17EEDawn N. Jutla, Yanjun Zhang: Maturing e-Privacy with P3P and Context Agents. EEE 2005: 536-541
2004
16EEYanjun Zhang, Xiaoyun Teng, Hongyi Yu, Hanying Hu: The Energy Cost Model of Clustering Wireless Sensor Network Architecture. ICESS 2004: 374-380
1999
15EEYanjun Zhang, A. Ortynski: Efficiency of Randomized Parallel Backtrack Search Algorithmica 24(1): 14-28 (1999)
14EES. Q. Zheng, Balaji Calidas, Yanjun Zhang: An Efficient General In-Place Parallel Sorting Scheme. The Journal of Supercomputing 14(1): 5-17 (1999)
1998
13 Yanjun Zhang: The Variance of Two Game Tree Algorithms. J. Algorithms 28(1): 21-39 (1998)
1997
12 Yanjun Zhang: The Variance of Two Game Tree Algorithms. SODA 1997: 268-277
1996
11EES. Q. Zheng, Balaji Calidas, Yanjun Zhang: Efficient in-place sorting algorithms using feasible parallel machine models. ISPAN 1996: 15-21
1995
10 Richard M. Karp, Yanjun Zhang: Bounded Branching Process AND/OR Tree Evaluation. Random Struct. Algorithms 7(2): 97-116 (1995)
9 Yanjun Zhang: On the Optimality of Randomized alpha-beta Search. SIAM J. Comput. 24(1): 138-147 (1995)
1993
8EERichard M. Karp, Yanjun Zhang: Randomized Parallel Algorithms for Backtrack Search and Branch-and-Bound Computation. J. ACM 40(3): 765-789 (1993)
7 Kenneth R. Vollmar, Yanjun Zhang: On the Enumeration of Steiner-Tree Topologies for the Points on a Circle. SIAM J. Discrete Math. 6(2): 329-333 (1993)
1992
6 Ding-Zhu Du, Yanjun Zhang: On better heuristics for Steiner minimum trees. Math. Program. 57: 193-202 (1992)
1991
5 Ding-Zhu Du, Yanjun Zhang, Qing Feng: On Better Heuristic for Euclidean Steiner Minimum Trees (Extended Abstract) FOCS 1991: 431-439
1990
4 Ding-Zhu Du, Yanjun Zhang: On Heuristics for Minimum Length Rectilinear Partitions. Algorithmica 5(1): 111-128 (1990)
1989
3EERichard M. Karp, Yanjun Zhang: On Parallel Evaluation of Game Trees. SPAA 1989: 409-420
1988
2 Richard M. Karp, Yanjun Zhang: A Randomized Parallel Branch-and-Bound Procedure STOC 1988: 290-300
1987
1 Ding-Zhu Du, Frank K. Hwang, Andrew M. Odlyzko, Yanjun Zhang: Minimal-Distance Routing for Kykios II. ICPP 1987: 546-549

Coauthor Index

1Peter Bodorik [19]
2Balaji Calidas [11] [14]
3Adriel Cheng [23]
4Ding-Zhu Du [1] [4] [5] [6]
5Binxing Fang [22]
6Qing Feng [5]
7Li Guo [22]
8Hu He [18] [20] [21] [23]
9Hanying Hu [16]
10Frank K. Hwang (Frank Kwang-Ming Hwang) [1]
11Dawn N. Jutla [17] [19]
12Richard M. Karp [2] [3] [8] [10]
13Andrew M. Odlyzko [1]
14A. Ortynski [15]
15Zheng Shen [20]
16Jianbo Su [24]
17Yihe Sun [18] [20] [21] [23]
18Xiaoyun Teng [16]
19Kenneth R. Vollmar [7]
20Yang Xu [21]
21Hongyi Yu [16]
22Zhibin Zhang [22]
23Si-Qing Zheng (S. Q. Zheng) [11] [14]
24Zhou Zhixiong [21]
25Zhixiong Zhou [23]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)