Sciweavers

13621 search results - page 420 / 2725
» Computability and Complexity in Self-assembly
Sort
View
FDL
2004
IEEE
15 years 10 months ago
A Functional Programming Framework of Heterogeneous Model of Computation for System Design
System-on-Chip (SOC) and other complex distributed hardware/software systems contain heterogeneous components such as DSPs, micro-controllers, application specific logic etc., whi...
Deepak Mathaikutty, Hiren D. Patel, Sandeep K. Shu...
DAGSTUHL
2007
15 years 8 months ago
Programming self developing blob machines for spatial computing.
: This is a position paper introducing blob computing: A Blob is a generic primitive used to structure a uniform computing substrate into an easier-to-program parallel virtual mach...
Frédéric Gruau, Christine Eisenbeis
WG
2005
Springer
16 years 11 days ago
Faster Dynamic Algorithms for Chordal Graphs, and an Application to Phylogeny
We improve the current complexities for maintaining a chordal graph by starting with an empty graph and repeatedly adding or deleting edges.
Anne Berry, Alain Sigayret, Jeremy Spinrad
FOCS
2002
IEEE
15 years 12 months ago
Zero-Knowledge
We show new lower bounds and impossibility results for general (possibly non-black-box) zero-knowledge proofs and arguments. Our main results are that, under reasonable complexity...
Oded Goldreich
FOCS
1990
IEEE
15 years 11 months ago
The Lattice Reduction Algorithm of Gauss: An Average Case Analysis
The lattice reduction algorithm of Gauss is shown to have an average case complexity which is asymptotic to a constant.
Brigitte Vallée, Philippe Flajolet