Sciweavers

1071 search results - page 93 / 215
» Theories of Automatic Structures and Their Complexity
Sort
View
CORR
2000
Springer
116views Education» more  CORR 2000»
13 years 8 months ago
Algorithmic Statistics
While Kolmogorov complexity is the accepted absolute measure of information content of an individual finite object, a similarly absolute notion is needed for the relation between a...
Péter Gács, John Tromp, Paul M. B. V...
PODC
2011
ACM
12 years 11 months ago
MIS on trees
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
Christoph Lenzen, Roger Wattenhofer
IANDC
2008
120views more  IANDC 2008»
13 years 8 months ago
A framework for compositional verification of security protocols
Automatic security protocol analysis is currently feasible only for small protocols. Since larger protocols quite often are composed of many small protocols, compositional analysi...
Suzana Andova, Cas J. F. Cremers, Kristian Gj&osla...
COMPSAC
2006
IEEE
14 years 2 months ago
Dynamic Object Viewers for Java
The jGRASP lightweight IDE provides object viewers that automatically generate dynamic, statebased visualizations of objects and primitive variables in Java. Multiple synchronized...
James H. Cross II, T. Dean Hendrix, Larry A. Barow...
DATE
1998
IEEE
109views Hardware» more  DATE 1998»
14 years 15 days ago
Cross-Level Hierarchical High-Level Synthesis
This paper presents a new approach to cross-level hierarchical high-level synthesis. A methodology is presented, that supports the efficient synthesis of hierarchical specified sy...
Oliver Bringmann, Wolfgang Rosenstiel