Sciweavers

1818 search results - page 245 / 364
» Granularity-Adaptive Proof Presentation
Sort
View
APLAS
2009
ACM
15 years 11 months ago
Branching Bisimilarity between Finite-State Systems and BPA or Normed BPP Is Polynomial-Time Decidable
In this paper we present polynomial time algorithms deciding branching bisimilarity between finite-state systems and several classes of infinite-state systems: BPA and normed BPP...
Hongfei Fu
STACS
2009
Springer
15 years 11 months ago
Lower Bounds for Multi-Pass Processing of Multiple Data Streams
ABSTRACT. This paper gives a brief overview of computation models for data stream processing, and it introduces a new model for multi-pass processing of multiple streams, the so-ca...
Nicole Schweikardt
ISCC
2000
IEEE
128views Communications» more  ISCC 2000»
15 years 10 months ago
A Fully Distributed Location Management Scheme for Large PCS
Abstract— In [1], [2], we presented the design, specification and proof of correctness of a fully distributed location management scheme for PCS networks and argued that fully r...
Karunaharan Ratnam, Ibrahim Matta, Sampath Rangara...
CADE
2000
Springer
15 years 10 months ago
An Infrastructure for Intertheory Reasoning
Abstract. The little theories method, in which mathematical reasoning is distributed across a network of theories, is a powerful technique for describing and analyzing complex syst...
William M. Farmer
CRYPTO
2000
Springer
133views Cryptology» more  CRYPTO 2000»
15 years 10 months ago
Provably Secure Partially Blind Signatures
Partially blind signature schemes are an extension of blind signature schemes that allow a signer to explicitly include necessary information (expiration date, collateral condition...
Masayuki Abe, Tatsuaki Okamoto