Author image not provided
 Martin Otto

Authors:
Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article9.59
Citation Count307
Publication count32
Publication years1992-2013
Available for download5
Average downloads per article536.60
Downloads (cumulative)2,683
Downloads (12 Months)71
Downloads (6 Weeks)7
SEARCH
ROLE
Arrow RightAuthor only


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


32 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 20 of 32
Result page: 1 2

Sort by:

1
June 2013 LICS '13: Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 2,   Downloads (12 Months): 5,   Downloads (Overall): 37

Full text available: PDFPDF
We propose a novel construction of finite hyper graphs and relational structures that is based on reduced products with Cayley graphs of groupoids. The universal algebraic and combinatorial properties of groupoids are abstracted form the composition behaviour of partial injections and support a very natural approach to the construction of ...
Keywords: finite model theory, combinatorics, graph theory, hypergraphs, guarded logics

2
July 2012 Proceedings of the VLDB Endowment: Volume 5 Issue 11, July 2012
Publisher: VLDB Endowment
Bibliometrics:
Citation Count: 13
Downloads (6 Weeks): 1,   Downloads (12 Months): 17,   Downloads (Overall): 83

Full text available: PDFPDF
A well-established and fundamental insight in database theory is that negation (also known as complementation) tends to make queries difficult to process and difficult to reason about. Many basic problems are decidable and admit practical algorithms in the case of unions of conjunctive queries, but become difficult or even undecidable ...

3 published by ACM
March 2012 Journal of the ACM (JACM): Volume 59 Issue 1, February 2012
Publisher: ACM
Bibliometrics:
Citation Count: 4
Downloads (6 Weeks): 2,   Downloads (12 Months): 15,   Downloads (Overall): 409

Full text available: PDFPDF
We construct finite groups whose Cayley graphs have large girth even with respect to a discounted distance measure that contracts arbitrarily long sequences of edges from the same color class (subgroup), and only counts transitions between color classes (cosets). These groups are shown to be useful in the construction of ...
Keywords: Finite model theory, expressive completeness, groups of large girth, guarded fragment

4
June 2011 Microelectronic Engineering: Volume 88 Issue 6, June, 2011
Publisher: Elsevier Science Ltd.
Bibliometrics:
Citation Count: 3

We report on a two step soft UV nanoimprint process termed ''Press and Release Imprint (PRI) that enables the reduction of both the mold deformation and the local variation of the residual layer thickness, thereby allowing high fidelity pattern replication with a uniform local residual layer thickness. The effect of ...
Keywords: PDMS mold deformation, Nanoimprint, Soft UV-NIL, Residual layer, Soft lithography

5
July 2010 LICS '10: Proceedings of the 2010 25th Annual IEEE Symposium on Logic in Computer Science
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 28

Evaluating a boolean conjunctive query q over a guarded first-order theory T is equivalent to checking whether (T \& not q) is unsatisfiable. This problem is relevant to the areas of database theory and description logic. Since q may not be guarded, well known results about the decidability, complexity, and ...
Keywords: guarded fragment, finite model theory, descriptive complexity, hypergraph covers, conjunctive queries

6
July 2010 LICS '10: Proceedings of the 2010 25th Annual IEEE Symposium on Logic in Computer Science
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 3

We construct finite groups whose Cayley graphs have large girth even w.r.t. a discounted distance measure that contracts arbitrarily long sequences of edges from the same colour class, and only counts transitions between colour classes. These groups are shown to be useful in the construction of finite bisimilar hypergraph covers ...
Keywords: finite model theory, hypergraphs, acyclicity, guarded fragment

7
July 2009 ICALP '09: Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 5

We prove that the boundedness problem for monadic second-order logic over the class of all finite words is decidable.

8
March 2008 ARES '08: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 0

Authentication of participants is fundamental for secure communication systems. Many traditional systems rely on central components (like certification authorities). These have to be powerful and well-protected, making them expensive, and require trust in a central authority. Conventional decentralized solutions based on local trust between participants only (like PGP) are cheaper ...
Keywords: communication system security, identification of persons, personal communication networks, public key cryptography

9
July 2007 ICALP'07: Proceedings of the 34th international conference on Automata, Languages and Programming
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 2

We study the boundedness problem for monadic least fixed points as a decision problem. While this problem is known to be undecidable in general and even for syntactically very restricted classes of underlying first-order formulae, we here obtain a decidability result for the boundedness issue for monadic fixed points over ...

10
May 2007 Microelectronic Engineering: Volume 84 Issue 5-8, May, 2007
Publisher: Elsevier Science Ltd.
Bibliometrics:
Citation Count: 1

CD control in step & repeat UV-based nanoimprint lithography was investigated to determine effects of the physical contact between the template and the resist within each imprint. Over 100 fields were printed with a single template. For each field, a specific structure was located and four selected feature sizes were ...
Keywords: Reproducibility, Step & repeat, Wafer scale, UV-nanoimprint, CD control, Dimensional stability

11
October 2006 FDTC'06: Proceedings of the Third international conference on Fault Diagnosis and Tolerance in Cryptography
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 11

We present a new type of fault attacks on elliptic curve scalar multiplications: Sign Change Attacks. These attacks exploit different number representations as they are often employed in modern cryptographic applications. Previously, fault attacks on elliptic curves aimed to force a device to output points which are on a cryptographically ...
Keywords: fault attacks, smartcards, elliptic curve cryptosystem

12
October 2006 FDTC'06: Proceedings of the Third international conference on Fault Diagnosis and Tolerance in Cryptography
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 10

At CCS 2003, a new CRT-RSA algorithm was presented in [BOS03], which was claimed to be secure against fault attacks for various fault models. At CCS 2004, David Wagner presented an attack on the proposed scheme, claiming that the so-called BOS scheme was insecure for all presented fault models [Wag04]. ...
Keywords: fault attacks, CRT-RSA, smartcards, wagner's attack, BOS-scheme

13
August 2006 LICS '06: Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 2

We consider the monadic boundedness problem for least fixed points over FO formulae as a decision problem: Given a formula (X, x), positive in X, decide whether there is a uniform finite bound on the least fixed point recursion based on . Few fragments of FO are known to have ...

14
June 2004 Microelectronic Engineering - Proceedings of the 29th international conference on micro and nano engineering: Volume 73-74 Issue 1, June 2004
Publisher: Elsevier Science Ltd.
Bibliometrics:
Citation Count: 1

A new approach to step and repeat UV-based nanoimprint lithography (UV-NIL) using sequential imprints on a large-area spin-coated surface is presented. A detailed study has been performed in order to assess the reproducibility and homogeneity of the process. The imprint tool features a movable wafer stage for 4 in. wafers, ...
Keywords: nanoimprint, step and repeat

15 published by ACM
October 2003 CCS '03: Proceedings of the 10th ACM conference on Computer and communications security
Publisher: ACM
Bibliometrics:
Citation Count: 31
Downloads (6 Weeks): 1,   Downloads (12 Months): 21,   Downloads (Overall): 1,625

Full text available: PDFPDF
In this paper we describe a new algorithm to prevent fault attacks on RSA signature algorithms using the Chinese Remainder Theorem (CRT-RSA). This variant of the RSA signature algorithm is widely used on smartcards. Smartcards on the other hand are particularly susceptible to fault attacks like the one described in ...
Keywords: Bellcore attack, Chinese remainder theorem, RSA, cryptanalysis, faults attacks, smartcards

16
July 2002 LICS '02: Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 6

Characterisation theorems for modal and guarded fragments of first-order logic are explored over finite transition systems. We show that the classical characterisations in terms of semantic invariance under the appropriate forms of bisimulation equivalence can be recovered at the level of finite model theory. The new, more constructive proofs naturallyextend ...

17 published by ACM
July 2002 ACM Transactions on Computational Logic (TOCL): Volume 3 Issue 3, July 2002
Publisher: ACM
Bibliometrics:
Citation Count: 18
Downloads (6 Weeks): 1,   Downloads (12 Months): 13,   Downloads (Overall): 529

Full text available: PDFPDF
Guarded fixed-point logic μGF extends the guarded fragment by means of least and greatest fixed points, and thus plays the same role within the domain of guarded logics as the modal μ-calculus plays within the modal domain. We provide a semantic characterization of μGF within an appropriate fragment of second-order ...
Keywords: modal logic, model theory, guarded logic, Bisimulation

18
August 2001 Information and Computation: Volume 168 Issue 2, Aug. 1, 2001
Publisher: Academic Press, Inc.
Bibliometrics:
Citation Count: 1

We study the query language BQL: the extension of the relational algebra with for-loops. We also study FO(FOR): the extension of first-order logic with a for-loop variant of the partial fixpoint operator. In contrast to the known situation with query languages, which include while-loops instead of for-loops, BQL and FO(FOR) ...
Keywords: database theory, for-loops, query languages, finite model theory

19
June 2000 LICS '00: Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 7

We propose a second-order extension for the guarded fragment showing that several canonical extensions are in fact equivalent. Then we ask the question in how far results from the modal world can be brought into the world of guarded logics. We give a transformation from first-order structures to Kripke type ...

20
September 1999 LPAR '99: Proceedings of the 6th International Conference on Logic Programming and Automated Reasoning
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 7

The gueirded fragment (GF) was introduced in [ABN98] as a fragment of first order logic which combines a great expressive power with nice modal behavior. It consists of relationeil first order formulas whose qucintiiiers are relativized by atoms in a certain way. While GF hsis been established as a particularly ...



The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us