Sciweavers

649 search results - page 65 / 130
» Visualization in string theory
Sort
View
LICS
2005
IEEE
15 years 3 months ago
A Polynomial Time Presburger Criterion and Synthesis for Number Decision Diagrams
Number Decision Diagrams (NDD) are the automatabased symbolic representation for manipulating sets of integer vectors encoded as strings of digit vectors (least or most significa...
Jérôme Leroux
FSE
2005
Springer
106views Cryptology» more  FSE 2005»
15 years 3 months ago
New Applications of T-Functions in Block Ciphers and Hash Functions
A T-function is a mapping from n-bit words to n-bit words in which for each 0 ≤ i < n, bit i of any output word can depend only on bits 0, 1, . . . , i of any input word. All ...
Alexander Klimov, Adi Shamir
OOPSLA
2005
Springer
15 years 3 months ago
Subtext: uncovering the simplicity of programming
Representing programs as text strings makes programming harder then it has to be. The source text of a program is far removed from its behavior. Bridging this conceptual gulf is w...
Jonathan Edwards
MFCS
2004
Springer
15 years 3 months ago
Complexity of Decision Problems for Simple Regular Expressions
We study the complexity of the inclusion, equivalence, and intersection problem for simple regular expressions arising in practical XML schemas. These basically consist of the conc...
Wim Martens, Frank Neven, Thomas Schwentick
LATA
2010
Springer
15 years 2 months ago
A Randomized Numerical Aligner (rNA)
With the advent of new sequencing technologies able to produce an enormous quantity of short genomic sequences, new tools able to search for them inside a references sequence genom...
Alberto Policriti, Alexandru I. Tomescu, Francesco...