3 Search Results for "Krause, Andreas"

Document
DOI: 10.4230/DagRep.7.8.55
Machine Learning and Formal Methods (Dagstuhl Seminar 17351)

Authors: Sanjit A. Seshia, Xianjin (Jerry) Zhu, Andreas Krause, and Susmit Jha

Published in: Dagstuhl Reports, Volume 7, Issue 8 (2018)

Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 17351 "Machine Learning and Formal Methods". The seminar brought together practitioners and reseachers in machine learning and related areas (such as robotics) with those working in formal methods and related areas (such as programming languages and control theory). The meeting highlighted the connections between the two disciplines, and created new links between the two research communities.
Cite as

Sanjit A. Seshia, Xianjin (Jerry) Zhu, Andreas Krause, and Susmit Jha. Machine Learning and Formal Methods (Dagstuhl Seminar 17351). In Dagstuhl Reports, Volume 7, Issue 8, pp. 55-73, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)

Copy BibTex To Clipboard

@Article{seshia_et_al:DagRep.7.8.55,
  author =	{Seshia, Sanjit A. and Zhu, Xianjin (Jerry) and Krause, Andreas and Jha, Susmit},
  title =	{{Machine Learning and Formal Methods (Dagstuhl Seminar 17351)}},
  pages =	{55--73},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2018},
  volume =	{7},
  number =	{8},
  editor =	{Seshia, Sanjit A. and Zhu, Xianjin (Jerry) and Krause, Andreas and Jha, Susmit},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.7.8.55},
  URN =		{urn:nbn:de:0030-drops-84302},
  doi =		{10.4230/DagRep.7.8.55},
  annote =	{Keywords: Formal Methods, Machine Learning}
}
Document
DOI: 10.4230/DagSemProc.06111.6
Computing Shortest Paths in Series-Parallel Graphs in Logarithmic Space

Authors: Andreas Jakoby and Till Tantau

Published in: Dagstuhl Seminar Proceedings, Volume 6111, Complexity of Boolean Functions (2006)

Abstract
Series-parallel graphs, which are built by repeatedly applying series or parallel composition operations to paths, play an important role in computer science as they model the flow of information in many types of programs. For directed series-parallel graphs, we study the problem of finding a shortest path between two given vertices. Our main result is that we can find such a path in logarithmic space, which shows that the distance problem for series-parallel graphs is L-complete. Previously, it was known that one can compute some path in logarithmic space; but for other graph types, like undirected graphs or tournament graphs, constructing some path between given vertices is possible in logarithmic space while constructing a shortest path is NL-complete.
Cite as

Andreas Jakoby and Till Tantau. Computing Shortest Paths in Series-Parallel Graphs in Logarithmic Space. In Complexity of Boolean Functions. Dagstuhl Seminar Proceedings, Volume 6111, pp. 1-9, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)

Copy BibTex To Clipboard

@InProceedings{jakoby_et_al:DagSemProc.06111.6,
  author =	{Jakoby, Andreas and Tantau, Till},
  title =	{{Computing Shortest Paths in Series-Parallel Graphs in Logarithmic Space}},
  booktitle =	{Complexity of Boolean Functions},
  pages =	{1--9},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2006},
  volume =	{6111},
  editor =	{Matthias Krause and Pavel Pudl\'{a}k and R\"{u}diger Reischuk and Dieter van Melkebeek},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.06111.6},
  URN =		{urn:nbn:de:0030-drops-6185},
  doi =		{10.4230/DagSemProc.06111.6},
  annote =	{Keywords: Series-parallel graphs, shortest path, logspace}
}
Document
DOI: 10.4230/DagSemProc.06111.21
Using Quantum Oblivious Transfer to Cheat Sensitive Quantum Bit Commitment

Authors: Andreas Jakoby, Maciej Liskiewicz, and Aleksander Madry

Published in: Dagstuhl Seminar Proceedings, Volume 6111, Complexity of Boolean Functions (2006)

Abstract
We define $(varepsilon,delta)$-secure quantum computations between two parties that can play dishonestly to maximise advantage $delta$, however keeping small the probability $varepsilon$ that the computation fails in evaluating correct value. We present a simple quantum protocol for computing one-out-of-two oblivious transfer that is $(O(sqrt{varepsilon}),varepsilon)$-secure. Using the protocol as a black box we construct a scheme for cheat sensitive quantum bit commitment which guarantee that a mistrustful party has a nonzero probability of detecting a cheating.
Cite as

Andreas Jakoby, Maciej Liskiewicz, and Aleksander Madry. Using Quantum Oblivious Transfer to Cheat Sensitive Quantum Bit Commitment. In Complexity of Boolean Functions. Dagstuhl Seminar Proceedings, Volume 6111, pp. 1-12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)

Copy BibTex To Clipboard

@InProceedings{jakoby_et_al:DagSemProc.06111.21,
  author =	{Jakoby, Andreas and Liskiewicz, Maciej and Madry, Aleksander},
  title =	{{Using Quantum Oblivious Transfer to Cheat Sensitive Quantum Bit Commitment}},
  booktitle =	{Complexity of Boolean Functions},
  pages =	{1--12},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2006},
  volume =	{6111},
  editor =	{Matthias Krause and Pavel Pudl\'{a}k and R\"{u}diger Reischuk and Dieter van Melkebeek},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.06111.21},
  URN =		{urn:nbn:de:0030-drops-6223},
  doi =		{10.4230/DagSemProc.06111.21},
  annote =	{Keywords: Two-Party Computations, Quantum Protocols, Bit Commitment, Oblivious Transfer.}
}
  • Refine by Author
  • 2 Jakoby, Andreas
  • 1 Jha, Susmit
  • 1 Krause, Andreas
  • 1 Liskiewicz, Maciej
  • 1 Madry, Aleksander
  • Show More...

  • Refine by Classification

  • Refine by Keyword
  • 1 Bit Commitment
  • 1 Formal Methods
  • 1 Machine Learning
  • 1 Oblivious Transfer.
  • 1 Quantum Protocols
  • Show More...

  • Refine by Type
  • 3 document

  • Refine by Publication Year
  • 2 2006
  • 1 2018

Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact