Sciweavers

934 search results - page 103 / 187
» Quantum Algorithmic Entropy
Sort
View
ICPPW
2006
IEEE
14 years 4 months ago
Dynamic Algorithm Selection in Parallel GAMESS Calculations
Applications augmented with adaptive capabilities are becoming common in parallel computing environments which share resources such as main memory, network, or disk I/O. For large...
Nurzhan Ustemirov, Masha Sosonkina, Mark S. Gordon...
COCO
2003
Springer
118views Algorithms» more  COCO 2003»
14 years 3 months ago
Lower bounds for predecessor searching in the cell probe model
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
Pranab Sen
IMA
2001
Springer
78views Cryptology» more  IMA 2001»
14 years 2 months ago
Unconditionally Secure Key Agreement Protocol
Abstract. The key agreement protocol are either based on some computational infeasability, such as the calculus of the discrete logarithm in [1], or on theoretical impossibility un...
Cyril Prissette
STOC
2005
ACM
113views Algorithms» more  STOC 2005»
14 years 10 months ago
Efficient testing of groups
We construct an efficient probabilistic algorithm that, given a finite set with a binary operation, tests if it is an abelian group. The distance used is an analogue of the edit d...
Katalin Friedl, Gábor Ivanyos, Miklos Santh...
CORR
2008
Springer
116views Education» more  CORR 2008»
13 years 10 months ago
A statistical mechanical interpretation of algorithmic information theory
Abstract. We develop a statistical mechanical interpretation of algorithmic information theory by introducing the notion of thermodynamic quantities, such as free energy, energy, s...
Kohtaro Tadaki