# Search results for: Holger Petersen

*robust*against image transformation techniques such as

*compression, rotation*,

*translation, scaling*and

*cropping*. It uses modulation of the magnitude...

Lecture Notes in Computer Science > Security Protocols > 177-190

*t(n)*can be simulated by one queue in

*O(t(n))*time. Every pushdown automaton can be simulated by one queue in time

*O(n√n)*. Every deterministic machine with a one-turn pushdown store can be...

Lecture Notes in Computer Science > SOFSEM 2008: Theory and Practice of Computer Science > Foundations of Computer Science > 418-423

*n*items and a function defined over lists of these items, generate a bounded amount of auxiliary information such that range queries asking for the value of the function on sub-lists can be answered within a certain time bound. For the function “mode” we improve the previously known time bound

*O*(

*n*

^{ ε }log

*n*...

Lecture Notes in Computer Science > Mathematical Foundations of Computer Science 2000 > Contributed Papers > 589-598

Lecture Notes in Computer Science > Mathematical Foundations of Computer Science 1999 > Automata > 241-250

*k*-dimensional input for

*k*≥ 3. Further we answer the question whether the classes of languages accepted by deterministic or nondeterministic rebound automata...

Lecture Notes in Computer Science > Computing and Combinatorics > Data Structures and Algorithms > 218-227

^{2}. Together these results establish that the membership problem...

*k*pebbles are equivalent in recognition power to corresponding automata with k sensing heads. Some other simulations are obtained.

Lecture Notes in Computer Science > Language and Automata Theory and Applications > Contributed Papers > 433-439

*Ω*(

*m*

^{2}ℓ) on sorting

*m*strings of length ℓ each is shown, which matches the upper bound. For the related Element Distinctness Problem with input of the same format we prove the upper bound

*O*(

*m*

^{2}) if ℓ =

*O*(

*m*/log

*m*), showing this problem to be easier than sorting. The bound

*O*(

*m*

^{2})...

*t*out of a group of

*n*verifiers should be able to verify the signatures. These verifiers can either be anonymous, non-anonymous or convertible non-anonymous. So far, only schemes for the anonymous shared verification signature concept have been suggested...

Lecture Notes in Computer Science > SOFSEM 2008: Theory and Practice of Computer Science > Foundations of Computer Science > 406-417

*m*binary strings of length ℓ =

*O*(

*m*/log

^{2}

*m*) can be solved in time

*O*(

*m*

^{3/2}ℓ

^{1/2}) and space

*O*(

*m*

^{1/2}ℓ

^{1/2}) on a nondeterministic machine. This is faster than the best sorting algorithm on the computational model and...

Algorithms Unplugged > Optimization > 345-355

CSR-Bildung > Weiterbildung > 139-152