Sciweavers

1220 search results - page 101 / 244
» Restricting grammatical complexity
Sort
View
STOC
2006
ACM
141views Algorithms» more  STOC 2006»
14 years 8 months ago
Zero-knowledge against quantum attacks
It is proved that several interactive proof systems are zero-knowledge against general quantum attacks. This includes the Goldreich?Micali?Wigderson classical zero-knowledge proto...
John Watrous
STOC
2005
ACM
163views Algorithms» more  STOC 2005»
14 years 8 months ago
Undirected ST-connectivity in log-space
We present a deterministic, log-space algorithm that solves st-connectivity in undirected graphs. The previous bound on the space complexity of undirected st-connectivity was log4...
Omer Reingold
SAC
2010
ACM
14 years 2 months ago
A simple role mining algorithm
Complex organizations need to establish access control policies in order to manage access to restricted resources. Role Based Access Control paradigm has been introduced in ’90 ...
Carlo Blundo, Stelvio Cimato
SIES
2009
IEEE
14 years 2 months ago
A flexible design flow for software IP binding in commodity FPGA
— Software intellectual property (SWIP) is a critical component of increasingly complex FPGA based system on chip (SOC) designs. As a result, developers want to ensure that their...
Michael Gora, Abhranil Maiti, Patrick Schaumont
QEST
2009
IEEE
14 years 2 months ago
Language-Level Symmetry Reduction for Probabilistic Model Checking
—Symmetry reduction is a technique for combating state-space explosion in model checking. The generic representatives approach to symmetry reduction uses a language-level transla...
Alastair F. Donaldson, Alice Miller, David Parker