Sciweavers

272 search results - page 34 / 55
» New directions in the introductory computer science curricul...
Sort
View
STACS
2009
Springer
14 years 2 months ago
Generating Shorter Bases for Hard Random Lattices
We revisit the problem of generating a “hard” random lattice together with a basis of relatively short vectors. This problem has gained in importance lately due to new cryptogr...
Joël Alwen, Chris Peikert
SOFSEM
2007
Springer
14 years 2 months ago
A Software Architecture for Shared Resource Management in Mobile Ad Hoc Networks
We provide the implementation results of the distributed mutual exclusion algorithm based on Ricart-Agrawala algorithm for mobile ad hoc networks (MANETs) using the ns2 simulator d...
Orhan Dagdeviren, Kayhan Erciyes
MFCS
2010
Springer
13 years 6 months ago
Meta-Envy-Free Cake-Cutting Protocols
This paper discusses cake-cutting protocols when the cake is a heterogeneous good that is represented by an interval in the real line. We propose a new desirable property, the meta...
Yoshifumi Manabe, Tatsuaki Okamoto
CORR
2008
Springer
71views Education» more  CORR 2008»
13 years 8 months ago
A Survey of Quantum Programming Languages: History, Methods, and Tools
Quantum computer programming is emerging as a new subject domain from multidisciplinary research in quantum computing, computer science, mathematics (especially quantum logic, lamb...
Donald A. Sofge
TCS
2010
13 years 2 months ago
Combinatorics of labelling in higher-dimensional automata
The main idea for interpreting concurrent processes as labelled precubical sets is that a given set of n actions running concurrently must be assembled to a labelled ncube, in exac...
Philippe Gaucher