Abstract. We present a lower bound on the number of rounds required by Concurrent Zero-Knowledge proofs for languages in NP. It is shown that in the context of Concurrent Zero-Know...
Since the early Sixties and Seventies it has been known that the regular and context-free languages arc characterized by definability in the monadic second-order theory of certain...
Most research in the field of anaphora or coreference detection has been limited to noun phrase coreference, usually on a restricted set of entities, such as ACE entities. In par...
Sameer S. Pradhan, Lance A. Ramshaw, Ralph M. Weis...
This paper describes the Mobile Fair Diary (MFD), which is designed to allow a housing fair customer to make a personalized digital recording of his/ her visit to a hectic fairgrou...
Jani Korhonen, Timo Ojala, Annu Ristola, Manne Kes...
Nominal calculi have been shown very effective to formally model a variety of computational phenomena. The models of nominal calculi have often infinite states, thus making model ...