Sciweavers

173 search results - page 29 / 35
» A Proof of the Two-path Conjecture
Sort
View
CIE
2009
Springer
14 years 3 months ago
First-Order Universality for Real Programs
J. Raymundo Marcial–Romero and M. H. Escard´o described onal programming language with an abstract data type Real for the real numbers and a non-deterministic operator rtest: Re...
Thomas Anberrée
INFOCOM
2005
IEEE
14 years 2 months ago
FISSIONE: a scalable constant degree and low congestion DHT scheme based on Kautz graphs
Abstract— The distributed hash table (DHT) scheme has become the core component of many large-scale peer-to-peer networks. Degree, diameter, and congestion are important measures...
Dongsheng Li, Xicheng Lu, Jie Wu
WCC
2005
Springer
115views Cryptology» more  WCC 2005»
14 years 2 months ago
On the Weights of Binary Irreducible Cyclic Codes
This paper is devoted to the study of the weights of binary irreducible cyclic codes. We start from McEliece’s interpretation of these weights by means of Gauss sums. Firstly, a ...
Yves Aubry, Philippe Langevin
IFIP
2004
Springer
14 years 2 months ago
The Simply-typed Pure Pattern Type System Ensures Strong Normalization
Pure Pattern Type Systems (P2 TS) combine in a unified setting the capabilities of rewriting and λ-calculus. Their type systems, adapted from Barendregt’s λ-cube, are especial...
Benjamin Wack
FOCS
2002
IEEE
14 years 1 months ago
The Hardness of 3 - Uniform Hypergraph Coloring
We prove that coloring a 3-uniform 2-colorable hypergraph with c colors is NP-hard for any constant c. The best known algorithm [20] colors such a graph using O(n1/5 ) colors. Our...
Irit Dinur, Oded Regev, Clifford D. Smyth