| 2007 |
| 20 | EE | S. Kami Makki,
Seema Jani,
Xiaohua Jia,
Wuxu Peng:
Preference-Function Algorithm: a novel approach for selection of the users' preferred websites.
IJBIDM 2(3): 328-346 (2007) |
| 19 | EE | Wuxu Peng,
Yalin Wang,
E. K. Park,
Kia Makki:
Dynamic key management for secure routing in MANET.
Wireless Communications and Mobile Computing 7(10): 1233-1241 (2007) |
| 2006 |
| 18 | EE | Wuxu Peng,
Shamila Makki:
The CSMA/DM LAN protocol.
Int. J. Communication Systems 19(8): 897-914 (2006) |
| 2004 |
| 17 | | Wuxu Peng,
Yalin Wang,
Kia Makki:
Dynamic Key Management for Secure Routing In LCMRMG.
ICCCN 2004: 227-232 |
| 16 | EE | Wuxu Peng,
Kia Makki:
Lossy Communicating Finite State Machines.
Telecommunication Systems 25(3-4): 433-448 (2004) |
| 1998 |
| 15 | EE | James Holt,
Wuxu Peng:
Improving the PIM Routing Protocol with Adaptive Switching Mechanism between Its Two Sparse Sub-Modes.
ICCCN 1998: 768-773 |
| 1997 |
| 14 | EE | James Holt,
Wuxu Peng:
An Innovative Routing Protocol Evaluation Tool.
ICCCN 1997: 524- |
| 13 | | John Dell,
Kia Makki,
Niki Pissinou,
Wuxu Peng:
Using Logical Rings to solve the Mutual Exclusion Problem in Distributed Memory Systems.
PDPTA 1997: 1229-1238 |
| 12 | EE | Wuxu Peng,
Kia Makki:
A modular methodology to verify communication protocols.
Computer Communications 20(12): 1069-1077 (1997) |
| 11 | | Wuxu Peng:
Deadlock Detection in Communicating Finite State Machines by Even Reachability Analysis.
MONET 2(3): 251-257 (1997) |
| 1996 |
| 10 | EE | Wuxu Peng,
Kia Makki:
Reachability and reverse reachability analysis of CFSMs.
Computer Communications 19(8): 668-674 (1996) |
| 9 | | Wuxu Peng,
Kia Makki:
Petri Nets and Self-Stabilization of Communication Protocols.
Informatica (Slovenia) 20(1): (1996) |
| 1995 |
| 8 | | Wuxu Peng,
Kia Makki:
On Reachability Analysis of Communicating Finite State Machines.
ICCCN 1995: 58 |
| 7 | EE | Wuxu Peng:
Deadlock Detection in Communicating Finite State Machines by Even Reachability Analysis.
ICCCN 1995: 656 |
| 6 | | Wuxu Peng,
S. Purushothaman Iyer:
A New Typee of Pushdown Automata on Infinite Trees.
Int. J. Found. Comput. Sci. 6(2): 169-186 (1995) |
| 1992 |
| 5 | | Wuxu Peng,
S. Purushothaman:
Empty Stack Pushdown Omega-Tree Automata.
CAAP 1992: 248-264 |
| 4 | | Wuxu Peng,
S. Purushothaman:
Analysis of a Class of Communicating Finite State Machines.
Acta Inf. 29(6/7): 499-522 (1992) |
| 1991 |
| 3 | EE | Wuxu Peng,
S. Purushothaman:
Data Flow Analysis of Communicating Finite State Machines.
ACM Trans. Program. Lang. Syst. 13(3): 399-442 (1991) |
| 1990 |
| 2 | | Wuxu Peng,
S. Purushothaman:
A Unified Approach to the Deadlock Detection Problem in Networks of Communicating Finite State Machines.
CAV 1990: 243-252 |
| 1989 |
| 1 | | Wuxu Peng,
S. Purushothaman:
Towards Dataflow Analysis of Communicating Finite State Machines.
PODC 1989: 45-58 |