---
_id: '1175'
abstract:
- lang: eng
text: We study space complexity and time-space trade-offs with a focus not on peak
memory usage but on overall memory consumption throughout the computation. Such
a cumulative space measure was introduced for the computational model of parallel
black pebbling by [Alwen and Serbinenko ’15] as a tool for obtaining results in
cryptography. We consider instead the non- deterministic black-white pebble game
and prove optimal cumulative space lower bounds and trade-offs, where in order
to minimize pebbling time the space has to remain large during a significant fraction
of the pebbling. We also initiate the study of cumulative space in proof complexity,
an area where other space complexity measures have been extensively studied during
the last 10–15 years. Using and extending the connection between proof complexity
and pebble games in [Ben-Sasson and Nordström ’08, ’11] we obtain several strong
cumulative space results for (even parallel versions of) the resolution proof
system, and outline some possible future directions of study of this, in our opinion,
natural and interesting space measure.
alternative_title:
- LIPIcs
author:
- first_name: Joel F
full_name: Alwen, Joel F
id: 2A8DFA8C-F248-11E8-B48F-1D18A9856A87
last_name: Alwen
- first_name: Susanna
full_name: De Rezende, Susanna
last_name: De Rezende
- first_name: Jakob
full_name: Nordstrom, Jakob
last_name: Nordstrom
- first_name: Marc
full_name: Vinyals, Marc
last_name: Vinyals
citation:
ama: 'Alwen JF, De Rezende S, Nordstrom J, Vinyals M. Cumulative space in black-white
pebbling and resolution. In: Papadimitriou C, ed. Vol 67. Schloss Dagstuhl - Leibniz-Zentrum
für Informatik; 2017:38:1-38-21. doi:10.4230/LIPIcs.ITCS.2017.38'
apa: 'Alwen, J. F., De Rezende, S., Nordstrom, J., & Vinyals, M. (2017). Cumulative
space in black-white pebbling and resolution. In C. Papadimitriou (Ed.) (Vol.
67, p. 38:1-38-21). Presented at the ITCS: Innovations in Theoretical Computer
Science, Berkeley, CA, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
https://doi.org/10.4230/LIPIcs.ITCS.2017.38'
chicago: Alwen, Joel F, Susanna De Rezende, Jakob Nordstrom, and Marc Vinyals. “Cumulative
Space in Black-White Pebbling and Resolution.” edited by Christos Papadimitriou,
67:38:1-38-21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. https://doi.org/10.4230/LIPIcs.ITCS.2017.38.
ieee: 'J. F. Alwen, S. De Rezende, J. Nordstrom, and M. Vinyals, “Cumulative space
in black-white pebbling and resolution,” presented at the ITCS: Innovations in
Theoretical Computer Science, Berkeley, CA, United States, 2017, vol. 67, p. 38:1-38-21.'
ista: 'Alwen JF, De Rezende S, Nordstrom J, Vinyals M. 2017. Cumulative space in
black-white pebbling and resolution. ITCS: Innovations in Theoretical Computer
Science, LIPIcs, vol. 67, 38:1-38-21.'
mla: Alwen, Joel F., et al. Cumulative Space in Black-White Pebbling and Resolution.
Edited by Christos Papadimitriou, vol. 67, Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2017, p. 38:1-38-21, doi:10.4230/LIPIcs.ITCS.2017.38.
short: J.F. Alwen, S. De Rezende, J. Nordstrom, M. Vinyals, in:, C. Papadimitriou
(Ed.), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, p. 38:1-38-21.
conference:
end_date: 2017-01-11
location: Berkeley, CA, United States
name: 'ITCS: Innovations in Theoretical Computer Science'
start_date: 2017-01-09
date_created: 2018-12-11T11:50:33Z
date_published: 2017-01-01T00:00:00Z
date_updated: 2021-01-12T06:48:51Z
day: '01'
ddc:
- '005'
- '600'
department:
- _id: KrPi
doi: 10.4230/LIPIcs.ITCS.2017.38
editor:
- first_name: Christos
full_name: Papadimitriou, Christos
last_name: Papadimitriou
file:
- access_level: open_access
checksum: dbc94810be07c2fb1945d5c2a6130e6c
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:17:11Z
date_updated: 2020-07-14T12:44:37Z
file_id: '5263'
file_name: IST-2018-927-v1+1_LIPIcs-ITCS-2017-38.pdf
file_size: 557769
relation: main_file
file_date_updated: 2020-07-14T12:44:37Z
has_accepted_license: '1'
intvolume: ' 67'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
page: 38:1-38-21
publication_identifier:
issn:
- '18688969'
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '6179'
pubrep_id: '927'
quality_controlled: '1'
scopus_import: 1
status: public
title: Cumulative space in black-white pebbling and resolution
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 67
year: '2017'
...
---
_id: '1176'
abstract:
- lang: eng
text: The algorithm Argon2i-B of Biryukov, Dinu and Khovratovich is currently being
considered by the IRTF (Internet Research Task Force) as a new de-facto standard
for password hashing. An older version (Argon2i-A) of the same algorithm was chosen
as the winner of the recent Password Hashing Competition. An important competitor
to Argon2i-B is the recently introduced Balloon Hashing (BH) algorithm of Corrigan-Gibs,
Boneh and Schechter. A key security desiderata for any such algorithm is that
evaluating it (even using a custom device) requires a large amount of memory amortized
across multiple instances. Alwen and Blocki (CRYPTO 2016) introduced a class of
theoretical attacks against Argon2i-A and BH. While these attacks yield large
asymptotic reductions in the amount of memory, it was not, a priori, clear if
(1) they can be extended to the newer Argon2i-B, (2) the attacks are effective
on any algorithm for practical parameter ranges (e.g., 1GB of memory) and (3)
if they can be effectively instantiated against any algorithm under realistic
hardware constrains. In this work we answer all three of these questions in the
affirmative for all three algorithms. This is also the first work to analyze the
security of Argon2i-B. In more detail, we extend the theoretical attacks of Alwen
and Blocki (CRYPTO 2016) to the recent Argon2i-B proposal demonstrating severe
asymptotic deficiencies in its security. Next we introduce several novel heuristics
for improving the attack's concrete memory efficiency even when on-chip memory
bandwidth is bounded. We then simulate our attacks on randomly sampled Argon2i-A,
Argon2i-B and BH instances and measure the resulting memory consumption for various
practical parameter ranges and for a variety of upperbounds on the amount of parallelism
available to the attacker. Finally we describe, implement, and test a new heuristic
for applying the Alwen-Blocki attack to functions employing a technique developed
by Corrigan-Gibs et al. for improving concrete security of memory-hard functions.
We analyze the collected data and show the effects various parameters have on
the memory consumption of the attack. In particular, we can draw several interesting
conclusions about the level of security provided by these functions. · For the
Alwen-Blocki attack to fail against practical memory parameters, Argon2i-B must
be instantiated with more than 10 passes on memory - beyond the "paranoid" parameter
setting in the current IRTF proposal. · The technique of Corrigan-Gibs for improving
security can also be overcome by the Alwen-Blocki attack under realistic hardware
constraints. · On a positive note, both the asymptotic and concrete security of
Argon2i-B seem to improve on that of Argon2i-A.
article_number: '7961977'
article_processing_charge: No
author:
- first_name: Joel F
full_name: Alwen, Joel F
id: 2A8DFA8C-F248-11E8-B48F-1D18A9856A87
last_name: Alwen
- first_name: Jeremiah
full_name: Blocki, Jeremiah
last_name: Blocki
citation:
ama: 'Alwen JF, Blocki J. Towards practical attacks on Argon2i and balloon hashing.
In: IEEE; 2017. doi:10.1109/EuroSP.2017.47'
apa: 'Alwen, J. F., & Blocki, J. (2017). Towards practical attacks on Argon2i
and balloon hashing. Presented at the EuroS&P: European Symposium on Security
and Privacy, Paris, France: IEEE. https://doi.org/10.1109/EuroSP.2017.47'
chicago: Alwen, Joel F, and Jeremiah Blocki. “Towards Practical Attacks on Argon2i
and Balloon Hashing.” IEEE, 2017. https://doi.org/10.1109/EuroSP.2017.47.
ieee: 'J. F. Alwen and J. Blocki, “Towards practical attacks on Argon2i and balloon
hashing,” presented at the EuroS&P: European Symposium on Security and Privacy,
Paris, France, 2017.'
ista: 'Alwen JF, Blocki J. 2017. Towards practical attacks on Argon2i and balloon
hashing. EuroS&P: European Symposium on Security and Privacy, 7961977.'
mla: Alwen, Joel F., and Jeremiah Blocki. Towards Practical Attacks on Argon2i
and Balloon Hashing. 7961977, IEEE, 2017, doi:10.1109/EuroSP.2017.47.
short: J.F. Alwen, J. Blocki, in:, IEEE, 2017.
conference:
end_date: 2017-04-28
location: Paris, France
name: 'EuroS&P: European Symposium on Security and Privacy'
start_date: 2017-04-26
date_created: 2018-12-11T11:50:33Z
date_published: 2017-07-03T00:00:00Z
date_updated: 2023-09-20T11:22:25Z
day: '03'
department:
- _id: KrPi
doi: 10.1109/EuroSP.2017.47
external_id:
isi:
- '000424197300011'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2016/759
month: '07'
oa: 1
oa_version: Submitted Version
publication_identifier:
isbn:
- 978-150905761-0
publication_status: published
publisher: IEEE
publist_id: '6178'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Towards practical attacks on Argon2i and balloon hashing
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2017'
...
---
_id: '11772'
abstract:
- lang: eng
text: A dynamic graph algorithm is a data structure that supports operations on
dynamically changing graphs.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
citation:
ama: 'Henzinger MH. The state of the art in dynamic graph algorithms. In: 44th
International Conference on Current Trends in Theory and Practice of Computer
Science. Vol 10706. Springer Nature; 2017:40–44. doi:10.1007/978-3-319-73117-9_3'
apa: 'Henzinger, M. H. (2017). The state of the art in dynamic graph algorithms.
In 44th International Conference on Current Trends in Theory and Practice of
Computer Science (Vol. 10706, pp. 40–44). Krems, Austria: Springer Nature.
https://doi.org/10.1007/978-3-319-73117-9_3'
chicago: Henzinger, Monika H. “The State of the Art in Dynamic Graph Algorithms.”
In 44th International Conference on Current Trends in Theory and Practice of
Computer Science, 10706:40–44. Springer Nature, 2017. https://doi.org/10.1007/978-3-319-73117-9_3.
ieee: M. H. Henzinger, “The state of the art in dynamic graph algorithms,” in 44th
International Conference on Current Trends in Theory and Practice of Computer
Science, Krems, Austria, 2017, vol. 10706, pp. 40–44.
ista: 'Henzinger MH. 2017. The state of the art in dynamic graph algorithms. 44th
International Conference on Current Trends in Theory and Practice of Computer
Science. SOFSEM: Theory and Practice of Computer Science, LNCS, vol. 10706, 40–44.'
mla: Henzinger, Monika H. “The State of the Art in Dynamic Graph Algorithms.” 44th
International Conference on Current Trends in Theory and Practice of Computer
Science, vol. 10706, Springer Nature, 2017, pp. 40–44, doi:10.1007/978-3-319-73117-9_3.
short: M.H. Henzinger, in:, 44th International Conference on Current Trends in Theory
and Practice of Computer Science, Springer Nature, 2017, pp. 40–44.
conference:
end_date: 2018-02-02
location: Krems, Austria
name: 'SOFSEM: Theory and Practice of Computer Science'
start_date: 2018-01-29
date_created: 2022-08-08T13:16:37Z
date_published: 2017-12-22T00:00:00Z
date_updated: 2023-02-10T08:36:03Z
day: '22'
doi: 10.1007/978-3-319-73117-9_3
extern: '1'
intvolume: ' 10706'
language:
- iso: eng
month: '12'
oa_version: None
page: 40–44
publication: 44th International Conference on Current Trends in Theory and Practice
of Computer Science
publication_identifier:
eisbn:
- '9783319731179'
isbn:
- '9783319731162'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: The state of the art in dynamic graph algorithms
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 10706
year: '2017'
...
---
_id: '1178'
abstract:
- lang: eng
text: 'For any pair (X, Z) of correlated random variables we can think of Z as a
randomized function of X. If the domain of Z is small, one can make this function
computationally efficient by allowing it to be only approximately correct. In
folklore this problem is known as simulating auxiliary inputs. This idea of simulating
auxiliary information turns out to be a very usefull tool, finding applications
in complexity theory, cryptography, pseudorandomness and zero-knowledge. In this
paper we revisit this problem, achieving the following results: (a) We present
a novel boosting algorithm for constructing the simulator. This boosting proof
is of independent interest, as it shows how to handle “negative mass” issues when
constructing probability measures by shifting distinguishers in descent algorithms.
Our technique essentially fixes the flaw in the TCC’14 paper “How to Fake Auxiliary
Inputs”. (b) The complexity of our simulator is better than in previous works,
including results derived from the uniform min-max theorem due to Vadhan and Zheng.
To achieve (s,ϵ) -indistinguishability we need the complexity O(s⋅25ℓϵ−2) in time/circuit
size, which improve previous bounds by a factor of ϵ−2. In particular, with we
get meaningful provable security for the EUROCRYPT’09 leakage-resilient stream
cipher instantiated with a standard 256-bit block cipher, like '
acknowledgement: This work was supported by the National Science Center, Poland (2015/17/N/ST6/03564).
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Maciej
full_name: Skórski, Maciej
id: EC09FA6A-02D0-11E9-8223-86B7C91467DD
last_name: Skórski
citation:
ama: 'Skórski M. Simulating auxiliary inputs, revisited. In: Vol 9985. Springer;
2017:159-179. doi:10.1007/978-3-662-53641-4_7'
apa: 'Skórski, M. (2017). Simulating auxiliary inputs, revisited (Vol. 9985, pp.
159–179). Presented at the TCC: Theory of Cryptography Conference, Springer. https://doi.org/10.1007/978-3-662-53641-4_7'
chicago: Skórski, Maciej. “Simulating Auxiliary Inputs, Revisited,” 9985:159–79.
Springer, 2017. https://doi.org/10.1007/978-3-662-53641-4_7.
ieee: 'M. Skórski, “Simulating auxiliary inputs, revisited,” presented at the TCC:
Theory of Cryptography Conference, 2017, vol. 9985, pp. 159–179.'
ista: 'Skórski M. 2017. Simulating auxiliary inputs, revisited. TCC: Theory of Cryptography
Conference, LNCS, vol. 9985, 159–179.'
mla: Skórski, Maciej. Simulating Auxiliary Inputs, Revisited. Vol. 9985,
Springer, 2017, pp. 159–79, doi:10.1007/978-3-662-53641-4_7.
short: M. Skórski, in:, Springer, 2017, pp. 159–179.
conference:
name: 'TCC: Theory of Cryptography Conference'
date_created: 2018-12-11T11:50:34Z
date_published: 2017-01-01T00:00:00Z
date_updated: 2023-09-20T11:21:57Z
day: '01'
doi: 10.1007/978-3-662-53641-4_7
extern: '1'
external_id:
isi:
- '000390176000007'
intvolume: ' 9985'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: 'https://eprint.iacr.org/2016/808.pdf '
month: '01'
oa: 1
oa_version: Submitted Version
page: 159 - 179
publication_status: published
publisher: Springer
publist_id: '6176'
quality_controlled: '1'
status: public
title: Simulating auxiliary inputs, revisited
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 9985
year: '2017'
...
---
_id: '787'
abstract:
- lang: eng
text: 'Population protocols are a popular model of distributed computing, in which
randomly-interacting agents with little computational power cooperate to jointly
perform computational tasks. Inspired by developments in molecular computation,
and in particular DNA computing, recent algorithmic work has focused on the complexity
of solving simple yet fundamental tasks in the population model, such as leader
election (which requires convergence to a single agent in a special "leader"
state), and majority (in which agents must converge to a decision as to which
of two possible initial states had higher initial count). Known results point
towards an inherent trade-off between the time complexity of such algorithms,
and the space complexity, i.e. size of the memory available to each agent. In
this paper, we explore this trade-off and provide new upper and lower bounds for
majority and leader election. First, we prove a unified lower bound, which relates
the space available per node with the time complexity achievable by a protocol:
for instance, our result implies that any protocol solving either of these tasks
for n agents using O(log log n) states must take (n=polylogn) expected time. This
is the first result to characterize time complexity for protocols which employ
super-constant number of states per node, and proves that fast, poly-logarithmic
running times require protocols to have relatively large space costs. On the positive
side, we give algorithms showing that fast, poly-logarithmic convergence time
can be achieved using O(log2 n) space per node, in the case of both tasks. Overall,
our results highlight a time complexity separation between O(log log n) and (log2
n) state space size for both majority and leader election in population protocols,
and introduce new techniques, which should be applicable more broadly.'
acknowledgement: "Dan Alistarh was supported by a Swiss National Science\r\nFoundation
Ambizione Fellowship. James Aspnes was supported by the National Science Foundation
\ under grants\r\nCCF-1637385 and CCF-1650596. Rati Gelashvili was supported by
\ the National Science Foundation under grants\r\nCCF-1217921, CCF-1301926,
and IIS-1447786, the Department of Energy under grant ER26116/DE-SC0008923, and\r\nOracle
and Intel corporations.\r\nThe authors would like to thank David Doty, David\r\nSoloveichik,
\ and Milan Vojnovic for insightful discussions\r\nand feedback during the development
of this work."
author:
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
- first_name: James
full_name: Aspnes, James
last_name: Aspnes
- first_name: David
full_name: Eisenstat, David
last_name: Eisenstat
- first_name: Ronald
full_name: Rivest, Ronald
last_name: Rivest
- first_name: Rati
full_name: Gelashvili, Rati
last_name: Gelashvili
citation:
ama: 'Alistarh D-A, Aspnes J, Eisenstat D, Rivest R, Gelashvili R. Time-space trade-offs
in population protocols. In: SIAM; 2017:2560-2579. doi:doi.org/10.1137/1.9781611974782.169'
apa: 'Alistarh, D.-A., Aspnes, J., Eisenstat, D., Rivest, R., & Gelashvili,
R. (2017). Time-space trade-offs in population protocols (pp. 2560–2579). Presented
at the SODA: Symposium on Discrete Algorithms, SIAM. https://doi.org/doi.org/10.1137/1.9781611974782.169'
chicago: Alistarh, Dan-Adrian, James Aspnes, David Eisenstat, Ronald Rivest, and
Rati Gelashvili. “Time-Space Trade-Offs in Population Protocols,” 2560–79. SIAM,
2017. https://doi.org/doi.org/10.1137/1.9781611974782.169.
ieee: 'D.-A. Alistarh, J. Aspnes, D. Eisenstat, R. Rivest, and R. Gelashvili, “Time-space
trade-offs in population protocols,” presented at the SODA: Symposium on Discrete
Algorithms, 2017, pp. 2560–2579.'
ista: 'Alistarh D-A, Aspnes J, Eisenstat D, Rivest R, Gelashvili R. 2017. Time-space
trade-offs in population protocols. SODA: Symposium on Discrete Algorithms, 2560–2579.'
mla: Alistarh, Dan-Adrian, et al. Time-Space Trade-Offs in Population Protocols.
SIAM, 2017, pp. 2560–79, doi:doi.org/10.1137/1.9781611974782.169.
short: D.-A. Alistarh, J. Aspnes, D. Eisenstat, R. Rivest, R. Gelashvili, in:, SIAM,
2017, pp. 2560–2579.
conference:
name: 'SODA: Symposium on Discrete Algorithms'
date_created: 2018-12-11T11:48:30Z
date_published: 2017-01-01T00:00:00Z
date_updated: 2023-02-23T13:19:13Z
day: '01'
doi: doi.org/10.1137/1.9781611974782.169
extern: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1602.08032
month: '01'
oa: 1
oa_version: None
page: 2560 - 2579
publication_status: published
publisher: SIAM
publist_id: '6869'
status: public
title: Time-space trade-offs in population protocols
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2017'
...
---
_id: '788'
abstract:
- lang: eng
text: In contrast to electronic computation, chemical computation is noisy and susceptible
to a variety of sources of error, which has prevented the construction of robust
complex systems. To be effective, chemical algorithms must be designed with an
appropriate error model in mind. Here we consider the model of chemical reaction
networks that preserve molecular count (population protocols), and ask whether
computation can be made robust to a natural model of unintended “leak” reactions.
Our definition of leak is motivated by both the particular spurious behavior seen
when implementing chemical reaction networks with DNA strand displacement cascades,
as well as the unavoidable side reactions in any implementation due to the basic
laws of chemistry. We develop a new “Robust Detection” algorithm for the problem
of fast (logarithmic time) single molecule detection, and prove that it is robust
to this general model of leaks. Besides potential applications in single molecule
detection, the error-correction ideas developed here might enable a new class
of robust-by-design chemical algorithms. Our analysis is based on a non-standard
hybrid argument, combining ideas from discrete analysis of population protocols
with classic Markov chain techniques.
acknowledgement: "D. Alistarh - Supported by an SNF Ambizione Fellowship. A. Kosowski
— Supported by Inria project GANG, ANR project DESCARTES, and\r\nNCN grant 2015/17/B/ST6/01897.
D. Soloveichik — Supported by NSF grants CCF-1618895 and CCF-1652824.\r\n\r\n"
alternative_title:
- LNCS
article_processing_charge: No
arxiv: 1
author:
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
- first_name: Bartłomiej
full_name: Dudek, Bartłomiej
last_name: Dudek
- first_name: Adrian
full_name: Kosowski, Adrian
last_name: Kosowski
- first_name: David
full_name: Soloveichik, David
last_name: Soloveichik
- first_name: Przemysław
full_name: Uznański, Przemysław
last_name: Uznański
citation:
ama: 'Alistarh D-A, Dudek B, Kosowski A, Soloveichik D, Uznański P. Robust detection
in leak-prone population protocols. In: Vol 10467 LNCS. Springer; 2017:155-171.
doi:10.1007/978-3-319-66799-7_11'
apa: Alistarh, D.-A., Dudek, B., Kosowski, A., Soloveichik, D., & Uznański,
P. (2017). Robust detection in leak-prone population protocols (Vol. 10467 LNCS,
pp. 155–171). Presented at the DNA Computing and Molecular Programming, Springer.
https://doi.org/10.1007/978-3-319-66799-7_11
chicago: Alistarh, Dan-Adrian, Bartłomiej Dudek, Adrian Kosowski, David Soloveichik,
and Przemysław Uznański. “Robust Detection in Leak-Prone Population Protocols,”
10467 LNCS:155–71. Springer, 2017. https://doi.org/10.1007/978-3-319-66799-7_11.
ieee: D.-A. Alistarh, B. Dudek, A. Kosowski, D. Soloveichik, and P. Uznański, “Robust
detection in leak-prone population protocols,” presented at the DNA Computing
and Molecular Programming, 2017, vol. 10467 LNCS, pp. 155–171.
ista: Alistarh D-A, Dudek B, Kosowski A, Soloveichik D, Uznański P. 2017. Robust
detection in leak-prone population protocols. DNA Computing and Molecular Programming,
LNCS, vol. 10467 LNCS, 155–171.
mla: Alistarh, Dan-Adrian, et al. Robust Detection in Leak-Prone Population Protocols.
Vol. 10467 LNCS, Springer, 2017, pp. 155–71, doi:10.1007/978-3-319-66799-7_11.
short: D.-A. Alistarh, B. Dudek, A. Kosowski, D. Soloveichik, P. Uznański, in:,
Springer, 2017, pp. 155–171.
conference:
name: DNA Computing and Molecular Programming
date_created: 2018-12-11T11:48:30Z
date_published: 2017-01-01T00:00:00Z
date_updated: 2022-03-18T12:48:02Z
day: '01'
doi: 10.1007/978-3-319-66799-7_11
extern: '1'
external_id:
arxiv:
- '1706.09937'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1706.09937
month: '01'
oa: 1
oa_version: None
page: 155 - 171
publication_status: published
publisher: Springer
publist_id: '6868'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Robust detection in leak-prone population protocols
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 10467 LNCS
year: '2017'
...
---
_id: '789'
abstract:
- lang: eng
text: 'The problem of efficient concurrent memory reclamation in unmanaged languages
such as C or C++ is one of the major challenges facing the parallelization of
billions of lines of legacy code. Garbage collectors for C/C++ can be inefficient;
thus, programmers are often forced to use finely-crafted concurrent memory reclamation
techniques. These techniques can provide good performance, but require considerable
programming effort to deploy, and have strict requirements, allowing the programmer
very little room for error. In this work, we present Forkscan, a new conservative
concurrent memory reclamation scheme which is fully automatic and surprisingly
scalable. Forkscan''s semantics place it between automatic garbage collectors
(it requires the programmer to explicitly retire nodes before they can be reclaimed),
and concurrent memory reclamation techniques (as it does not assume that nodes
are completely unlinked from the data structure for correctness). Forkscan''s
implementation exploits these new semantics for efficiency: we leverage parallelism
and optimized implementations of signaling and copy-on-write in modern operating
systems to efficiently obtain and process consistent snapshots of memory that
can be scanned concurrently with the normal program operation. Empirical evaluation
on a range of classical concurrent data structure microbenchmarks shows that Forkscan
can preserve the scalability of the original code, while maintaining an order
of magnitude lower latency than automatic garbage collection, and demonstrating
competitive performance with finely crafted memory reclamation techniques.'
acknowledgement: William Leiserson, Alexander Matveev, and Nir Shavit were supported
by the NSF under grants IIS-1447786 and CCF-1563880, and Dan Alistarh was supported
by a Swiss National Fund Ambizione Fellowship.
article_processing_charge: No
author:
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
- first_name: William
full_name: Leiserson, William
last_name: Leiserson
- first_name: Alexander
full_name: Matveev, Alexander
last_name: Matveev
- first_name: Nir
full_name: Shavit, Nir
last_name: Shavit
citation:
ama: 'Alistarh D-A, Leiserson W, Matveev A, Shavit N. Forkscan: Conservative memory
reclamation for modern operating systems. In: ACM; 2017:483-498. doi:10.1145/3064176.3064214'
apa: 'Alistarh, D.-A., Leiserson, W., Matveev, A., & Shavit, N. (2017). Forkscan:
Conservative memory reclamation for modern operating systems (pp. 483–498). Presented
at the EuroSys: European Conference on Computer Systems, ACM. https://doi.org/10.1145/3064176.3064214'
chicago: 'Alistarh, Dan-Adrian, William Leiserson, Alexander Matveev, and Nir Shavit.
“Forkscan: Conservative Memory Reclamation for Modern Operating Systems,” 483–98.
ACM, 2017. https://doi.org/10.1145/3064176.3064214.'
ieee: 'D.-A. Alistarh, W. Leiserson, A. Matveev, and N. Shavit, “Forkscan: Conservative
memory reclamation for modern operating systems,” presented at the EuroSys: European
Conference on Computer Systems, 2017, pp. 483–498.'
ista: 'Alistarh D-A, Leiserson W, Matveev A, Shavit N. 2017. Forkscan: Conservative
memory reclamation for modern operating systems. EuroSys: European Conference
on Computer Systems, 483–498.'
mla: 'Alistarh, Dan-Adrian, et al. Forkscan: Conservative Memory Reclamation
for Modern Operating Systems. ACM, 2017, pp. 483–98, doi:10.1145/3064176.3064214.'
short: D.-A. Alistarh, W. Leiserson, A. Matveev, N. Shavit, in:, ACM, 2017, pp.
483–498.
conference:
name: 'EuroSys: European Conference on Computer Systems'
date_created: 2018-12-11T11:48:30Z
date_published: 2017-01-01T00:00:00Z
date_updated: 2023-02-23T13:19:44Z
day: '01'
doi: 10.1145/3064176.3064214
extern: '1'
language:
- iso: eng
month: '01'
oa_version: None
page: 483 - 498
publication_status: published
publisher: ACM
publist_id: '6867'
status: public
title: 'Forkscan: Conservative memory reclamation for modern operating systems'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2017'
...
---
_id: '790'
abstract:
- lang: eng
text: Stochastic gradient descent (SGD) is a commonly used algorithm for training
linear machine learning models. Based on vector algebra, it benefits from the
inherent parallelism available in an FPGA. In this paper, we first present a single-precision
floating-point SGD implementation on an FPGA that provides similar performance
as a 10-core CPU. We then adapt the design to make it capable of processing low-precision
data. The low-precision data is obtained from a novel compression scheme - called
stochastic quantization, specifically designed for machine learning applications.
We test both full-precision and low-precision designs on various regression and
classification data sets. We achieve up to an order of magnitude training speedup
when using low-precision data compared to a full-precision SGD on the same FPGA
and a state-of-the-art multi-core solution, while maintaining the quality of training.
We open source the designs presented in this paper.
article_processing_charge: No
author:
- first_name: Kaan
full_name: Kara, Kaan
last_name: Kara
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
- first_name: Gustavo
full_name: Alonso, Gustavo
last_name: Alonso
- first_name: Onur
full_name: Mutlu, Onur
last_name: Mutlu
- first_name: Ce
full_name: Zhang, Ce
last_name: Zhang
citation:
ama: 'Kara K, Alistarh D-A, Alonso G, Mutlu O, Zhang C. FPGA-accelerated dense linear
machine learning: A precision-convergence trade-off. In: IEEE; 2017:160-167. doi:10.1109/FCCM.2017.39'
apa: 'Kara, K., Alistarh, D.-A., Alonso, G., Mutlu, O., & Zhang, C. (2017).
FPGA-accelerated dense linear machine learning: A precision-convergence trade-off
(pp. 160–167). Presented at the FCCM: Field-Programmable Custom Computing Machines,
IEEE. https://doi.org/10.1109/FCCM.2017.39'
chicago: 'Kara, Kaan, Dan-Adrian Alistarh, Gustavo Alonso, Onur Mutlu, and Ce Zhang.
“FPGA-Accelerated Dense Linear Machine Learning: A Precision-Convergence Trade-Off,”
160–67. IEEE, 2017. https://doi.org/10.1109/FCCM.2017.39.'
ieee: 'K. Kara, D.-A. Alistarh, G. Alonso, O. Mutlu, and C. Zhang, “FPGA-accelerated
dense linear machine learning: A precision-convergence trade-off,” presented at
the FCCM: Field-Programmable Custom Computing Machines, 2017, pp. 160–167.'
ista: 'Kara K, Alistarh D-A, Alonso G, Mutlu O, Zhang C. 2017. FPGA-accelerated
dense linear machine learning: A precision-convergence trade-off. FCCM: Field-Programmable
Custom Computing Machines, 160–167.'
mla: 'Kara, Kaan, et al. FPGA-Accelerated Dense Linear Machine Learning: A Precision-Convergence
Trade-Off. IEEE, 2017, pp. 160–67, doi:10.1109/FCCM.2017.39.'
short: K. Kara, D.-A. Alistarh, G. Alonso, O. Mutlu, C. Zhang, in:, IEEE, 2017,
pp. 160–167.
conference:
name: 'FCCM: Field-Programmable Custom Computing Machines'
date_created: 2018-12-11T11:48:31Z
date_published: 2017-06-30T00:00:00Z
date_updated: 2023-02-23T13:19:52Z
day: '30'
doi: 10.1109/FCCM.2017.39
extern: '1'
language:
- iso: eng
month: '06'
oa_version: None
page: 160 - 167
publication_status: published
publisher: IEEE
publist_id: '6865'
status: public
title: 'FPGA-accelerated dense linear machine learning: A precision-convergence trade-off'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2017'
...
---
_id: '791'
abstract:
- lang: eng
text: 'Consider the following random process: we are given n queues, into which
elements of increasing labels are inserted uniformly at random. To remove an element,
we pick two queues at random, and remove the element of lower label (higher priority)
among the two. The cost of a removal is the rank of the label removed, among labels
still present in any of the queues, that is, the distance from the optimal choice
at each step. Variants of this strategy are prevalent in state-of-the-art concurrent
priority queue implementations. Nonetheless, it is not known whether such implementations
provide any rank guarantees, even in a sequential model. We answer this question,
showing that this strategy provides surprisingly strong guarantees: Although the
single-choice process, where we always insert and remove from a single randomly
chosen queue, has degrading cost, going to infinity as we increase the number
of steps, in the two choice process, the expected rank of a removed element is
O(n) while the expected worst-case cost is O(n log n). These bounds are tight,
and hold irrespective of the number of steps for which we run the process. The
argument is based on a new technical connection between "heavily loaded"
balls-into-bins processes and priority scheduling. Our analytic results inspire
a new concurrent priority queue implementation, which improves upon the state
of the art in terms of practical performance.'
article_processing_charge: No
author:
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
- first_name: Justin
full_name: Kopinsky, Justin
last_name: Kopinsky
- first_name: Jerry
full_name: Li, Jerry
last_name: Li
- first_name: Giorgi
full_name: Nadiradze, Giorgi
id: 3279A00C-F248-11E8-B48F-1D18A9856A87
last_name: Nadiradze
orcid: 0000-0001-5634-0731
citation:
ama: 'Alistarh D-A, Kopinsky J, Li J, Nadiradze G. The power of choice in priority
scheduling. In: Proceedings of the ACM Symposium on Principles of Distributed
Computing. Vol Part F129314. ACM; 2017:283-292. doi:10.1145/3087801.3087810'
apa: 'Alistarh, D.-A., Kopinsky, J., Li, J., & Nadiradze, G. (2017). The power
of choice in priority scheduling. In Proceedings of the ACM Symposium on Principles
of Distributed Computing (Vol. Part F129314, pp. 283–292). Washington, WA,
USA: ACM. https://doi.org/10.1145/3087801.3087810'
chicago: Alistarh, Dan-Adrian, Justin Kopinsky, Jerry Li, and Giorgi Nadiradze.
“The Power of Choice in Priority Scheduling.” In Proceedings of the ACM Symposium
on Principles of Distributed Computing, Part F129314:283–92. ACM, 2017. https://doi.org/10.1145/3087801.3087810.
ieee: D.-A. Alistarh, J. Kopinsky, J. Li, and G. Nadiradze, “The power of choice
in priority scheduling,” in Proceedings of the ACM Symposium on Principles
of Distributed Computing, Washington, WA, USA, 2017, vol. Part F129314, pp.
283–292.
ista: 'Alistarh D-A, Kopinsky J, Li J, Nadiradze G. 2017. The power of choice in
priority scheduling. Proceedings of the ACM Symposium on Principles of Distributed
Computing. PODC: Principles of Distributed Computing vol. Part F129314, 283–292.'
mla: Alistarh, Dan-Adrian, et al. “The Power of Choice in Priority Scheduling.”
Proceedings of the ACM Symposium on Principles of Distributed Computing,
vol. Part F129314, ACM, 2017, pp. 283–92, doi:10.1145/3087801.3087810.
short: D.-A. Alistarh, J. Kopinsky, J. Li, G. Nadiradze, in:, Proceedings of the
ACM Symposium on Principles of Distributed Computing, ACM, 2017, pp. 283–292.
conference:
end_date: 2017-07-27
location: Washington, WA, USA
name: 'PODC: Principles of Distributed Computing'
start_date: 2017-07-25
date_created: 2018-12-11T11:48:31Z
date_published: 2017-07-26T00:00:00Z
date_updated: 2023-09-27T12:17:59Z
day: '26'
department:
- _id: DaAl
doi: 10.1145/3087801.3087810
external_id:
isi:
- '000462995000035'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1706.04178
month: '07'
oa: 1
oa_version: Submitted Version
page: 283 - 292
publication: Proceedings of the ACM Symposium on Principles of Distributed Computing
publication_identifier:
isbn:
- 978-145034992-5
publication_status: published
publisher: ACM
publist_id: '6864'
quality_controlled: '1'
scopus_import: '1'
status: public
title: The power of choice in priority scheduling
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: Part F129314
year: '2017'
...
---
_id: '792'
abstract:
- lang: eng
text: The chaotic dynamics of low-dimensional systems, such as Lorenz or Rössler
flows, is guided by the infinity of periodic orbits embedded in their strange
attractors. Whether this is also the case for the infinite-dimensional dynamics
of Navier–Stokes equations has long been speculated, and is a topic of ongoing
study. Periodic and relative periodic solutions have been shown to be involved
in transitions to turbulence. Their relevance to turbulent dynamics – specifically,
whether periodic orbits play the same role in high-dimensional nonlinear systems
like the Navier–Stokes equations as they do in lower-dimensional systems – is
the focus of the present investigation. We perform here a detailed study of pipe
flow relative periodic orbits with energies and mean dissipations close to turbulent
values. We outline several approaches to reduction of the translational symmetry
of the system. We study pipe flow in a minimal computational cell at Re=2500,
and report a library of invariant solutions found with the aid of the method of
slices. Detailed study of the unstable manifolds of a sample of these solutions
is consistent with the picture that relative periodic orbits are embedded in the
chaotic saddle and that they guide the turbulent dynamics.
article_processing_charge: No
author:
- first_name: Nazmi B
full_name: Budanur, Nazmi B
id: 3EA1010E-F248-11E8-B48F-1D18A9856A87
last_name: Budanur
orcid: 0000-0003-0423-5010
- first_name: Kimberly
full_name: Short, Kimberly
last_name: Short
- first_name: Mohammad
full_name: Farazmand, Mohammad
last_name: Farazmand
- first_name: Ashley
full_name: Willis, Ashley
last_name: Willis
- first_name: Predrag
full_name: Cvitanović, Predrag
last_name: Cvitanović
citation:
ama: Budanur NB, Short K, Farazmand M, Willis A, Cvitanović P. Relative periodic
orbits form the backbone of turbulent pipe flow. Journal of Fluid Mechanics.
2017;833:274-301. doi:10.1017/jfm.2017.699
apa: Budanur, N. B., Short, K., Farazmand, M., Willis, A., & Cvitanović, P.
(2017). Relative periodic orbits form the backbone of turbulent pipe flow. Journal
of Fluid Mechanics. Cambridge University Press. https://doi.org/10.1017/jfm.2017.699
chicago: Budanur, Nazmi B, Kimberly Short, Mohammad Farazmand, Ashley Willis, and
Predrag Cvitanović. “Relative Periodic Orbits Form the Backbone of Turbulent Pipe
Flow.” Journal of Fluid Mechanics. Cambridge University Press, 2017. https://doi.org/10.1017/jfm.2017.699.
ieee: N. B. Budanur, K. Short, M. Farazmand, A. Willis, and P. Cvitanović, “Relative
periodic orbits form the backbone of turbulent pipe flow,” Journal of Fluid
Mechanics, vol. 833. Cambridge University Press, pp. 274–301, 2017.
ista: Budanur NB, Short K, Farazmand M, Willis A, Cvitanović P. 2017. Relative periodic
orbits form the backbone of turbulent pipe flow. Journal of Fluid Mechanics. 833,
274–301.
mla: Budanur, Nazmi B., et al. “Relative Periodic Orbits Form the Backbone of Turbulent
Pipe Flow.” Journal of Fluid Mechanics, vol. 833, Cambridge University
Press, 2017, pp. 274–301, doi:10.1017/jfm.2017.699.
short: N.B. Budanur, K. Short, M. Farazmand, A. Willis, P. Cvitanović, Journal of
Fluid Mechanics 833 (2017) 274–301.
date_created: 2018-12-11T11:48:32Z
date_published: 2017-12-25T00:00:00Z
date_updated: 2023-09-27T12:17:35Z
day: '25'
department:
- _id: BjHo
doi: 10.1017/jfm.2017.699
external_id:
isi:
- '000414641700001'
intvolume: ' 833'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1705.03720
month: '12'
oa: 1
oa_version: Submitted Version
page: 274 - 301
project:
- _id: 25636330-B435-11E9-9278-68D0E5697425
grant_number: 11-NSF-1070
name: ROOTS Genome-wide Analysis of Root Traits
publication: Journal of Fluid Mechanics
publication_identifier:
issn:
- '00221120'
publication_status: published
publisher: Cambridge University Press
publist_id: '6862'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Relative periodic orbits form the backbone of turbulent pipe flow
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 833
year: '2017'
...
---
_id: '793'
abstract:
- lang: eng
text: 'Let P be a finite point set in the plane. A cordinary triangle in P is a
subset of P consisting of three non-collinear points such that each of the three
lines determined by the three points contains at most c points of P . Motivated
by a question of Erdös, and answering a question of de Zeeuw, we prove that there
exists a constant c > 0such that P contains a c-ordinary triangle, provided
that P is not contained in the union of two lines. Furthermore, the number of
c-ordinary triangles in P is Ω(| P |). '
article_processing_charge: No
author:
- first_name: Radoslav
full_name: Fulek, Radoslav
id: 39F3FFE4-F248-11E8-B48F-1D18A9856A87
last_name: Fulek
orcid: 0000-0001-8485-1774
- first_name: Hossein
full_name: Mojarrad, Hossein
last_name: Mojarrad
- first_name: Márton
full_name: Naszódi, Márton
last_name: Naszódi
- first_name: József
full_name: Solymosi, József
last_name: Solymosi
- first_name: Sebastian
full_name: Stich, Sebastian
last_name: Stich
- first_name: May
full_name: Szedlák, May
last_name: Szedlák
citation:
ama: 'Fulek R, Mojarrad H, Naszódi M, Solymosi J, Stich S, Szedlák M. On the existence
of ordinary triangles. Computational Geometry: Theory and Applications.
2017;66:28-31. doi:10.1016/j.comgeo.2017.07.002'
apa: 'Fulek, R., Mojarrad, H., Naszódi, M., Solymosi, J., Stich, S., & Szedlák,
M. (2017). On the existence of ordinary triangles. Computational Geometry:
Theory and Applications. Elsevier. https://doi.org/10.1016/j.comgeo.2017.07.002'
chicago: 'Fulek, Radoslav, Hossein Mojarrad, Márton Naszódi, József Solymosi, Sebastian
Stich, and May Szedlák. “On the Existence of Ordinary Triangles.” Computational
Geometry: Theory and Applications. Elsevier, 2017. https://doi.org/10.1016/j.comgeo.2017.07.002.'
ieee: 'R. Fulek, H. Mojarrad, M. Naszódi, J. Solymosi, S. Stich, and M. Szedlák,
“On the existence of ordinary triangles,” Computational Geometry: Theory and
Applications, vol. 66. Elsevier, pp. 28–31, 2017.'
ista: 'Fulek R, Mojarrad H, Naszódi M, Solymosi J, Stich S, Szedlák M. 2017. On
the existence of ordinary triangles. Computational Geometry: Theory and Applications.
66, 28–31.'
mla: 'Fulek, Radoslav, et al. “On the Existence of Ordinary Triangles.” Computational
Geometry: Theory and Applications, vol. 66, Elsevier, 2017, pp. 28–31, doi:10.1016/j.comgeo.2017.07.002.'
short: 'R. Fulek, H. Mojarrad, M. Naszódi, J. Solymosi, S. Stich, M. Szedlák, Computational
Geometry: Theory and Applications 66 (2017) 28–31.'
date_created: 2018-12-11T11:48:32Z
date_published: 2017-01-01T00:00:00Z
date_updated: 2023-09-27T12:15:16Z
day: '01'
department:
- _id: UlWa
doi: 10.1016/j.comgeo.2017.07.002
ec_funded: 1
external_id:
isi:
- '000412039700003'
intvolume: ' 66'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1701.08183
month: '01'
oa: 1
oa_version: Submitted Version
page: 28 - 31
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication: 'Computational Geometry: Theory and Applications'
publication_identifier:
issn:
- '09257721'
publication_status: published
publisher: Elsevier
publist_id: '6861'
quality_controlled: '1'
status: public
title: On the existence of ordinary triangles
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 66
year: '2017'
...
---
_id: '794'
abstract:
- lang: eng
text: We show that c-planarity is solvable in quadratic time for flat clustered
graphs with three clusters if the combinatorial embedding of the underlying graph
is fixed. In simpler graph-theoretical terms our result can be viewed as follows.
Given a graph G with the vertex set partitioned into three parts embedded on a
2-sphere, our algorithm decides if we can augment G by adding edges without creating
an edge-crossing so that in the resulting spherical graph the vertices of each
part induce a connected sub-graph. We proceed by a reduction to the problem of
testing the existence of a perfect matching in planar bipartite graphs. We formulate
our result in a slightly more general setting of cyclic clustered graphs, i.e.,
the simple graph obtained by contracting each cluster, where we disregard loops
and multi-edges, is a cycle.
acknowledgement: I would like to thank Jan Kynčl, Dömötör Pálvölgyi and anonymous
referees for many comments and suggestions that helped to improve the presentation
of the result.
article_processing_charge: No
author:
- first_name: Radoslav
full_name: Fulek, Radoslav
id: 39F3FFE4-F248-11E8-B48F-1D18A9856A87
last_name: Fulek
orcid: 0000-0001-8485-1774
citation:
ama: 'Fulek R. C-planarity of embedded cyclic c-graphs. Computational Geometry:
Theory and Applications. 2017;66:1-13. doi:10.1016/j.comgeo.2017.06.016'
apa: 'Fulek, R. (2017). C-planarity of embedded cyclic c-graphs. Computational
Geometry: Theory and Applications. Elsevier. https://doi.org/10.1016/j.comgeo.2017.06.016'
chicago: 'Fulek, Radoslav. “C-Planarity of Embedded Cyclic c-Graphs.” Computational
Geometry: Theory and Applications. Elsevier, 2017. https://doi.org/10.1016/j.comgeo.2017.06.016.'
ieee: 'R. Fulek, “C-planarity of embedded cyclic c-graphs,” Computational Geometry:
Theory and Applications, vol. 66. Elsevier, pp. 1–13, 2017.'
ista: 'Fulek R. 2017. C-planarity of embedded cyclic c-graphs. Computational Geometry:
Theory and Applications. 66, 1–13.'
mla: 'Fulek, Radoslav. “C-Planarity of Embedded Cyclic c-Graphs.” Computational
Geometry: Theory and Applications, vol. 66, Elsevier, 2017, pp. 1–13, doi:10.1016/j.comgeo.2017.06.016.'
short: 'R. Fulek, Computational Geometry: Theory and Applications 66 (2017) 1–13.'
date_created: 2018-12-11T11:48:32Z
date_published: 2017-12-01T00:00:00Z
date_updated: 2023-09-27T12:14:49Z
day: '01'
department:
- _id: UlWa
doi: 10.1016/j.comgeo.2017.06.016
external_id:
isi:
- '000412039700001'
intvolume: ' 66'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1602.01346
month: '12'
oa: 1
oa_version: Preprint
page: 1 - 13
publication: 'Computational Geometry: Theory and Applications'
publication_status: published
publisher: Elsevier
publist_id: '6860'
quality_controlled: '1'
related_material:
record:
- id: '1165'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: C-planarity of embedded cyclic c-graphs
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 66
year: '2017'
...
---
_id: '795'
abstract:
- lang: eng
text: 'We introduce a common generalization of the strong Hanani–Tutte theorem and
the weak Hanani–Tutte theorem: if a graph G has a drawing D in the plane where
every pair of independent edges crosses an even number of times, then G has a
planar drawing preserving the rotation of each vertex whose incident edges cross
each other evenly in D. The theorem is implicit in the proof of the strong Hanani–Tutte
theorem by Pelsmajer, Schaefer and Štefankovič. We give a new, somewhat simpler
proof.'
article_number: P3.18
article_processing_charge: No
article_type: original
author:
- first_name: Radoslav
full_name: Fulek, Radoslav
id: 39F3FFE4-F248-11E8-B48F-1D18A9856A87
last_name: Fulek
orcid: 0000-0001-8485-1774
- first_name: Jan
full_name: Kynčl, Jan
last_name: Kynčl
- first_name: Dömötör
full_name: Pálvölgyi, Dömötör
last_name: Pálvölgyi
citation:
ama: Fulek R, Kynčl J, Pálvölgyi D. Unified Hanani Tutte theorem. Electronic
Journal of Combinatorics. 2017;24(3). doi:10.37236/6663
apa: Fulek, R., Kynčl, J., & Pálvölgyi, D. (2017). Unified Hanani Tutte theorem.
Electronic Journal of Combinatorics. International Press. https://doi.org/10.37236/6663
chicago: Fulek, Radoslav, Jan Kynčl, and Dömötör Pálvölgyi. “Unified Hanani Tutte
Theorem.” Electronic Journal of Combinatorics. International Press, 2017.
https://doi.org/10.37236/6663.
ieee: R. Fulek, J. Kynčl, and D. Pálvölgyi, “Unified Hanani Tutte theorem,” Electronic
Journal of Combinatorics, vol. 24, no. 3. International Press, 2017.
ista: Fulek R, Kynčl J, Pálvölgyi D. 2017. Unified Hanani Tutte theorem. Electronic
Journal of Combinatorics. 24(3), P3.18.
mla: Fulek, Radoslav, et al. “Unified Hanani Tutte Theorem.” Electronic Journal
of Combinatorics, vol. 24, no. 3, P3.18, International Press, 2017, doi:10.37236/6663.
short: R. Fulek, J. Kynčl, D. Pálvölgyi, Electronic Journal of Combinatorics 24
(2017).
date_created: 2018-12-11T11:48:32Z
date_published: 2017-07-28T00:00:00Z
date_updated: 2022-03-18T12:58:53Z
day: '28'
ddc:
- '000'
department:
- _id: UlWa
doi: 10.37236/6663
ec_funded: 1
file:
- access_level: open_access
checksum: ef320cff0f062051e858f929be6a3581
content_type: application/pdf
creator: dernst
date_created: 2019-01-18T14:04:08Z
date_updated: 2020-07-14T12:48:06Z
file_id: '5853'
file_name: 2017_ElectrCombi_Fulek.pdf
file_size: 236944
relation: main_file
file_date_updated: 2020-07-14T12:48:06Z
has_accepted_license: '1'
intvolume: ' 24'
issue: '3'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication: Electronic Journal of Combinatorics
publication_identifier:
issn:
- '10778926'
publication_status: published
publisher: International Press
publist_id: '6859'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Unified Hanani Tutte theorem
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 24
year: '2017'
...
---
_id: '796'
abstract:
- lang: eng
text: We present the fabrication and characterization of an aluminum transmon qubit
on a silicon-on-insulator substrate. Key to the qubit fabrication is the use of
an anhydrous hydrofluoric vapor process which selectively removes the lossy silicon
oxide buried underneath the silicon device layer. For a 5.6 GHz qubit measured
dispersively by a 7.1 GHz resonator, we find T1 = 3.5 μs and T∗2 = 2.2 μs. This
process in principle permits the co-fabrication of silicon photonic and mechanical
elements, providing a route towards chip-scale integration of electro-opto-mechanical
transducers for quantum networking of superconducting microwave quantum circuits.
The additional processing steps are compatible with established fabrication techniques
for aluminum transmon qubits on silicon.
acknowledgement: This work was supported by the AFOSR MURI Quantum Photonic Matter
(Grant No. 16RT0696), the AFOSR MURI Wiring Quantum Networks with Mechanical Transducers
(Grant No. FA9550-15-1-0015), the Institute for Quantum Information and Matter,
an NSF Physics Frontiers Center (Grant No. PHY-1125565) with the support of the
Gordon and Betty Moore Foundation, and the Kavli Nanoscience Institute at Caltech.
A.J.K. acknowledges the IQIM Postdoctoral Fellowship.
article_number: '042603'
article_processing_charge: No
author:
- first_name: Andrew J
full_name: Keller, Andrew J
last_name: Keller
- first_name: Paul
full_name: Dieterle, Paul
last_name: Dieterle
- first_name: Michael
full_name: Fang, Michael
last_name: Fang
- first_name: Brett
full_name: Berger, Brett
last_name: Berger
- first_name: Johannes M
full_name: Fink, Johannes M
id: 4B591CBA-F248-11E8-B48F-1D18A9856A87
last_name: Fink
orcid: 0000-0001-8112-028X
- first_name: Oskar
full_name: Painter, Oskar
last_name: Painter
citation:
ama: Keller AJ, Dieterle P, Fang M, Berger B, Fink JM, Painter O. Al transmon qubits
on silicon on insulator for quantum device integration. Applied Physics Letters.
2017;111(4). doi:10.1063/1.4994661
apa: Keller, A. J., Dieterle, P., Fang, M., Berger, B., Fink, J. M., & Painter,
O. (2017). Al transmon qubits on silicon on insulator for quantum device integration.
Applied Physics Letters. American Institute of Physics. https://doi.org/10.1063/1.4994661
chicago: Keller, Andrew J, Paul Dieterle, Michael Fang, Brett Berger, Johannes M
Fink, and Oskar Painter. “Al Transmon Qubits on Silicon on Insulator for Quantum
Device Integration.” Applied Physics Letters. American Institute of Physics,
2017. https://doi.org/10.1063/1.4994661.
ieee: A. J. Keller, P. Dieterle, M. Fang, B. Berger, J. M. Fink, and O. Painter,
“Al transmon qubits on silicon on insulator for quantum device integration,” Applied
Physics Letters, vol. 111, no. 4. American Institute of Physics, 2017.
ista: Keller AJ, Dieterle P, Fang M, Berger B, Fink JM, Painter O. 2017. Al transmon
qubits on silicon on insulator for quantum device integration. Applied Physics
Letters. 111(4), 042603.
mla: Keller, Andrew J., et al. “Al Transmon Qubits on Silicon on Insulator for Quantum
Device Integration.” Applied Physics Letters, vol. 111, no. 4, 042603,
American Institute of Physics, 2017, doi:10.1063/1.4994661.
short: A.J. Keller, P. Dieterle, M. Fang, B. Berger, J.M. Fink, O. Painter, Applied
Physics Letters 111 (2017).
date_created: 2018-12-11T11:48:33Z
date_published: 2017-07-01T00:00:00Z
date_updated: 2023-09-27T12:13:36Z
day: '01'
department:
- _id: JoFi
doi: 10.1063/1.4994661
external_id:
isi:
- '000406779700031'
intvolume: ' 111'
isi: 1
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1703.10195
month: '07'
oa: 1
oa_version: Submitted Version
publication: Applied Physics Letters
publication_identifier:
issn:
- '00036951'
publication_status: published
publisher: American Institute of Physics
publist_id: '6857'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Al transmon qubits on silicon on insulator for quantum device integration
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 111
year: '2017'
...
---
_id: '797'
abstract:
- lang: ger
text: Phasenübergänge helfen beim Verständnis von Vielteilchensystemen in der Festkörperphysik
und Fluiddynamik bis hin zur Teilchenphysik. Unserer internationalen Kollaboration
ist es gelungen, einen neuartigen Phasenübergang in einem Quantensystem zu beobachten
[1]. In einem Mikrowellenresonator konnte erstmals die spontane Zustandsänderung
von undurchsichtig zu transparent nachgewiesen werden.
article_processing_charge: No
article_type: original
author:
- first_name: Johannes M
full_name: Fink, Johannes M
id: 4B591CBA-F248-11E8-B48F-1D18A9856A87
last_name: Fink
orcid: 0000-0001-8112-028X
citation:
ama: Fink JM. Photonenblockade aufgelöst. Physik in unserer Zeit. 2017;48(3):111-113.
doi:10.1002/piuz.201770305
apa: Fink, J. M. (2017). Photonenblockade aufgelöst. Physik in Unserer Zeit.
Wiley. https://doi.org/10.1002/piuz.201770305
chicago: Fink, Johannes M. “Photonenblockade Aufgelöst.” Physik in Unserer Zeit.
Wiley, 2017. https://doi.org/10.1002/piuz.201770305.
ieee: J. M. Fink, “Photonenblockade aufgelöst,” Physik in unserer Zeit, vol.
48, no. 3. Wiley, pp. 111–113, 2017.
ista: Fink JM. 2017. Photonenblockade aufgelöst. Physik in unserer Zeit. 48(3),
111–113.
mla: Fink, Johannes M. “Photonenblockade Aufgelöst.” Physik in Unserer Zeit,
vol. 48, no. 3, Wiley, 2017, pp. 111–13, doi:10.1002/piuz.201770305.
short: J.M. Fink, Physik in Unserer Zeit 48 (2017) 111–113.
date_created: 2018-12-11T11:48:33Z
date_published: 2017-05-01T00:00:00Z
date_updated: 2022-03-24T09:16:20Z
day: '01'
department:
- _id: JoFi
doi: 10.1002/piuz.201770305
intvolume: ' 48'
issue: '3'
language:
- iso: eng
month: '05'
oa_version: None
page: 111 - 113
publication: Physik in unserer Zeit
publication_status: published
publisher: Wiley
publist_id: '6856'
quality_controlled: '1'
status: public
title: Photonenblockade aufgelöst
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 48
year: '2017'
...
---
_id: '798'
abstract:
- lang: eng
text: Nonreciprocal circuit elements form an integral part of modern measurement
and communication systems. Mathematically they require breaking of time-reversal
symmetry, typically achieved using magnetic materials and more recently using
the quantum Hall effect, parametric permittivity modulation or Josephson nonlinearities.
Here we demonstrate an on-chip magnetic-free circulator based on reservoir-engineered
electromechanic interactions. Directional circulation is achieved with controlled
phase-sensitive interference of six distinct electro-mechanical signal conversion
paths. The presented circulator is compact, its silicon-on-insulator platform
is compatible with both superconducting qubits and silicon photonics, and its
noise performance is close to the quantum limit. With a high dynamic range, a
tunable bandwidth of up to 30 MHz and an in situ reconfigurability as beam splitter
or wavelength converter, it could pave the way for superconducting qubit processors
with multiplexed on-chip signal processing and readout.
article_number: '1304'
article_processing_charge: Yes (in subscription journal)
author:
- first_name: Shabir
full_name: Barzanjeh, Shabir
id: 2D25E1F6-F248-11E8-B48F-1D18A9856A87
last_name: Barzanjeh
orcid: 0000-0003-0415-1423
- first_name: Matthias
full_name: Wulf, Matthias
id: 45598606-F248-11E8-B48F-1D18A9856A87
last_name: Wulf
orcid: 0000-0001-6613-1378
- first_name: Matilda
full_name: Peruzzo, Matilda
id: 3F920B30-F248-11E8-B48F-1D18A9856A87
last_name: Peruzzo
orcid: 0000-0002-3415-4628
- first_name: Mahmoud
full_name: Kalaee, Mahmoud
last_name: Kalaee
- first_name: Paul
full_name: Dieterle, Paul
last_name: Dieterle
- first_name: Oskar
full_name: Painter, Oskar
last_name: Painter
- first_name: Johannes M
full_name: Fink, Johannes M
id: 4B591CBA-F248-11E8-B48F-1D18A9856A87
last_name: Fink
orcid: 0000-0001-8112-028X
citation:
ama: Barzanjeh S, Wulf M, Peruzzo M, et al. Mechanical on chip microwave circulator.
Nature Communications. 2017;8(1). doi:10.1038/s41467-017-01304-x
apa: Barzanjeh, S., Wulf, M., Peruzzo, M., Kalaee, M., Dieterle, P., Painter, O.,
& Fink, J. M. (2017). Mechanical on chip microwave circulator. Nature Communications.
Nature Publishing Group. https://doi.org/10.1038/s41467-017-01304-x
chicago: Barzanjeh, Shabir, Matthias Wulf, Matilda Peruzzo, Mahmoud Kalaee, Paul
Dieterle, Oskar Painter, and Johannes M Fink. “Mechanical on Chip Microwave Circulator.”
Nature Communications. Nature Publishing Group, 2017. https://doi.org/10.1038/s41467-017-01304-x.
ieee: S. Barzanjeh et al., “Mechanical on chip microwave circulator,” Nature
Communications, vol. 8, no. 1. Nature Publishing Group, 2017.
ista: Barzanjeh S, Wulf M, Peruzzo M, Kalaee M, Dieterle P, Painter O, Fink JM.
2017. Mechanical on chip microwave circulator. Nature Communications. 8(1), 1304.
mla: Barzanjeh, Shabir, et al. “Mechanical on Chip Microwave Circulator.” Nature
Communications, vol. 8, no. 1, 1304, Nature Publishing Group, 2017, doi:10.1038/s41467-017-01304-x.
short: S. Barzanjeh, M. Wulf, M. Peruzzo, M. Kalaee, P. Dieterle, O. Painter, J.M.
Fink, Nature Communications 8 (2017).
date_created: 2018-12-11T11:48:33Z
date_published: 2017-10-16T00:00:00Z
date_updated: 2023-09-27T12:11:28Z
day: '16'
ddc:
- '539'
department:
- _id: JoFi
doi: 10.1038/s41467-017-01304-x
ec_funded: 1
external_id:
isi:
- '000412999700021'
file:
- access_level: open_access
checksum: b68dafa71d1834c23b742cd9987a3d5f
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:15:25Z
date_updated: 2020-07-14T12:48:06Z
file_id: '5145'
file_name: IST-2017-867-v1+1_s41467-017-01304-x.pdf
file_size: 1467696
relation: main_file
file_date_updated: 2020-07-14T12:48:06Z
has_accepted_license: '1'
intvolume: ' 8'
isi: 1
issue: '1'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
project:
- _id: 257EB838-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '732894'
name: Hybrid Optomechanical Technologies
- _id: 258047B6-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '707438'
name: 'Microwave-to-Optical Quantum Link: Quantum Teleportation and Quantum Illumination
with cavity Optomechanics'
publication: Nature Communications
publication_identifier:
issn:
- '20411723'
publication_status: published
publisher: Nature Publishing Group
publist_id: '6855'
pubrep_id: '867'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Mechanical on chip microwave circulator
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 8
year: '2017'
...
---
_id: '7980'
abstract:
- lang: eng
text: In this part, the use of polysaccharides, either directly through composite
approaches, or by carbonization will be described. In many cases, materials are
obtained which are competitive in terms of capacitance and cycle lifetime. In
this part, the use of polysaccharides, either directly through composite approaches,
or by carbonization will be described. In many cases, materials are obtained which
are competitive in terms of capacitance and cycle lifetime. The following part
will focus mainly on cellulosic composites with conductive polymers since cellulose
is most abundant and therefore has attracted much more research interest in this
field whereas in the second part also other polysaccharides, such as chitin, xylans,
alginates, pectins, dextrans and caragenaans have been used in carbonization experiments.
alternative_title:
- SpringerBriefs in Molecular Science
article_processing_charge: No
author:
- first_name: Soon
full_name: Yee Liew, Soon
last_name: Yee Liew
- first_name: Wim
full_name: Thielemans, Wim
last_name: Thielemans
- first_name: Stefan Alexander
full_name: Freunberger, Stefan Alexander
id: A8CA28E6-CE23-11E9-AD2D-EC27E6697425
last_name: Freunberger
orcid: 0000-0003-2902-5319
- first_name: Stefan
full_name: Spirk, Stefan
last_name: Spirk
citation:
ama: 'Yee Liew S, Thielemans W, Freunberger SA, Spirk S. Polysaccharides in supercapacitors.
In: Yee Liew S, Thielemans W, Freunberger SA, Spirk S, eds. Polysaccharide
Based Supercapacitors. Springer Nature; 2017:15-53. doi:10.1007/978-3-319-50754-5_2'
apa: Yee Liew, S., Thielemans, W., Freunberger, S. A., & Spirk, S. (2017). Polysaccharides
in supercapacitors. In S. Yee Liew, W. Thielemans, S. A. Freunberger, & S.
Spirk (Eds.), Polysaccharide Based Supercapacitors (pp. 15–53). Springer
Nature. https://doi.org/10.1007/978-3-319-50754-5_2
chicago: Yee Liew, Soon, Wim Thielemans, Stefan Alexander Freunberger, and Stefan
Spirk. “Polysaccharides in Supercapacitors.” In Polysaccharide Based Supercapacitors,
edited by Soon Yee Liew, Wim Thielemans, Stefan Alexander Freunberger, and Stefan
Spirk, 15–53. Springer Nature, 2017. https://doi.org/10.1007/978-3-319-50754-5_2.
ieee: S. Yee Liew, W. Thielemans, S. A. Freunberger, and S. Spirk, “Polysaccharides
in supercapacitors,” in Polysaccharide Based Supercapacitors, S. Yee Liew,
W. Thielemans, S. A. Freunberger, and S. Spirk, Eds. Springer Nature, 2017, pp.
15–53.
ista: 'Yee Liew S, Thielemans W, Freunberger SA, Spirk S. 2017.Polysaccharides in
supercapacitors. In: Polysaccharide Based Supercapacitors. SpringerBriefs in Molecular
Science, , 15–53.'
mla: Yee Liew, Soon, et al. “Polysaccharides in Supercapacitors.” Polysaccharide
Based Supercapacitors, edited by Soon Yee Liew et al., Springer Nature, 2017,
pp. 15–53, doi:10.1007/978-3-319-50754-5_2.
short: S. Yee Liew, W. Thielemans, S.A. Freunberger, S. Spirk, in:, S. Yee Liew,
W. Thielemans, S.A. Freunberger, S. Spirk (Eds.), Polysaccharide Based Supercapacitors,
Springer Nature, 2017, pp. 15–53.
date_created: 2020-06-19T08:11:08Z
date_published: 2017-03-26T00:00:00Z
date_updated: 2021-01-12T08:16:19Z
day: '26'
ddc:
- '540'
- '541'
doi: 10.1007/978-3-319-50754-5_2
editor:
- first_name: Soon
full_name: Yee Liew, Soon
last_name: Yee Liew
- first_name: Wim
full_name: Thielemans, Wim
last_name: Thielemans
- first_name: Stefan Alexander
full_name: Freunberger, Stefan Alexander
id: A8CA28E6-CE23-11E9-AD2D-EC27E6697425
last_name: Freunberger
orcid: 0000-0003-2902-5319
- first_name: Stefan
full_name: Spirk, Stefan
last_name: Spirk
extern: '1'
file:
- access_level: open_access
checksum: 4182aeee32c9263a626a7e522f1934f5
content_type: application/pdf
creator: sfreunbe
date_created: 2020-06-29T14:13:44Z
date_updated: 2020-07-14T12:48:06Z
file_id: '8048'
file_name: Final_EPNOE.pdf
file_size: 3339826
relation: main_file
file_date_updated: 2020-07-14T12:48:06Z
has_accepted_license: '1'
language:
- iso: eng
month: '03'
oa: 1
oa_version: Submitted Version
page: 15-53
publication: Polysaccharide Based Supercapacitors
publication_identifier:
isbn:
- '9783319507538'
- '9783319507545'
issn:
- 2191-5407
- 2191-5415
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
status: public
title: Polysaccharides in supercapacitors
type: book_chapter
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2017'
...
---
_id: '7981'
abstract:
- lang: ger
text: Aprotische Natrium‐O2‐Batterien basieren auf der reversiblen Bildung und Auflösung
von Natriumsuperoxid (NaO2) während des Zellbetriebs. Nebenreaktionen des Elektrolyten
und der Elektrode mit dem stark nukleophilen und basischen NaO2 führen zu mangelhafter
Zyklenstabilität. Seine Reaktivität allein kann die Nebenreaktionen und schlechte
Reversibilität jedoch nicht schlüssig erklären. Hier wird gezeigt, dass Singulett‐Sauerstoff
(1O2) in allen Phasen des Betriebs entsteht und eine Hauptursache für Nebenreaktionen
ist. 1O2 wurde in situ und ex situ mit einem 1O2‐Fänger detektiert, der schnell
und selektiv ein Addukt mit 1O2 bildet. Mechanistisch betrachtet entsteht 1O2
entweder durch protonenunterstützte Disproportionierung von Superoxid während
des Entladens, Lagerns und Ladens unter ca. 3.3 V oder durch direkte elektrochemische
1O2‐Entwicklung über ca. 3.3 V. Spuren von Wasser ermöglichen hohe Kapazitäten,
beschleunigen aber auch Nebenreaktionen. Daher muss das hochreaktive 1O2 unbedingt
kontrolliert werden, um die Zelle reversibel zu betreiben.
article_processing_charge: No
article_type: original
author:
- first_name: Lukas
full_name: Schafzahl, Lukas
last_name: Schafzahl
- first_name: Nika
full_name: Mahne, Nika
last_name: Mahne
- first_name: Bettina
full_name: Schafzahl, Bettina
last_name: Schafzahl
- first_name: Martin
full_name: Wilkening, Martin
last_name: Wilkening
- first_name: Christian
full_name: Slugovc, Christian
last_name: Slugovc
- first_name: Sergey M.
full_name: Borisov, Sergey M.
last_name: Borisov
- first_name: Stefan Alexander
full_name: Freunberger, Stefan Alexander
id: A8CA28E6-CE23-11E9-AD2D-EC27E6697425
last_name: Freunberger
orcid: 0000-0003-2902-5319
citation:
ama: Schafzahl L, Mahne N, Schafzahl B, et al. Singulett-Sauerstoff in der aprotischen
Natrium-O2-Batterie. Angewandte Chemie. 2017;129(49):15934-15938. doi:10.1002/ange.201709351
apa: Schafzahl, L., Mahne, N., Schafzahl, B., Wilkening, M., Slugovc, C., Borisov,
S. M., & Freunberger, S. A. (2017). Singulett-Sauerstoff in der aprotischen
Natrium-O2-Batterie. Angewandte Chemie. Wiley. https://doi.org/10.1002/ange.201709351
chicago: Schafzahl, Lukas, Nika Mahne, Bettina Schafzahl, Martin Wilkening, Christian
Slugovc, Sergey M. Borisov, and Stefan Alexander Freunberger. “Singulett-Sauerstoff
in Der Aprotischen Natrium-O2-Batterie.” Angewandte Chemie. Wiley, 2017.
https://doi.org/10.1002/ange.201709351.
ieee: L. Schafzahl et al., “Singulett-Sauerstoff in der aprotischen Natrium-O2-Batterie,”
Angewandte Chemie, vol. 129, no. 49. Wiley, pp. 15934–15938, 2017.
ista: Schafzahl L, Mahne N, Schafzahl B, Wilkening M, Slugovc C, Borisov SM, Freunberger
SA. 2017. Singulett-Sauerstoff in der aprotischen Natrium-O2-Batterie. Angewandte
Chemie. 129(49), 15934–15938.
mla: Schafzahl, Lukas, et al. “Singulett-Sauerstoff in Der Aprotischen Natrium-O2-Batterie.”
Angewandte Chemie, vol. 129, no. 49, Wiley, 2017, pp. 15934–38, doi:10.1002/ange.201709351.
short: L. Schafzahl, N. Mahne, B. Schafzahl, M. Wilkening, C. Slugovc, S.M. Borisov,
S.A. Freunberger, Angewandte Chemie 129 (2017) 15934–15938.
date_created: 2020-06-19T08:22:06Z
date_published: 2017-12-04T00:00:00Z
date_updated: 2021-01-12T08:16:20Z
day: '04'
ddc:
- '540'
doi: 10.1002/ange.201709351
extern: '1'
file:
- access_level: open_access
checksum: 38f2c2383bc9573f6770c1dba72d7a9a
content_type: application/pdf
creator: dernst
date_created: 2020-06-19T11:39:09Z
date_updated: 2020-07-14T12:48:06Z
file_id: '7987'
file_name: 2017_AngChemieDT_Schafzahl.pdf
file_size: 988125
relation: main_file
file_date_updated: 2020-07-14T12:48:06Z
has_accepted_license: '1'
intvolume: ' 129'
issue: '49'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc/4.0/
month: '12'
oa: 1
oa_version: Published Version
page: 15934-15938
publication: Angewandte Chemie
publication_identifier:
issn:
- 0044-8249
publication_status: published
publisher: Wiley
quality_controlled: '1'
status: public
title: Singulett-Sauerstoff in der aprotischen Natrium-O2-Batterie
tmp:
image: /images/cc_by_nc.png
legal_code_url: https://creativecommons.org/licenses/by-nc/4.0/legalcode
name: Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)
short: CC BY-NC (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 129
year: '2017'
...
---
_id: '7982'
abstract:
- lang: eng
text: Beyond-intercalation batteries promise a step-change in energy storage compared
to intercalation-based lithium-ion and sodium-ion batteries. However, only performance
metrics that include all cell components and operation parameters can tell whether
a true advance over intercalation batteries has been achieved.
article_number: '17091'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Stefan Alexander
full_name: Freunberger, Stefan Alexander
id: A8CA28E6-CE23-11E9-AD2D-EC27E6697425
last_name: Freunberger
orcid: 0000-0003-2902-5319
citation:
ama: Freunberger SA. True performance metrics in beyond-intercalation batteries.
Nature Energy. 2017;2(7). doi:10.1038/nenergy.2017.91
apa: Freunberger, S. A. (2017). True performance metrics in beyond-intercalation
batteries. Nature Energy. Springer Nature. https://doi.org/10.1038/nenergy.2017.91
chicago: Freunberger, Stefan Alexander. “True Performance Metrics in Beyond-Intercalation
Batteries.” Nature Energy. Springer Nature, 2017. https://doi.org/10.1038/nenergy.2017.91.
ieee: S. A. Freunberger, “True performance metrics in beyond-intercalation batteries,”
Nature Energy, vol. 2, no. 7. Springer Nature, 2017.
ista: Freunberger SA. 2017. True performance metrics in beyond-intercalation batteries.
Nature Energy. 2(7), 17091.
mla: Freunberger, Stefan Alexander. “True Performance Metrics in Beyond-Intercalation
Batteries.” Nature Energy, vol. 2, no. 7, 17091, Springer Nature, 2017,
doi:10.1038/nenergy.2017.91.
short: S.A. Freunberger, Nature Energy 2 (2017).
date_created: 2020-06-19T08:23:47Z
date_published: 2017-06-05T00:00:00Z
date_updated: 2021-01-12T08:16:20Z
day: '05'
ddc:
- '540'
- '546'
- '541'
doi: 10.1038/nenergy.2017.91
extern: '1'
external_id:
arxiv:
- '2002.00712'
file:
- access_level: open_access
checksum: 2564255b76f5346a32e764dbfd17fa2f
content_type: application/pdf
creator: sfreunbe
date_created: 2020-06-29T13:26:55Z
date_updated: 2020-07-14T12:48:06Z
file_id: '8046'
file_name: NEnergy_Comment_final.pdf
file_size: 817665
relation: main_file
file_date_updated: 2020-07-14T12:48:06Z
has_accepted_license: '1'
intvolume: ' 2'
issue: '7'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2002.00712
month: '06'
oa: 1
oa_version: Submitted Version
publication: Nature Energy
publication_identifier:
issn:
- 2058-7546
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
status: public
title: True performance metrics in beyond-intercalation batteries
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2
year: '2017'
...
---
_id: '7986'
article_number: '17036 '
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Nika
full_name: Mahne, Nika
last_name: Mahne
- first_name: Bettina
full_name: Schafzahl, Bettina
last_name: Schafzahl
- first_name: Christian
full_name: Leypold, Christian
last_name: Leypold
- first_name: Mario
full_name: Leypold, Mario
last_name: Leypold
- first_name: Sandra
full_name: Grumm, Sandra
last_name: Grumm
- first_name: Anita
full_name: Leitgeb, Anita
last_name: Leitgeb
- first_name: Gernot A.
full_name: Strohmeier, Gernot A.
last_name: Strohmeier
- first_name: Martin
full_name: Wilkening, Martin
last_name: Wilkening
- first_name: Olivier
full_name: Fontaine, Olivier
last_name: Fontaine
- first_name: Denis
full_name: Kramer, Denis
last_name: Kramer
- first_name: Christian
full_name: Slugovc, Christian
last_name: Slugovc
- first_name: Sergey M.
full_name: Borisov, Sergey M.
last_name: Borisov
- first_name: Stefan Alexander
full_name: Freunberger, Stefan Alexander
id: A8CA28E6-CE23-11E9-AD2D-EC27E6697425
last_name: Freunberger
orcid: 0000-0003-2902-5319
citation:
ama: Mahne N, Schafzahl B, Leypold C, et al. Singlet oxygen generation as a major
cause for parasitic reactions during cycling of aprotic lithium–oxygen batteries.
Nature Energy. 2017;2(5). doi:10.1038/nenergy.2017.36
apa: Mahne, N., Schafzahl, B., Leypold, C., Leypold, M., Grumm, S., Leitgeb, A.,
… Freunberger, S. A. (2017). Singlet oxygen generation as a major cause for parasitic
reactions during cycling of aprotic lithium–oxygen batteries. Nature Energy.
Springer Nature. https://doi.org/10.1038/nenergy.2017.36
chicago: Mahne, Nika, Bettina Schafzahl, Christian Leypold, Mario Leypold, Sandra
Grumm, Anita Leitgeb, Gernot A. Strohmeier, et al. “Singlet Oxygen Generation
as a Major Cause for Parasitic Reactions during Cycling of Aprotic Lithium–Oxygen
Batteries.” Nature Energy. Springer Nature, 2017. https://doi.org/10.1038/nenergy.2017.36.
ieee: N. Mahne et al., “Singlet oxygen generation as a major cause for parasitic
reactions during cycling of aprotic lithium–oxygen batteries,” Nature Energy,
vol. 2, no. 5. Springer Nature, 2017.
ista: Mahne N, Schafzahl B, Leypold C, Leypold M, Grumm S, Leitgeb A, Strohmeier
GA, Wilkening M, Fontaine O, Kramer D, Slugovc C, Borisov SM, Freunberger SA.
2017. Singlet oxygen generation as a major cause for parasitic reactions during
cycling of aprotic lithium–oxygen batteries. Nature Energy. 2(5), 17036.
mla: Mahne, Nika, et al. “Singlet Oxygen Generation as a Major Cause for Parasitic
Reactions during Cycling of Aprotic Lithium–Oxygen Batteries.” Nature Energy,
vol. 2, no. 5, 17036, Springer Nature, 2017, doi:10.1038/nenergy.2017.36.
short: N. Mahne, B. Schafzahl, C. Leypold, M. Leypold, S. Grumm, A. Leitgeb, G.A.
Strohmeier, M. Wilkening, O. Fontaine, D. Kramer, C. Slugovc, S.M. Borisov, S.A.
Freunberger, Nature Energy 2 (2017).
date_created: 2020-06-19T10:42:33Z
date_published: 2017-03-20T00:00:00Z
date_updated: 2021-01-12T08:16:21Z
day: '20'
doi: 10.1038/nenergy.2017.36
extern: '1'
external_id:
arxiv:
- '1711.10340'
intvolume: ' 2'
issue: '5'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1711.10340
month: '03'
oa: 1
oa_version: Preprint
publication: Nature Energy
publication_identifier:
issn:
- 2058-7546
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
status: public
title: Singlet oxygen generation as a major cause for parasitic reactions during cycling
of aprotic lithium–oxygen batteries
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2
year: '2017'
...