Henry N. Adorna

List of publications from the DBLP Bibliography Server - FAQ

Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2002

2 EE Henry N. Adorna: On the Separation between k-Party and (k-1)-Party Nondeterministic Message Complexities. Developments in Language Theory 2002: 152-161

1 Henry N. Adorna: 3-Party Message Complexity is Better than 2-Party Ones for Proving Lower Bounds on the Size of Minimal Nondeterministic Finite Automata. Journal of Automata, Languages and Combinatorics 7(4): 419-432 (2002)

2002
2	EE	Henry N. Adorna: On the Separation between k-Party and (k-1)-Party Nondeterministic Message Complexities. Developments in Language Theory 2002: 152-161
1		Henry N. Adorna: 3-Party Message Complexity is Better than 2-Party Ones for Proving Lower Bounds on the Size of Minimal Nondeterministic Finite Automata. Journal of Automata, Languages and Combinatorics 7(4): 419-432 (2002)