Sciweavers

2465 search results - page 283 / 493
» Automata on Linear Orderings
Sort
View
115
Voted
ISSAC
1997
Springer
142views Mathematics» more  ISSAC 1997»
15 years 5 months ago
The Structure of Sparse Resultant Matrices
Resultants characterize the existence of roots of systems of multivariate nonlinear polynomial equations, while their matrices reduce the computation of all common zeros to a prob...
Ioannis Z. Emiris, Victor Y. Pan
CONCUR
1993
Springer
15 years 5 months ago
Loop Parallelization in the Polytope Model
During the course of the last decade, a mathematical model for the parallelization of FOR-loops has become increasingly popular. In this model, a (perfect) nest of r FOR-loops is r...
Christian Lengauer
112
Voted
WG
1993
Springer
15 years 5 months ago
Graphs, Hypergraphs and Hashing
Minimal perfect hash functions are used for memory efficient storage and fast retrieval of items from static sets. We present an infinite family of efficient and practical algori...
George Havas, Bohdan S. Majewski, Nicholas C. Worm...
PKC
2010
Springer
177views Cryptology» more  PKC 2010»
15 years 5 months ago
More Constructions of Lossy and Correlation-Secure Trapdoor Functions
We propose new and improved instantiations of lossy trapdoor functions (Peikert and Waters, STOC ’08), and correlation-secure trapdoor functions (Rosen and Segev, TCC ’09). Ou...
David Mandell Freeman, Oded Goldreich, Eike Kiltz,...
105
Voted
ASIACRYPT
2006
Springer
15 years 4 months ago
Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
Non-interactive zero-knowledge proofs play an essential role in many cryptographic protocols. We suggest several NIZK proof systems based on prime order groups with a bilinear map...
Jens Groth