Sciweavers

2479 search results - page 279 / 496
» Quantum complexity theory
Sort
View
CTRSA
2009
Springer
106views Cryptology» more  CTRSA 2009»
15 years 10 months ago
Communication-Efficient Private Protocols for Longest Common Subsequence
We design communication efficient two-party and multi-party protocols for the longest common subsequence (LCS) and related problems. Our protocols achieve privacy with respect to p...
Matthew K. Franklin, Mark Gondree, Payman Mohassel
DATE
2004
IEEE
134views Hardware» more  DATE 2004»
15 years 10 months ago
Context-Aware Performance Analysis for Efficient Embedded System Design
Performance analysis has many advantages in theory compared to simulation for the validation of complex embedded systems, but is rarely used in practice. To make analysis more att...
Marek Jersak, Rafik Henia, Rolf Ernst
ECAI
2006
Springer
15 years 10 months ago
Boolean Games Revisited
Abstract. Game theory is a widely used formal model for studying strategical interactions between agents. Boolean games [8] are two players, zero-sum static games where players...
Elise Bonzon, Marie-Christine Lagasquie-Schiex, J&...
FOSSACS
2000
Springer
15 years 10 months ago
A Program Refinement Framework Supporting Reasoning about Knowledge and Time
Abstract. This paper develops a highly expressive semantic framework for program refinement that supports both temporal reasoning and reasoning about the knowledge of a single agen...
Kai Engelhardt, Ron van der Meyden, Yoram Moses
STACS
2000
Springer
15 years 10 months ago
Almost Complete Sets
We show that there is a set that is almost complete but not complete under polynomial-time many-one (p-m) reductions for the class E of sets computable in deterministic time 2lin ...
Klaus Ambos-Spies, Wolfgang Merkle, Jan Reimann, S...