Sciweavers

6300 search results - page 80 / 1260
» We have it easy, but do we have it right
Sort
View
ALENEX
2007
102views Algorithms» more  ALENEX 2007»
15 years 2 months ago
Linearization: Locally Self-Stabilizing Sorting in Graphs
We consider the problem of designing a distributed algorithm that, given an arbitrary connected graph G of nodes with unique labels, converts G into a sorted list of nodes. This a...
Melih Onus, Andréa W. Richa, Christian Sche...
IMA
2007
Springer
137views Cryptology» more  IMA 2007»
15 years 7 months ago
Algebraic Cryptanalysis of the Data Encryption Standard
In spite of growing importance of AES, the Data Encryption Standard is by no means obsolete. DES has never been broken from the practical point of view. The triple DES is believed ...
Nicolas Courtois, Gregory V. Bard
101
Voted
ICALP
2005
Springer
15 years 6 months ago
Logics for Unranked Trees: An Overview
Labeled unranked trees are used as a model of XML documents, and logical languages for them have been studied actively over the past several years. Such logics have different purpo...
Leonid Libkin
AH
2004
Springer
15 years 6 months ago
Modeling Learners as Individuals and as Groups
Abstract. Adaptive navigation support normally attempts to make selecting a relevant hyperlink as easy as possible. However, in educational applications, this may have negative lea...
Roland Hübscher, Sadhana Puntambekar
CCS
2011
ACM
14 years 1 months ago
Practical PIR for electronic commerce
We extend Goldberg’s multi-server information-theoretic private information retrieval (PIR) with a suite of protocols for privacypreserving e-commerce. Our first protocol adds ...
Ryan Henry, Femi G. Olumofin, Ian Goldberg