Publications related to Optimal polynomial blow up range for critical wave maps

Efficient Public-Key Distance Bounding Protocol

Distance bounding protocols become more and more important because they are the most accurate solution to defeat relay attacks. They consist of two parties: a verifier and a prover. The prover shows that (s)he is close enough to the verifier. In some appli ...

Springer-Verlag Berlin2016

Multilevel Design Understanding: From Specification to Logic Invited Paper

Mathias Soeken

We present an outline of the field of Multilevel Design Understanding by first defining and motivating the related problems, and then describing the key issues which must be addressed in future research. ...

Assoc Computing Machinery2016

Optimal polynomial blow up range for critical wave maps

Joachim Krieger, Can Gao

We prove that the critical Wave Maps equation with target

S^2

and origin

\R^{2+1}

admits energy class blow up solutions of the form

u(t, r) = Q(\lambda(t)r) + \eps(t, r)

where

Q:\R^2\rightarrow S^2

is the ground state harmonic map and $\lambd ...

2015

Full blow-up range for co-rotaional wave maps to surfaces of revolution

Can Gao

We construct blow-up solutions of the energy critical wave map equation on

\mathbb{R}^{2+1}\to \mathcal N

with polynomial blow-up rate (

t^{-1-\nu}

for blow-up at

t=0

) in the case when

\mathcal N

is a surface of revolution. Here we extend the blow-u ...

2014

Bounded Tamper Resilience: How to go beyond the Algebraic Barrier

Sebastian Faust

Related key attacks (RKAs) are powerful cryptanalytic attacks where an adversary can change the secret key and observe the effect of such changes at the output. The state of the art in RKA security protects against an a-priori unbounded number of certain a ...

2013

Proactively Accountable Anonymous Messaging in Verdict

Bryan Alexander Ford, Henry Nathaniel Corrigan-Gibbs

Among anonymity systems, DC-nets have long held attraction for their resistance to traffic analysis attacks, but practical implementations remain vulnerable to internal disruption or “jamming” attacks, which require time-consuming detection procedures to r ...

2013

Robert Maillart's Key Methods From the Salginatobel Bridge Design Process (1928)

Corentin Jean Dominique Fivet

This paper sheds light on some of the graphical methods used by Robert Maillart to design the Salginatobel Bridge, a three-hinged concrete structure spanning 90 meters. Built in 1929, this masterpiece has since received extensive recognition both for its s ...

2012

Quantitative Analysis of Consensus Algorithms

André Schiper, Martin Hutle, Fatemeh Borran, Nuno Filipe de Sousa Santos

Consensus is one of the key problems in fault-tolerant distributed computing. Although the solvability of consensus is now a well-understood problem, comparing different algorithms in terms of efficiency is still an open problem. In this paper, we address ...

2012

Transforming terpene feedstock into polyketide architecture

Christoph Heinz

The Cu-catalyzed synthesis of skipped 1,4-dienes from allylic acetates and vinyl-Grignard reagents is key to bidirectional modifications of acyclic terpene acetates. As a result, trisubstituted double bond containing subunits can be readily transferred int ...

Royal Society of Chemistry2011

Quantitative Analysis of Consensus Algorithms

André Schiper, Martin Hutle, Fatemeh Borran, Nuno Filipe de Sousa Santos

Consensus is one of the key problems in fault-tolerant distributed computing. Although the solvability of consensus is now a well-understood problem, comparing different algorithms in terms of efficiency is still an open problem. In this paper, we address ...

2011

Optimal polynomial blow up range for critical wave maps

Graph Chatbot

Chat with Graph Search

Efficient Public-Key Distance Bounding Protocol

Multilevel Design Understanding: From Specification to Logic Invited Paper

Optimal polynomial blow up range for critical wave maps

Full blow-up range for co-rotaional wave maps to surfaces of revolution

Bounded Tamper Resilience: How to go beyond the Algebraic Barrier

Proactively Accountable Anonymous Messaging in Verdict

Robert Maillart's Key Methods From the Salginatobel Bridge Design Process (1928)

Quantitative Analysis of Consensus Algorithms

Transforming terpene feedstock into polyketide architecture

Quantitative Analysis of Consensus Algorithms

Bounded Tamper Resilience: How to go beyond the Algebraic Barrier

Robert Maillart's Key Methods From the Salginatobel Bridge Design Process (1928)

Efficient Public-Key Distance Bounding Protocol

Multilevel Design Understanding: From Specification to Logic Invited Paper

Optimal polynomial blow up range for critical wave maps

Full blow-up range for co-rotaional wave maps to surfaces of revolution

Quantitative Analysis of Consensus Algorithms

Transforming terpene feedstock into polyketide architecture

Proactively Accountable Anonymous Messaging in Verdict

Quantitative Analysis of Consensus Algorithms