C2 - Ed. Board
Quantum multi-prover interactive proof systems with limited prior entanglement
Translation of binary regular expressions into nondeterministic ε-free automata with O(n log n) transitions
Guess-and-verify versus unrestricted nondeterminism for OBDDs and one-way Turing machines
On the difficulty of approximately maximizing agreements
Blocking a transition in a free choice net and what it tells about its throughput
Completeness results for graph isomorphism
Scheduling multicasts on unit-capacity trees and meshes
Papers to Appear
Blank
Advertisement #HA03022M (FTP file HA03022LMS.sea)
Advertisement #HA05062O (FTP file HA05062ABCNOP.pdf.sea)
Advertisement #AM01053M (FTP file HA01053LMS.zip)
C3 - Advertisement #HA06043M (FTP file HA06043LMSU.zip)
C4 - TOC