---
_id: '15364'
abstract:
- lang: eng
text: "Clustering is a fundamental problem in unsupervised machine learning with
many applications in data analysis. Popular clustering algorithms such as Lloyd's
algorithm and k-means++ can make Ω(ndk) time when clustering n points in a d-dimensional
space (represented by an n×d matrix X) into k clusters. On massive datasets with
moderate to large k, the multiplicative \r\nk factor can become very expensive.
We introduce a simple randomized clustering algorithm that provably runs in expected
time O(nnz(X)+nlogn) for arbitrary k. Here nnz(X) is the total number of non-zero
entries in the input dataset X, which is upper bounded by nd and can be significantly
smaller for sparse datasets. We prove that our algorithm achieves approximation
ratio ˜O(k4) on any input dataset for the k-means objective, and our experiments
show that the quality of the clusters found by our algorithm is usually much better
than this worst-case bound. We use our algorithm for k-means clustering and for
coreset construction; our experiments show that it gives a new tradeoff between
running time and cluster quality compared to previous state-of-the-art methods
for these tasks. Our theoretical analysis is based on novel results of independent
interest. We show that the approximation ratio achieved after a random one-dimensional
projection can be lifted to the original points and that k-means++ seeding can
be implemented in expected time O(nlogn) in one dimension."
acknowledgement: "Moses Charikar was supported by a Simons Investigator award. Lunjia
Hu was supported by Moses Charikar’s and Omer Reingold’s Simons Investigators awards,
Omer Reingold’s NSF Award IIS-1908774, and the Simons Foundation Collaboration on
the Theory of Algorithmic Fairness. Part of this work was done while Erik Waingarten
was a postdoc at Stanford University, supported by an NSF postdoctoral fellowship
and by Moses Charikar’s Simons\r\nInvestigator Award. This project has received
funding from the European Research Council (ERC) under the European Union’s Horizon
2020 research and innovation programme\r\n(Grant agreement No. 101019564 “The Design
of Modern Fully Dynamic Data\r\nStructures (MoDynStruct)” and the Austrian Science
Fund (FWF) project Z 422-N, project “Static and Dynamic Hierarchical Graph Decompositions”,
I 5982-N, and project “Fast Algorithms for a Reactive Network Layer (ReactNet)”,
P 33775-N, with additional funding from the netidee SCIENCE Stiftung, 2020–2024."
alternative_title:
- Advances in Neural Information Processing Systems
article_processing_charge: Yes
arxiv: 1
author:
- first_name: Moses
full_name: Charikar, Moses
last_name: Charikar
- first_name: Lunjia
full_name: Hu, Lunjia
last_name: Hu
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Maximilian
full_name: Vötsch, Maximilian
last_name: Vötsch
- first_name: Erik
full_name: Waingarten, Erik
last_name: Waingarten
citation:
ama: 'Charikar M, Hu L, Henzinger M, Vötsch M, Waingarten E. Simple, scalable and
effective clustering via one-dimensional projections. In: 37th Conference on
Neural Information Processing Systems. Vol 36. Neural Information Processing
Systems Foundation; 2023.'
apa: 'Charikar, M., Hu, L., Henzinger, M., Vötsch, M., & Waingarten, E. (2023).
Simple, scalable and effective clustering via one-dimensional projections. In
37th Conference on Neural Information Processing Systems (Vol. 36). New
Orleans, LA, United States: Neural Information Processing Systems Foundation.'
chicago: Charikar, Moses, Lunjia Hu, Monika Henzinger, Maximilian Vötsch, and Erik
Waingarten. “Simple, Scalable and Effective Clustering via One-Dimensional Projections.”
In 37th Conference on Neural Information Processing Systems, Vol. 36. Neural
Information Processing Systems Foundation, 2023.
ieee: M. Charikar, L. Hu, M. Henzinger, M. Vötsch, and E. Waingarten, “Simple, scalable
and effective clustering via one-dimensional projections,” in 37th Conference
on Neural Information Processing Systems, New Orleans, LA, United States,
2023, vol. 36.
ista: 'Charikar M, Hu L, Henzinger M, Vötsch M, Waingarten E. 2023. Simple, scalable
and effective clustering via one-dimensional projections. 37th Conference on Neural
Information Processing Systems. NeurIPS: Neural Information Processing Systems,
Advances in Neural Information Processing Systems, vol. 36.'
mla: Charikar, Moses, et al. “Simple, Scalable and Effective Clustering via One-Dimensional
Projections.” 37th Conference on Neural Information Processing Systems,
vol. 36, Neural Information Processing Systems Foundation, 2023.
short: M. Charikar, L. Hu, M. Henzinger, M. Vötsch, E. Waingarten, in:, 37th Conference
on Neural Information Processing Systems, Neural Information Processing Systems
Foundation, 2023.
conference:
end_date: 2023-12-16
location: New Orleans, LA, United States
name: 'NeurIPS: Neural Information Processing Systems'
start_date: 2023-12-10
das_tickbox: '1'
date_created: 2024-05-05T22:01:05Z
date_published: 2023-12-15T00:00:00Z
date_updated: 2026-07-07T06:37:54Z
day: '15'
ddc:
- '000'
department:
- _id: MoHe
ec_funded: 1
external_id:
arxiv:
- '2310.16752'
file:
- access_level: open_access
checksum: d169a147a2adf55878e0a99e36a9d468
content_type: application/pdf
creator: dernst
date_created: 2024-05-22T07:34:00Z
date_updated: 2024-05-22T07:34:00Z
file_id: '15416'
file_name: 2023_Neurips_Charikar.pdf
file_size: 1445159
relation: main_file
success: 1
file_date_updated: 2024-05-22T07:34:00Z
has_accepted_license: '1'
intvolume: ' 36'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
project:
- _id: bd9ca328-d553-11ed-ba76-dc4f890cfe62
call_identifier: H2020
grant_number: '101019564'
name: The design and evaluation of modern fully dynamic data structures
- _id: 34def286-11ca-11ed-8bc3-da5948e1613c
grant_number: Z00422
name: Efficient algorithms
- _id: bda196b2-d553-11ed-ba76-8e8ee6c21103
grant_number: I05982
name: Static and Dynamic Hierarchical Graph Decompositions
- _id: bd9e3a2e-d553-11ed-ba76-8aa684ce17fe
grant_number: P33775
name: Fast Algorithms for a Reactive Network Layer
publication: 37th Conference on Neural Information Processing Systems
publication_identifier:
issn:
- 1049-5258
publication_status: published
publisher: Neural Information Processing Systems Foundation
quality_controlled: '1'
scopus_import: '1'
status: public
title: Simple, scalable and effective clustering via one-dimensional projections
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: 36
year: '2023'
...
---
_id: '15363'
abstract:
- lang: eng
text: Knowledge distillation is a popular approach for enhancing the performance
of "student" models, with lower representational capacity, by taking advantage
of more powerful "teacher" models. Despite its apparent simplicity, the underlying
mechanics behind knowledge distillation (KD) are not yet fully understood. In
this work, we shed new light on the inner workings of this method, by examining
it from an optimization perspective. Specifically, we show that, in the context
of linear and deep linear models, KD can be interpreted as a novel type of stochastic
variance reduction mechanism. We provide a detailed convergence analysis of the
resulting dynamics, which hold under standard assumptions for both strongly-convex
and non-convex losses, showing that KD acts as a form of \emph{partial variance
reduction}, which can reduce the stochastic gradient noise, but may not eliminate
it completely, depending on the properties of the teacher'' model. Our analysis
puts further emphasis on the need for careful parametrization of KD, in particular
w.r.t. the weighting of the distillation loss, and is validated empirically on
both linear models and deep neural networks.
acknowledgement: "MS has received funding from the European Union’s Horizon 2020 research
and innovation programme\r\nunder the Marie Skłodowska-Curie grant agreement No
101034413."
alternative_title:
- Advances in Neural Information Processing Systems
article_processing_charge: Yes
arxiv: 1
author:
- first_name: Mher
full_name: Safaryan, Mher
id: dd546b39-0804-11ed-9c55-ef075c39778d
last_name: Safaryan
- first_name: Elena-Alexandra
full_name: Peste, Elena-Alexandra
id: 32D78294-F248-11E8-B48F-1D18A9856A87
last_name: Peste
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
citation:
ama: 'Safaryan M, Krumes A, Alistarh D-A. Knowledge distillation performs partial
variance reduction. In: 36th Conference on Neural Information Processing Systems.
Vol 36. Neural Information Processing Systems Foundation; 2023.'
apa: 'Safaryan, M., Krumes, A., & Alistarh, D.-A. (2023). Knowledge distillation
performs partial variance reduction. In 36th Conference on Neural Information
Processing Systems (Vol. 36). New Orleans, LA, United States: Neural Information
Processing Systems Foundation.'
chicago: Safaryan, Mher, Alexandra Krumes, and Dan-Adrian Alistarh. “Knowledge Distillation
Performs Partial Variance Reduction.” In 36th Conference on Neural Information
Processing Systems, Vol. 36. Neural Information Processing Systems Foundation,
2023.
ieee: M. Safaryan, A. Krumes, and D.-A. Alistarh, “Knowledge distillation performs
partial variance reduction,” in 36th Conference on Neural Information Processing
Systems, New Orleans, LA, United States, 2023, vol. 36.
ista: 'Safaryan M, Krumes A, Alistarh D-A. 2023. Knowledge distillation performs
partial variance reduction. 36th Conference on Neural Information Processing Systems.
NeurIPS: Neural Information Processing Systems, Advances in Neural Information
Processing Systems, vol. 36.'
mla: Safaryan, Mher, et al. “Knowledge Distillation Performs Partial Variance Reduction.”
36th Conference on Neural Information Processing Systems, vol. 36, Neural
Information Processing Systems Foundation, 2023.
short: M. Safaryan, A. Krumes, D.-A. Alistarh, in:, 36th Conference on Neural Information
Processing Systems, Neural Information Processing Systems Foundation, 2023.
conference:
end_date: 2023-12-16
location: New Orleans, LA, United States
name: 'NeurIPS: Neural Information Processing Systems'
start_date: 2023-12-10
corr_author: '1'
das_tickbox: '1'
date_created: 2024-05-05T22:01:04Z
date_published: 2023-12-15T00:00:00Z
date_updated: 2026-07-07T06:37:28Z
day: '15'
ddc:
- '000'
department:
- _id: DaAl
ec_funded: 1
external_id:
arxiv:
- '2305.17581'
file:
- access_level: open_access
checksum: 288c5148a85abf24ad5e22a6b1183655
content_type: application/pdf
creator: dernst
date_created: 2024-05-22T08:08:08Z
date_updated: 2024-05-22T08:08:08Z
file_id: '15417'
file_name: 2023_Neurips_Safaryan.pdf
file_size: 672571
relation: main_file
success: 1
file_date_updated: 2024-05-22T08:08:08Z
has_accepted_license: '1'
intvolume: ' 36'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
project:
- _id: fc2ed2f7-9c52-11eb-aca3-c01059dda49c
call_identifier: H2020
grant_number: '101034413'
name: 'IST-BRIDGE: International postdoctoral program'
publication: 36th Conference on Neural Information Processing Systems
publication_identifier:
issn:
- 1049-5258
publication_status: published
publisher: Neural Information Processing Systems Foundation
quality_controlled: '1'
scopus_import: '1'
status: public
title: Knowledge distillation performs partial variance reduction
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: 36
year: '2023'
...
---
_id: '14921'
abstract:
- lang: eng
text: Neural collapse (NC) refers to the surprising structure of the last layer
of deep neural networks in the terminal phase of gradient descent training. Recently,
an increasing amount of experimental evidence has pointed to the propagation of
NC to earlier layers of neural networks. However, while the NC in the last layer
is well studied theoretically, much less is known about its multi-layered counterpart
- deep neural collapse (DNC). In particular, existing work focuses either on linear
layers or only on the last two layers at the price of an extra assumption. Our
paper fills this gap by generalizing the established analytical framework for
NC - the unconstrained features model - to multiple non-linear layers. Our key
technical contribution is to show that, in a deep unconstrained features model,
the unique global optimum for binary classification exhibits all the properties
typical of DNC. This explains the existing experimental evidence of DNC. We also
empirically show that (i) by optimizing deep unconstrained features models via
gradient descent, the resulting solution agrees well with our theory, and (ii)
trained networks recover the unconstrained features suitable for the occurrence
of DNC, thus supporting the validity of this modeling principle.
acknowledgement: M. M. is partially supported by the 2019 Lopez-Loreta Prize. The
authors would like to thank Eugenia Iofinova, Bernd Prach and Simone Bombari for
valuable feedback on the manuscript.
alternative_title:
- Advances in Neural Information Processing Systems
article_processing_charge: No
arxiv: 1
author:
- first_name: Peter
full_name: Súkeník, Peter
id: d64d6a8d-eb8e-11eb-b029-96fd216dec3c
last_name: Súkeník
- first_name: Marco
full_name: Mondelli, Marco
id: 27EB676C-8706-11E9-9510-7717E6697425
last_name: Mondelli
orcid: 0000-0002-3242-7020
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
citation:
ama: 'Súkeník P, Mondelli M, Lampert C. Deep neural collapse is provably optimal
for the deep unconstrained features model. In: 37th Conference on Neural Information
Processing Systems. Neural Information Processing Systems Foundation; 2023.'
apa: 'Súkeník, P., Mondelli, M., & Lampert, C. (2023). Deep neural collapse
is provably optimal for the deep unconstrained features model. In 37th Conference
on Neural Information Processing Systems. New Orleans, LA, United States:
Neural Information Processing Systems Foundation.'
chicago: Súkeník, Peter, Marco Mondelli, and Christoph Lampert. “Deep Neural Collapse
Is Provably Optimal for the Deep Unconstrained Features Model.” In 37th Conference
on Neural Information Processing Systems. Neural Information Processing Systems
Foundation, 2023.
ieee: P. Súkeník, M. Mondelli, and C. Lampert, “Deep neural collapse is provably
optimal for the deep unconstrained features model,” in 37th Conference on Neural
Information Processing Systems, New Orleans, LA, United States, 2023.
ista: 'Súkeník P, Mondelli M, Lampert C. 2023. Deep neural collapse is provably
optimal for the deep unconstrained features model. 37th Conference on Neural Information
Processing Systems. NeurIPS: Neural Information Processing Systems, Advances in
Neural Information Processing Systems, .'
mla: Súkeník, Peter, et al. “Deep Neural Collapse Is Provably Optimal for the Deep
Unconstrained Features Model.” 37th Conference on Neural Information Processing
Systems, Neural Information Processing Systems Foundation, 2023.
short: P. Súkeník, M. Mondelli, C. Lampert, in:, 37th Conference on Neural Information
Processing Systems, Neural Information Processing Systems Foundation, 2023.
conference:
end_date: 2023-12-16
location: New Orleans, LA, United States
name: 'NeurIPS: Neural Information Processing Systems'
start_date: 2023-12-10
corr_author: '1'
das_tickbox: '1'
date_created: 2024-02-02T11:17:41Z
date_published: 2023-12-15T00:00:00Z
date_updated: 2026-07-07T06:35:57Z
day: '15'
department:
- _id: MaMo
- _id: ChLa
external_id:
arxiv:
- '2305.13165'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: ' https://doi.org/10.48550/arXiv.2305.13165'
month: '12'
oa: 1
oa_version: Preprint
project:
- _id: 059876FA-7A3F-11EA-A408-12923DDC885E
name: Prix Lopez-Loretta 2019 - Marco Mondelli
publication: 37th Conference on Neural Information Processing Systems
publication_identifier:
eissn:
- 1049-5258
publication_status: published
publisher: Neural Information Processing Systems Foundation
quality_controlled: '1'
status: public
title: Deep neural collapse is provably optimal for the deep unconstrained features
model
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2023'
...
---
_id: '14260'
abstract:
- lang: eng
text: "This paper presents Lincheck, a new practical and user-friendly framework
for testing concurrent algorithms on the Java Virtual Machine (JVM). Lincheck
provides a simple and declarative way to write concurrent tests: instead of describing
how to perform the test, users specify what to test by declaring all the operations
to examine; the framework automatically handles the rest. As a result, tests written
with Lincheck are concise and easy to understand. The framework automatically
generates a set of concurrent scenarios, examines them using stress-testing or
bounded model checking, and verifies that the results of each invocation are correct.
Notably, if an error is detected via model checking, Lincheck provides an easy-to-follow
trace to reproduce it, significantly simplifying the bug investigation.\r\n\r\nTo
the best of our knowledge, Lincheck is the first production-ready tool on the
JVM that offers such a simple way of writing concurrent tests, without requiring
special skills or expertise. We successfully integrated Lincheck in the development
process of several large projects, such as Kotlin Coroutines, and identified new
bugs in popular concurrency libraries, such as a race in Java’s standard ConcurrentLinkedDeque
and a liveliness bug in Java’s AbstractQueuedSynchronizer framework, which is
used in most of the synchronization primitives. We believe that Lincheck can significantly
improve the quality and productivity of concurrent algorithms research and development
and become the state-of-the-art tool for checking their correctness."
alternative_title:
- LNCS
article_processing_charge: Yes (in subscription journal)
author:
- first_name: Nikita
full_name: Koval, Nikita
id: 2F4DB10C-F248-11E8-B48F-1D18A9856A87
last_name: Koval
- first_name: Alexander
full_name: Fedorov, Alexander
id: 2e711909-896a-11ed-bdf8-eb0f5a2984c6
last_name: Fedorov
- first_name: Maria
full_name: Sokolova, Maria
last_name: Sokolova
- first_name: Dmitry
full_name: Tsitelov, Dmitry
last_name: Tsitelov
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
citation:
ama: 'Koval N, Fedorov A, Sokolova M, Tsitelov D, Alistarh D-A. Lincheck: A practical
framework for testing concurrent data structures on JVM. In: 35th International
Conference on Computer Aided Verification. Vol 13964. Springer Nature; 2023:156-169.
doi:10.1007/978-3-031-37706-8_8'
apa: 'Koval, N., Fedorov, A., Sokolova, M., Tsitelov, D., & Alistarh, D.-A.
(2023). Lincheck: A practical framework for testing concurrent data structures
on JVM. In 35th International Conference on Computer Aided Verification
(Vol. 13964, pp. 156–169). Paris, France: Springer Nature. https://doi.org/10.1007/978-3-031-37706-8_8'
chicago: 'Koval, Nikita, Alexander Fedorov, Maria Sokolova, Dmitry Tsitelov, and
Dan-Adrian Alistarh. “Lincheck: A Practical Framework for Testing Concurrent Data
Structures on JVM.” In 35th International Conference on Computer Aided Verification,
13964:156–69. Springer Nature, 2023. https://doi.org/10.1007/978-3-031-37706-8_8.'
ieee: 'N. Koval, A. Fedorov, M. Sokolova, D. Tsitelov, and D.-A. Alistarh, “Lincheck:
A practical framework for testing concurrent data structures on JVM,” in 35th
International Conference on Computer Aided Verification, Paris, France, 2023,
vol. 13964, pp. 156–169.'
ista: 'Koval N, Fedorov A, Sokolova M, Tsitelov D, Alistarh D-A. 2023. Lincheck:
A practical framework for testing concurrent data structures on JVM. 35th International
Conference on Computer Aided Verification. CAV: Computer Aided Verification, LNCS,
vol. 13964, 156–169.'
mla: 'Koval, Nikita, et al. “Lincheck: A Practical Framework for Testing Concurrent
Data Structures on JVM.” 35th International Conference on Computer Aided Verification,
vol. 13964, Springer Nature, 2023, pp. 156–69, doi:10.1007/978-3-031-37706-8_8.'
short: N. Koval, A. Fedorov, M. Sokolova, D. Tsitelov, D.-A. Alistarh, in:, 35th
International Conference on Computer Aided Verification, Springer Nature, 2023,
pp. 156–169.
conference:
end_date: 2023-07-22
location: Paris, France
name: 'CAV: Computer Aided Verification'
start_date: 2023-07-17
das_tickbox: '1'
date_created: 2023-09-03T22:01:16Z
date_published: 2023-07-17T00:00:00Z
date_updated: 2026-07-07T13:39:36Z
day: '17'
ddc:
- '000'
department:
- _id: DaAl
- _id: GradSch
doi: 10.1007/978-3-031-37706-8_8
external_id:
isi:
- '001310786500008'
file:
- access_level: open_access
checksum: c346016393123a0a2338ad4d976f61bc
content_type: application/pdf
creator: dernst
date_created: 2023-09-06T08:16:25Z
date_updated: 2023-09-06T08:16:25Z
file_id: '14275'
file_name: 2023_LNCS_Koval.pdf
file_size: 421408
relation: main_file
success: 1
file_date_updated: 2023-09-06T08:16:25Z
fulldoi: https://doi.org/10.1007/978-3-031-37706-8_8
has_accepted_license: '1'
intvolume: ' 13964'
isi: 1
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: 156-169
publication: 35th International Conference on Computer Aided Verification
publication_identifier:
eissn:
- 1611-3349
isbn:
- '9783031377051'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
record:
- id: '14995'
relation: research_data
status: public
scopus_import: '1'
status: public
title: 'Lincheck: A practical framework for testing concurrent data structures on JVM'
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: 13964
year: '2023'
...
---
_id: '14259'
abstract:
- lang: eng
text: "We provide a learning-based technique for guessing a winning strategy in
a parity game originating from an LTL synthesis problem. A cheaply obtained guess
can be useful in several applications. Not only can the guessed strategy be applied
as best-effort in cases where the game’s huge size prohibits rigorous approaches,
but it can also increase the scalability of rigorous LTL synthesis in several
ways. Firstly, checking whether a guessed strategy is winning is easier than constructing
one. Secondly, even if the guess is wrong in some places, it can be fixed by strategy
iteration faster than constructing one from scratch. Thirdly, the guess can be
used in on-the-fly approaches to prioritize exploration in the most fruitful directions.\r\nIn
contrast to previous works, we (i) reflect the highly structured logical information
in game’s states, the so-called semantic labelling, coming from the recent LTL-to-automata
translations, and (ii) learn to reflect it properly by learning from previously
solved games, bringing the solving process closer to human-like reasoning."
acknowledgement: This research was funded in part by the German Research Foundation
(DFG) project 427755713 Group-By Objectives in Probabilistic Verification (GOPro).
alternative_title:
- LNCS
article_processing_charge: Yes (in subscription journal)
author:
- first_name: Jan
full_name: Kretinsky, Jan
id: 44CEF464-F248-11E8-B48F-1D18A9856A87
last_name: Kretinsky
orcid: 0000-0002-8122-2881
- first_name: Tobias
full_name: Meggendorfer, Tobias
id: b21b0c15-30a2-11eb-80dc-f13ca25802e1
last_name: Meggendorfer
orcid: 0000-0002-1712-2165
- first_name: Maximilian
full_name: Prokop, Maximilian
last_name: Prokop
- first_name: Sabine
full_name: Rieder, Sabine
last_name: Rieder
citation:
ama: 'Kretinsky J, Meggendorfer T, Prokop M, Rieder S. Guessing winning policies
in LTL synthesis by semantic learning. In: 35th International Conference on
Computer Aided Verification. Vol 13964. Springer Nature; 2023:390-414. doi:10.1007/978-3-031-37706-8_20'
apa: 'Kretinsky, J., Meggendorfer, T., Prokop, M., & Rieder, S. (2023). Guessing
winning policies in LTL synthesis by semantic learning. In 35th International
Conference on Computer Aided Verification (Vol. 13964, pp. 390–414). Paris,
France: Springer Nature. https://doi.org/10.1007/978-3-031-37706-8_20'
chicago: Kretinsky, Jan, Tobias Meggendorfer, Maximilian Prokop, and Sabine Rieder.
“Guessing Winning Policies in LTL Synthesis by Semantic Learning.” In 35th
International Conference on Computer Aided Verification, 13964:390–414. Springer
Nature, 2023. https://doi.org/10.1007/978-3-031-37706-8_20.
ieee: J. Kretinsky, T. Meggendorfer, M. Prokop, and S. Rieder, “Guessing winning
policies in LTL synthesis by semantic learning,” in 35th International Conference
on Computer Aided Verification, Paris, France, 2023, vol. 13964, pp. 390–414.
ista: 'Kretinsky J, Meggendorfer T, Prokop M, Rieder S. 2023. Guessing winning policies
in LTL synthesis by semantic learning. 35th International Conference on Computer
Aided Verification. CAV: Computer Aided Verification, LNCS, vol. 13964, 390–414.'
mla: Kretinsky, Jan, et al. “Guessing Winning Policies in LTL Synthesis by Semantic
Learning.” 35th International Conference on Computer Aided Verification,
vol. 13964, Springer Nature, 2023, pp. 390–414, doi:10.1007/978-3-031-37706-8_20.
short: J. Kretinsky, T. Meggendorfer, M. Prokop, S. Rieder, in:, 35th International
Conference on Computer Aided Verification, Springer Nature, 2023, pp. 390–414.
conference:
end_date: 2023-07-22
location: Paris, France
name: 'CAV: Computer Aided Verification'
start_date: 2023-07-17
das_tickbox: '1'
date_created: 2023-09-03T22:01:16Z
date_published: 2023-07-17T00:00:00Z
date_updated: 2026-07-07T13:39:23Z
day: '17'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.1007/978-3-031-37706-8_20
external_id:
isi:
- '001310786500020'
file:
- access_level: open_access
checksum: ed66278b61bb869e1baba3d9b9081271
content_type: application/pdf
creator: dernst
date_created: 2023-09-06T08:25:50Z
date_updated: 2023-09-06T08:25:50Z
file_id: '14276'
file_name: 2023_LNCS_CAV_Kretinsky.pdf
file_size: 428354
relation: main_file
success: 1
file_date_updated: 2023-09-06T08:25:50Z
fulldoi: https://doi.org/10.1007/978-3-031-37706-8_20
has_accepted_license: '1'
intvolume: ' 13964'
isi: 1
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: 390-414
publication: 35th International Conference on Computer Aided Verification
publication_identifier:
eissn:
- 1611-3349
isbn:
- '9783031377051'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Guessing winning policies in LTL synthesis by semantic learning
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: 13964
year: '2023'
...
---
_id: '14995'
abstract:
- lang: eng
text: "Lincheck is a new practical and user-friendly framework for testing concurrent
data structures on the Java Virtual Machine (JVM). It provides a simple and declarative
way to write concurrent tests. Instead of describing how to perform the test,
users specify what to test by declaring all the operations to examine; the framework
automatically handles the rest. As a result, tests written with Lincheck are concise
and easy to understand. \r\nThe artifact presents a collection of Lincheck tests
that discover new bugs in popular libraries and implementations from the concurrency
literature -- they are listed in Table 1, Section 3. To evaluate the performance
of Lincheck analysis, the collection of tests also includes those which check
correct data structures and, thus, always succeed. Similarly to Table 2, Section
3, the experiments demonstrate the reasonable time to perform a test. Finally,
Lincheck provides user-friendly output with an easy-to-follow trace to reproduce
a detected error, significantly simplifying further investigation."
article_processing_charge: No
author:
- first_name: Nikita
full_name: Koval, Nikita
id: 2F4DB10C-F248-11E8-B48F-1D18A9856A87
last_name: Koval
- first_name: Alexander
full_name: Fedorov, Alexander
id: 2e711909-896a-11ed-bdf8-eb0f5a2984c6
last_name: Fedorov
- first_name: Maria
full_name: Sokolova, Maria
last_name: Sokolova
- first_name: Dmitry
full_name: Tsitelov, Dmitry
last_name: Tsitelov
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
citation:
ama: 'Koval N, Fedorov A, Sokolova M, Tsitelov D, Alistarh D-A. Lincheck: A practical
framework for testing concurrent data structures on JVM. 2023. doi:10.5281/ZENODO.7877757'
apa: 'Koval, N., Fedorov, A., Sokolova, M., Tsitelov, D., & Alistarh, D.-A.
(2023). Lincheck: A practical framework for testing concurrent data structures
on JVM. Zenodo. https://doi.org/10.5281/ZENODO.7877757'
chicago: 'Koval, Nikita, Alexander Fedorov, Maria Sokolova, Dmitry Tsitelov, and
Dan-Adrian Alistarh. “Lincheck: A Practical Framework for Testing Concurrent Data
Structures on JVM.” Zenodo, 2023. https://doi.org/10.5281/ZENODO.7877757.'
ieee: 'N. Koval, A. Fedorov, M. Sokolova, D. Tsitelov, and D.-A. Alistarh, “Lincheck:
A practical framework for testing concurrent data structures on JVM.” Zenodo,
2023.'
ista: 'Koval N, Fedorov A, Sokolova M, Tsitelov D, Alistarh D-A. 2023. Lincheck:
A practical framework for testing concurrent data structures on JVM, Zenodo, 10.5281/ZENODO.7877757.'
mla: 'Koval, Nikita, et al. Lincheck: A Practical Framework for Testing Concurrent
Data Structures on JVM. Zenodo, 2023, doi:10.5281/ZENODO.7877757.'
short: N. Koval, A. Fedorov, M. Sokolova, D. Tsitelov, D.-A. Alistarh, (2023).
date_created: 2024-02-14T15:14:13Z
date_published: 2023-04-28T00:00:00Z
date_updated: 2026-07-07T13:39:35Z
day: '28'
ddc:
- '000'
department:
- _id: DaAl
doi: 10.5281/ZENODO.7877757
fulldoi: https://doi.org/10.5281/ZENODO.7877757
main_file_link:
- open_access: '1'
url: https://doi.org/10.5281/zenodo.7877757
month: '04'
oa: 1
oa_version: Published Version
publisher: Zenodo
related_material:
record:
- id: '14260'
relation: used_in_publication
status: public
status: public
title: 'Lincheck: A practical framework for testing concurrent data structures on
JVM'
type: research_data_reference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2023'
...
---
_id: '12960'
abstract:
- lang: eng
text: "Isomanifolds are the generalization of isosurfaces to arbitrary dimension
and codimension, i.e., submanifolds of Rd defined as the zero set of some multivariate
multivalued smooth function f:Rd→Rd−n, where n is the intrinsic dimension of the
manifold. A natural way to approximate a smooth isomanifold M=f−1(0) is to consider
its piecewise linear (PL) approximation M^\r\n based on a triangulation T of the
ambient space Rd. In this paper, we describe a simple algorithm to trace isomanifolds
from a given starting point. The algorithm works for arbitrary dimensions n and
d, and any precision D. Our main result is that, when f (or M) has bounded complexity,
the complexity of the algorithm is polynomial in d and δ=1/D (and unavoidably
exponential in n). Since it is known that for δ=Ω(d2.5), M^ is O(D2)-close and
isotopic to M\r\n, our algorithm produces a faithful PL-approximation of isomanifolds
of bounded complexity in time polynomial in d. Combining this algorithm with dimensionality
reduction techniques, the dependency on d in the size of M^ can be completely
removed with high probability. We also show that the algorithm can handle isomanifolds
with boundary and, more generally, isostratifolds. The algorithm for isomanifolds
with boundary has been implemented and experimental results are reported, showing
that it is practical and can handle cases that are far ahead of the state-of-the-art. "
acknowledgement: The authors have received funding from the European Research Council
under the European Union's ERC grant greement 339025 GUDHI (Algorithmic Foundations
of Geometric Un-derstanding in Higher Dimensions). The first author was supported by the French government,through
the 3IA C\^ote d'Azur Investments in the Future project managed by the National
ResearchAgency (ANR) with the reference ANR-19-P3IA-0002. The third author was
supported by the Eu-ropean Union's Horizon 2020 research and innovation programme
under the Marie Sk\lodowska-Curiegrant agreement 754411 and the FWF (Austrian Science
Fund) grant M 3073.
article_processing_charge: No
article_type: original
author:
- first_name: Jean Daniel
full_name: Boissonnat, Jean Daniel
last_name: Boissonnat
- first_name: Siargey
full_name: Kachanovich, Siargey
last_name: Kachanovich
- first_name: Mathijs
full_name: Wintraecken, Mathijs
id: 307CFBC8-F248-11E8-B48F-1D18A9856A87
last_name: Wintraecken
orcid: 0000-0002-7472-2220
citation:
ama: Boissonnat JD, Kachanovich S, Wintraecken M. Tracing isomanifolds in Rd in
time polynomial in d using Coxeter–Freudenthal–Kuhn triangulations. SIAM Journal
on Computing. 2023;52(2):452-486. doi:10.1137/21M1412918
apa: Boissonnat, J. D., Kachanovich, S., & Wintraecken, M. (2023). Tracing isomanifolds
in Rd in time polynomial in d using Coxeter–Freudenthal–Kuhn triangulations. SIAM
Journal on Computing. Society for Industrial and Applied Mathematics. https://doi.org/10.1137/21M1412918
chicago: Boissonnat, Jean Daniel, Siargey Kachanovich, and Mathijs Wintraecken.
“Tracing Isomanifolds in Rd in Time Polynomial in d Using Coxeter–Freudenthal–Kuhn
Triangulations.” SIAM Journal on Computing. Society for Industrial and
Applied Mathematics, 2023. https://doi.org/10.1137/21M1412918.
ieee: J. D. Boissonnat, S. Kachanovich, and M. Wintraecken, “Tracing isomanifolds
in Rd in time polynomial in d using Coxeter–Freudenthal–Kuhn triangulations,”
SIAM Journal on Computing, vol. 52, no. 2. Society for Industrial and Applied
Mathematics, pp. 452–486, 2023.
ista: Boissonnat JD, Kachanovich S, Wintraecken M. 2023. Tracing isomanifolds in
Rd in time polynomial in d using Coxeter–Freudenthal–Kuhn triangulations. SIAM
Journal on Computing. 52(2), 452–486.
mla: Boissonnat, Jean Daniel, et al. “Tracing Isomanifolds in Rd in Time Polynomial
in d Using Coxeter–Freudenthal–Kuhn Triangulations.” SIAM Journal on Computing,
vol. 52, no. 2, Society for Industrial and Applied Mathematics, 2023, pp. 452–86,
doi:10.1137/21M1412918.
short: J.D. Boissonnat, S. Kachanovich, M. Wintraecken, SIAM Journal on Computing
52 (2023) 452–486.
corr_author: '1'
date_created: 2023-05-14T22:01:00Z
date_published: 2023-04-30T00:00:00Z
date_updated: 2026-07-07T13:43:40Z
day: '30'
department:
- _id: HeEd
doi: 10.1137/21M1412918
ec_funded: 1
external_id:
isi:
- '001013183000012'
fulldoi: https://doi.org/10.1137/21M1412918
intvolume: ' 52'
isi: 1
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://hal-emse.ccsd.cnrs.fr/3IA-COTEDAZUR/hal-04083489v1
month: '04'
oa: 1
oa_version: Submitted Version
page: 452-486
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
- _id: fc390959-9c52-11eb-aca3-afa58bd282b2
grant_number: M03073
name: Learning and triangulating manifolds via collapses
publication: SIAM Journal on Computing
publication_identifier:
eissn:
- 1095-7111
issn:
- 0097-5397
publication_status: published
publisher: Society for Industrial and Applied Mathematics
quality_controlled: '1'
related_material:
record:
- id: '9441'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: Tracing isomanifolds in Rd in time polynomial in d using Coxeter–Freudenthal–Kuhn
triangulations
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 52
year: '2023'
...
---
_id: '14256'
abstract:
- lang: eng
text: "Context. Space asteroseismology is revolutionizing our knowledge of the internal
structure and dynamics of stars. A breakthrough is ongoing with the recent discoveries
of signatures of strong magnetic fields in the core of red giant stars. The key
signature for such a detection is the asymmetry these fields induce in the frequency
splittings of observed dipolar mixed gravito-acoustic modes.\r\nAims. We investigate
the ability of the observed asymmetries of the frequency splittings of dipolar
mixed modes to constrain the geometrical properties of deep magnetic fields.\r\nMethods.
We used the powerful analytical Racah-Wigner algebra used in quantum mechanics
to characterize the geometrical couplings of dipolar mixed oscillation modes with
various realistically plausible topologies of fossil magnetic fields. We also
computed the induced perturbation of their frequencies.\r\nResults. First, in
the case of an oblique magnetic dipole, we provide the exact analytical expression
of the asymmetry as a function of the angle between the rotation and magnetic
axes. Its value provides a direct measure of this angle. Second, considering a
combination of axisymmetric dipolar and quadrupolar fields, we show how the asymmetry
is blind to the unraveling of the relative strength and sign of each component.
Finally, in the case of a given multipole, we show that a negative asymmetry is
a signature of non-axisymmetric topologies.\r\nConclusions. Asymmetries of dipolar
mixed modes provide a key bit of information on the geometrical topology of deep
fossil magnetic fields, but this is insufficient on its own. Asteroseismic constraints
should therefore be combined with spectropolarimetric observations and numerical
simulations, which aim to predict the more probable stable large-scale geometries."
acknowledgement: The authors are grateful to the referee for her/his detailed and
constructive report, which has allowed us to improve our article. S. M. acknowledges
support from the CNES GOLF-SOHO and PLATO grants at CEA/DAp and PNPS (CNRS/INSU).
We thank R. A. Garcia for fruitful discussions and suggestions.
article_number: L9
article_processing_charge: Yes (in subscription journal)
article_type: letter_note
arxiv: 1
author:
- first_name: S.
full_name: Mathis, S.
last_name: Mathis
- first_name: Lisa Annabelle
full_name: Bugnet, Lisa Annabelle
id: d9edb345-f866-11ec-9b37-d119b5234501
last_name: Bugnet
orcid: 0000-0003-0142-4000
citation:
ama: 'Mathis S, Bugnet LA. Asymmetries of frequency splittings of dipolar mixed
modes: A window on the topology of deep magnetic fields. Astronomy & Astrophysics.
2023;676. doi:10.1051/0004-6361/202346832'
apa: 'Mathis, S., & Bugnet, L. A. (2023). Asymmetries of frequency splittings
of dipolar mixed modes: A window on the topology of deep magnetic fields. Astronomy
& Astrophysics. EDP Sciences. https://doi.org/10.1051/0004-6361/202346832'
chicago: 'Mathis, S., and Lisa Annabelle Bugnet. “Asymmetries of Frequency Splittings
of Dipolar Mixed Modes: A Window on the Topology of Deep Magnetic Fields.” Astronomy
& Astrophysics. EDP Sciences, 2023. https://doi.org/10.1051/0004-6361/202346832.'
ieee: 'S. Mathis and L. A. Bugnet, “Asymmetries of frequency splittings of dipolar
mixed modes: A window on the topology of deep magnetic fields,” Astronomy &
Astrophysics, vol. 676. EDP Sciences, 2023.'
ista: 'Mathis S, Bugnet LA. 2023. Asymmetries of frequency splittings of dipolar
mixed modes: A window on the topology of deep magnetic fields. Astronomy &
Astrophysics. 676, L9.'
mla: 'Mathis, S., and Lisa Annabelle Bugnet. “Asymmetries of Frequency Splittings
of Dipolar Mixed Modes: A Window on the Topology of Deep Magnetic Fields.” Astronomy
& Astrophysics, vol. 676, L9, EDP Sciences, 2023, doi:10.1051/0004-6361/202346832.'
short: S. Mathis, L.A. Bugnet, Astronomy & Astrophysics 676 (2023).
das_tickbox: '1'
date_created: 2023-09-03T22:01:15Z
date_published: 2023-08-01T00:00:00Z
date_updated: 2026-07-08T06:45:55Z
day: '01'
ddc:
- '520'
department:
- _id: LiBu
doi: 10.1051/0004-6361/202346832
external_id:
arxiv:
- '2306.11587'
isi:
- '001046037700007'
file:
- access_level: open_access
checksum: 7b30d26fb2b7bcb5b5be1414950615f9
content_type: application/pdf
creator: dernst
date_created: 2023-09-06T07:13:19Z
date_updated: 2023-09-06T07:13:19Z
file_id: '14271'
file_name: 2023_AstronomyAstrophysics_Mathis.pdf
file_size: 458120
relation: main_file
success: 1
file_date_updated: 2023-09-06T07:13:19Z
fulldoi: https://doi.org/10.1051/0004-6361/202346832
has_accepted_license: '1'
intvolume: ' 676'
isi: 1
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
publication: Astronomy & Astrophysics
publication_identifier:
eissn:
- 1432-0746
issn:
- 0004-6361
publication_status: published
publisher: EDP Sciences
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Asymmetries of frequency splittings of dipolar mixed modes: A window on the
topology of deep magnetic fields'
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: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 676
year: '2023'
...
---
OA_place: publisher
_id: '14547'
abstract:
- lang: eng
text: "Superconductor-semiconductor heterostructures currently capture a significant
amount of research interest and they serve as the physical platform in many proposals
towards topological quantum computation.\r\nDespite being under extensive investigations,
historically using transport techniques, the basic properties of the interface
between the superconductor and the semiconductor remain to be understood.\r\n\r\nIn
this thesis, two separate studies on the Al-InAs heterostructures are reported
with the first focusing on the physics of the material motivated by the emergence
of a new phase, the Bogoliubov-Fermi surface. \r\nThe second focuses on a technological
application, a gate-tunable Josephson parametric amplifier.\r\n\r\nIn the first
study, we investigate the hypothesized unconventional nature of the induced superconductivity
at the interface between the Al thin film and the InAs quantum well.\r\nWe embed
a two-dimensional Al-InAs hybrid system in a resonant microwave circuit allowing
measurements of change in inductance.\r\nThe behaviour of the resonance in a range
of temperature and in-plane magnetic field has been studied and compared with
the theory of conventional s-wave superconductor and a two-component theory that
includes both contribution of the $s$-wave pairing in Al and the intraband $p
\\pm ip$ pairing in InAs.\r\nMeasuring the temperature dependence of resonant
frequency, no discrepancy is found between data and the conventional theory.\r\nWe
observe the breakdown of superconductivity due to an applied magnetic field which
contradicts the conventional theory.\r\nIn contrast, the data can be captured
quantitatively by fitting to a two-component model.\r\nWe find the evidence of
the intraband $p \\pm ip$ pairing in the InAs and the emergence of the Bogoliubov-Fermi
surfaces due to magnetic field with the characteristic value $B^* = 0.33~\\mathrm{T}$.\r\nFrom
the fits, the sheet resistance of Al, the carrier density and mobility in InAs
are determined.\r\nBy systematically studying the anisotropy of the circuit response,
we find weak anisotropy for $B < B^*$ and increasingly strong anisotropy for $B
> B^*$ resulting in a pronounced two-lobe structure in polar plot of frequency
versus field angle.\r\nStrong resemblance between the field dependence of dissipation
and superfluid density hints at a hidden signature of the Bogoliubov-Fermi surface
that is burried in the dissipation data.\r\n\r\nIn the second study, we realize
a parametric amplifier with a Josephson field effect transistor as the active
element.\r\nThe device's modest construction consists of a gated SNS weak link
embedded at the center of a coplanar waveguide resonator.\r\nBy applying a gate
voltage, the resonant frequency is field-effect tunable over a range of 2 GHz.\r\nModelling
the JoFET minimally as a parallel RL circuit, the dissipation introduced by the
JoFET can be quantitatively related to the gate voltage.\r\nWe observed gate-tunable
Kerr nonlinearity qualitatively in line with expectation.\r\nThe JoFET amplifier
has 20 dB of gain, 4 MHz of instantaneous bandwidth, and a 1dB compression point
of -125.5 dBm when operated at a fixed resonant frequency.\r\nIn general, the
signal-to-noise ratio is improved by 5-7 dB when the JoFET amplifier is activated
compared.\r\nThe noise of the measurement chain and insertion loss of relevant
circuit elements are calibrated to determine the expected and the real noise performance
of the JoFET amplifier.\r\nAs a quantification of the noise performance, the measured
total input-referred noise of the JoFET amplifier is in good agreement with the
estimated expectation which takes device loss into account.\r\nWe found that the
noise performance of the device reported in this document approaches one photon
of total input-referred added noise which is the quantum limit imposed in nondegenerate
parametric amplifier."
acknowledged_ssus:
- _id: NanoFab
- _id: Bio
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Duc T
full_name: Phan, Duc T
id: 29C8C0B4-F248-11E8-B48F-1D18A9856A87
last_name: Phan
citation:
ama: Phan DT. Resonant microwave spectroscopy of Al-InAs. 2023. doi:10.15479/14547
apa: Phan, D. T. (2023). Resonant microwave spectroscopy of Al-InAs. Institute
of Science and Technology Austria. https://doi.org/10.15479/14547
chicago: Phan, Duc T. “Resonant Microwave Spectroscopy of Al-InAs.” Institute of
Science and Technology Austria, 2023. https://doi.org/10.15479/14547.
ieee: D. T. Phan, “Resonant microwave spectroscopy of Al-InAs,” Institute of Science
and Technology Austria, 2023.
ista: Phan DT. 2023. Resonant microwave spectroscopy of Al-InAs. Institute of Science
and Technology Austria.
mla: Phan, Duc T. Resonant Microwave Spectroscopy of Al-InAs. Institute of
Science and Technology Austria, 2023, doi:10.15479/14547.
short: D.T. Phan, Resonant Microwave Spectroscopy of Al-InAs, Institute of Science
and Technology Austria, 2023.
corr_author: '1'
date_created: 2023-11-17T13:45:26Z
date_published: 2023-11-16T00:00:00Z
date_updated: 2026-07-08T08:38:43Z
day: '16'
ddc:
- '530'
degree_awarded: PhD
department:
- _id: GradSch
- _id: AnHi
doi: 10.15479/14547
file:
- access_level: open_access
checksum: db0c37d213bc002125bd59690e9db246
content_type: application/pdf
creator: pduc
date_created: 2023-11-17T13:36:44Z
date_updated: 2023-11-22T09:46:06Z
file_id: '14548'
file_name: Phan_Thesis_pdfa.pdf
file_size: 34828019
relation: main_file
- access_level: closed
checksum: 8d3bd6afa279a0078ffd13e06bb6d56d
content_type: application/zip
creator: pduc
date_created: 2023-11-17T13:44:53Z
date_updated: 2023-11-17T13:47:54Z
file_id: '14549'
file_name: dissertation_src.zip
file_size: 279319709
relation: source_file
file_date_updated: 2023-11-22T09:46:06Z
fulldoi: https://doi.org/10.15479/14547
has_accepted_license: '1'
keyword:
- superconductor-semiconductor
- superconductivity
- Al
- InAs
- p-wave
- superconductivity
- JPA
- microwave
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc-sa/4.0/
month: '11'
oa: 1
oa_version: Published Version
page: '80'
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '10851'
relation: part_of_dissertation
status: public
- id: '13264'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Andrew P
full_name: Higginbotham, Andrew P
id: 4AD6785A-F248-11E8-B48F-1D18A9856A87
last_name: Higginbotham
orcid: 0000-0003-2607-2363
title: Resonant microwave spectroscopy of Al-InAs
tmp:
image: /images/cc_by_nc_sa.png
legal_code_url: https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode
name: Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC
BY-NC-SA 4.0)
short: CC BY-NC-SA (4.0)
type: dissertation
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
year: '2023'
...
---
_id: '14749'
abstract:
- lang: eng
text: We unveil a powerful method for the stabilization of laser injection locking
based on sensing variations in the output beam ellipticity of an optically seeded
laser. The effect arises due to an interference between the seeding beam and the
injected laser output. We demonstrate the method for a commercial semiconductor
laser without the need for any internal changes to the readily operational injection
locked laser system that was used. The method can also be used to increase the
mode-hop free tuning range of lasers, and has the potential to fill a void in
the low-noise laser industry.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Umang
full_name: Mishra, Umang
id: 4328fa4c-f128-11eb-9611-c107b0fe4d51
last_name: Mishra
- first_name: Vyacheslav
full_name: Li, Vyacheslav
id: 3A4FAA92-F248-11E8-B48F-1D18A9856A87
last_name: Li
- first_name: Sebastian
full_name: Wald, Sebastian
id: 133F200A-B015-11E9-AD41-0EDAE5697425
last_name: Wald
orcid: 0000-0002-5869-1604
- first_name: Sofya
full_name: Agafonova, Sofya
id: 09501ff6-dca7-11ea-a8ae-b3e0b9166e80
last_name: Agafonova
orcid: 0000-0003-0582-2946
- first_name: Fritz R
full_name: Diorico, Fritz R
id: 2E054C4C-F248-11E8-B48F-1D18A9856A87
last_name: Diorico
orcid: 0000-0002-4947-8924
- first_name: Onur
full_name: Hosten, Onur
id: 4C02D85E-F248-11E8-B48F-1D18A9856A87
last_name: Hosten
orcid: 0000-0002-2031-204X
citation:
ama: Mishra U, Li V, Wald S, Agafonova S, Diorico FR, Hosten O. Monitoring and active
stabilization of laser injection locking using beam ellipticity. Optics Letters.
2023;48(15):3973-3976. doi:10.1364/ol.495553
apa: Mishra, U., Li, V., Wald, S., Agafonova, S., Diorico, F. R., & Hosten,
O. (2023). Monitoring and active stabilization of laser injection locking using
beam ellipticity. Optics Letters. Optica Publishing Group. https://doi.org/10.1364/ol.495553
chicago: Mishra, Umang, Vyacheslav Li, Sebastian Wald, Sofia Agafonova, Fritz R
Diorico, and Onur Hosten. “Monitoring and Active Stabilization of Laser Injection
Locking Using Beam Ellipticity.” Optics Letters. Optica Publishing Group,
2023. https://doi.org/10.1364/ol.495553.
ieee: U. Mishra, V. Li, S. Wald, S. Agafonova, F. R. Diorico, and O. Hosten, “Monitoring
and active stabilization of laser injection locking using beam ellipticity,” Optics
Letters, vol. 48, no. 15. Optica Publishing Group, pp. 3973–3976, 2023.
ista: Mishra U, Li V, Wald S, Agafonova S, Diorico FR, Hosten O. 2023. Monitoring
and active stabilization of laser injection locking using beam ellipticity. Optics
Letters. 48(15), 3973–3976.
mla: Mishra, Umang, et al. “Monitoring and Active Stabilization of Laser Injection
Locking Using Beam Ellipticity.” Optics Letters, vol. 48, no. 15, Optica
Publishing Group, 2023, pp. 3973–76, doi:10.1364/ol.495553.
short: U. Mishra, V. Li, S. Wald, S. Agafonova, F.R. Diorico, O. Hosten, Optics
Letters 48 (2023) 3973–3976.
corr_author: '1'
das_tickbox: '1'
dataavailabilitystatement: Data underlying the results presented in this paper are
not publicly available at this time but may be obtained from the authors upon reasonable
request.
date_created: 2024-01-08T13:01:46Z
date_published: 2023-07-21T00:00:00Z
date_updated: 2026-07-08T08:41:47Z
day: '21'
department:
- _id: OnHo
doi: 10.1364/ol.495553
external_id:
arxiv:
- '2212.01266'
isi:
- '001051044600008'
fulldoi: https://doi.org/10.1364/ol.495553
intvolume: ' 48'
isi: 1
issue: '15'
keyword:
- Atomic and Molecular Physics
- and Optics
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2212.01266
month: '07'
oa: 1
oa_version: Preprint
page: 3973-3976
publication: Optics Letters
publication_identifier:
eissn:
- 1539-4794
issn:
- 0146-9592
publication_status: published
publisher: Optica Publishing Group
quality_controlled: '1'
researchdata_availability: upon request
scopus_import: '1'
status: public
supplementarymaterial: no
title: Monitoring and active stabilization of laser injection locking using beam ellipticity
type: journal_article
user_id: 68b8ca59-c5b3-11ee-8790-cd641c68093d
volume: 48
year: '2023'
...
---
_id: '13233'
abstract:
- lang: eng
text: We study the impact of finite-range physics on the zero-range-model analysis
of three-body recombination in ultracold atoms. We find that temperature dependence
of the zero-range parameters can vary from one set of measurements to another
as it may be driven by the distribution of error bars in the experiment, and not
by the underlying three-body physics. To study finite-temperature effects in three-body
recombination beyond the zero-range physics, we introduce and examine a finite-range
model based upon a hyperspherical formalism. The systematic error discussed in
this Letter may provide a significant contribution to the error bars of measured
three-body parameters.
acknowledgement: We thank Jan Arlt, Hans-Werner Hammer, and Karsten Riisager for useful
discussions. M.L. acknowledges support by the European Research Council (ERC) Starting
Grant No. 801770 (ANGULON).
article_number: L061304
article_processing_charge: No
article_type: letter_note
arxiv: 1
author:
- first_name: Sofya
full_name: Agafonova, Sofya
id: 09501ff6-dca7-11ea-a8ae-b3e0b9166e80
last_name: Agafonova
orcid: 0000-0003-0582-2946
- first_name: Mikhail
full_name: Lemeshko, Mikhail
id: 37CB05FA-F248-11E8-B48F-1D18A9856A87
last_name: Lemeshko
orcid: 0000-0002-6990-7802
- first_name: Artem
full_name: Volosniev, Artem
id: 37D278BC-F248-11E8-B48F-1D18A9856A87
last_name: Volosniev
orcid: 0000-0003-0393-5525
citation:
ama: Agafonova S, Lemeshko M, Volosniev A. Finite-range bias in fitting three-body
loss to the zero-range model. Physical Review A. 2023;107(6). doi:10.1103/PhysRevA.107.L061304
apa: Agafonova, S., Lemeshko, M., & Volosniev, A. (2023). Finite-range bias
in fitting three-body loss to the zero-range model. Physical Review A.
American Physical Society. https://doi.org/10.1103/PhysRevA.107.L061304
chicago: Agafonova, Sofia, Mikhail Lemeshko, and Artem Volosniev. “Finite-Range
Bias in Fitting Three-Body Loss to the Zero-Range Model.” Physical Review A.
American Physical Society, 2023. https://doi.org/10.1103/PhysRevA.107.L061304.
ieee: S. Agafonova, M. Lemeshko, and A. Volosniev, “Finite-range bias in fitting
three-body loss to the zero-range model,” Physical Review A, vol. 107,
no. 6. American Physical Society, 2023.
ista: Agafonova S, Lemeshko M, Volosniev A. 2023. Finite-range bias in fitting three-body
loss to the zero-range model. Physical Review A. 107(6), L061304.
mla: Agafonova, Sofia, et al. “Finite-Range Bias in Fitting Three-Body Loss to the
Zero-Range Model.” Physical Review A, vol. 107, no. 6, L061304, American
Physical Society, 2023, doi:10.1103/PhysRevA.107.L061304.
short: S. Agafonova, M. Lemeshko, A. Volosniev, Physical Review A 107 (2023).
corr_author: '1'
das_tickbox: '0'
date_created: 2023-07-16T22:01:10Z
date_published: 2023-06-20T00:00:00Z
date_updated: 2026-07-08T08:30:05Z
day: '20'
department:
- _id: MiLe
- _id: OnHo
doi: 10.1103/PhysRevA.107.L061304
ec_funded: 1
external_id:
arxiv:
- '2302.01022'
isi:
- '001019748000005'
fulldoi: https://doi.org/10.1103/PhysRevA.107.L061304
intvolume: ' 107'
isi: 1
issue: '6'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2302.01022
month: '06'
oa: 1
oa_version: Preprint
project:
- _id: 2688CF98-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '801770'
name: 'Angulon: physics and applications of a new quasiparticle'
publication: Physical Review A
publication_identifier:
eissn:
- 2469-9934
issn:
- 2469-9926
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
researchdata_availability: no
scopus_import: '1'
status: public
supplementarymaterial: yes
title: Finite-range bias in fitting three-body loss to the zero-range model
type: journal_article
user_id: 68b8ca59-c5b3-11ee-8790-cd641c68093d
volume: 107
year: '2023'
...
---
_id: '13264'
abstract:
- lang: eng
text: "We build a parametric amplifier with a Josephson field-effect transistor
(JoFET) as the active element. The resonant frequency of the device is field-effect
tunable over a range of 2 GHz. The JoFET amplifier has 20 dB of gain, 4 MHz of
instantaneous bandwidth, and a 1-dB compression point of -125.5 dBm when operated
at a fixed resonance frequency.\r\n\r\n"
acknowledged_ssus:
- _id: NanoFab
- _id: M-Shop
acknowledgement: We thank Shyam Shankar for helpful feedback on the manuscript. We
gratefully acknowledge the support of the ISTA nanofabrication facility, the Miba
Machine Shop, and the eMachine Shop. The NYU team acknowledges support from Army
Research Office Grant No. W911NF2110303.
article_number: '064032'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Duc T
full_name: Phan, Duc T
id: 29C8C0B4-F248-11E8-B48F-1D18A9856A87
last_name: Phan
- first_name: Paul
full_name: Falthansl-Scheinecker, Paul
id: 85b43b21-15b2-11ec-abd3-e2c252cc2285
last_name: Falthansl-Scheinecker
- first_name: Umang
full_name: Mishra, Umang
id: 4328fa4c-f128-11eb-9611-c107b0fe4d51
last_name: Mishra
- first_name: W. M.
full_name: Strickland, W. M.
last_name: Strickland
- first_name: D.
full_name: Langone, D.
last_name: Langone
- first_name: J.
full_name: Shabani, J.
last_name: Shabani
- first_name: Andrew P
full_name: Higginbotham, Andrew P
id: 4AD6785A-F248-11E8-B48F-1D18A9856A87
last_name: Higginbotham
orcid: 0000-0003-2607-2363
citation:
ama: Phan DT, Falthansl-Scheinecker P, Mishra U, et al. Gate-tunable superconductor-semiconductor
parametric amplifier. Physical Review Applied. 2023;19(6). doi:10.1103/PhysRevApplied.19.064032
apa: Phan, D. T., Falthansl-Scheinecker, P., Mishra, U., Strickland, W. M., Langone,
D., Shabani, J., & Higginbotham, A. P. (2023). Gate-tunable superconductor-semiconductor
parametric amplifier. Physical Review Applied. American Physical Society.
https://doi.org/10.1103/PhysRevApplied.19.064032
chicago: Phan, Duc T, Paul Falthansl-Scheinecker, Umang Mishra, W. M. Strickland,
D. Langone, J. Shabani, and Andrew P Higginbotham. “Gate-Tunable Superconductor-Semiconductor
Parametric Amplifier.” Physical Review Applied. American Physical Society,
2023. https://doi.org/10.1103/PhysRevApplied.19.064032.
ieee: D. T. Phan et al., “Gate-tunable superconductor-semiconductor parametric
amplifier,” Physical Review Applied, vol. 19, no. 6. American Physical
Society, 2023.
ista: Phan DT, Falthansl-Scheinecker P, Mishra U, Strickland WM, Langone D, Shabani
J, Higginbotham AP. 2023. Gate-tunable superconductor-semiconductor parametric
amplifier. Physical Review Applied. 19(6), 064032.
mla: Phan, Duc T., et al. “Gate-Tunable Superconductor-Semiconductor Parametric
Amplifier.” Physical Review Applied, vol. 19, no. 6, 064032, American Physical
Society, 2023, doi:10.1103/PhysRevApplied.19.064032.
short: D.T. Phan, P. Falthansl-Scheinecker, U. Mishra, W.M. Strickland, D. Langone,
J. Shabani, A.P. Higginbotham, Physical Review Applied 19 (2023).
corr_author: '1'
das_tickbox: '1'
dataavailabilitystatement: The raw data and the plotting code are available in the
Supplemental Material at http://link.aps.org/supplemental/10.1103/PhysRevApplied.19.064032.
Further data are available upon reasonable request.
date_created: 2023-07-23T22:01:12Z
date_published: 2023-06-09T00:00:00Z
date_updated: 2026-07-08T08:38:44Z
day: '09'
department:
- _id: AnHi
- _id: OnHo
doi: 10.1103/PhysRevApplied.19.064032
external_id:
arxiv:
- '2206.05746'
isi:
- '001012022600004'
fulldoi: https://doi.org/10.1103/PhysRevApplied.19.064032
intvolume: ' 19'
isi: 1
issue: '6'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2206.05746
month: '06'
oa: 1
oa_version: Preprint
publication: Physical Review Applied
publication_identifier:
eissn:
- 2331-7019
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
related_material:
record:
- id: '14547'
relation: dissertation_contains
status: public
researchdata_availability: yes (supplementary data)
scopus_import: '1'
status: public
supplementarymaterial: yes
title: Gate-tunable superconductor-semiconductor parametric amplifier
type: journal_article
user_id: 68b8ca59-c5b3-11ee-8790-cd641c68093d
volume: 19
year: '2023'
...
---
OA_place: repository
OA_type: green
_id: '22162'
abstract:
- lang: eng
text: "Given a bipartite graph G, the graphical matrix space SG consists of\r\nmatrices
whose non-zero entries can only be at those positions corresponding to edges in
G. Tutte (J. London Math. Soc., 1947), Edmonds\r\n(J. Res. Nat. Bur. Standards
Sect. B, 1967) and Lov´asz (FCT, 1979) observed connections between perfect matchings
in G and full-rank matrices\r\nin SG. Dieudonn´e (Arch. Math., 1948) proved a
tight upper bound on\r\nthe dimensions of those matrix spaces containing only
singular matrices.\r\nThe starting point of this paper is a simultaneous generalization
of these\r\ntwo classical results: we show that the largest dimension over subspaces\r\nof
SG containing only singular matrices is equal to the maximum size over\r\nsubgraphs
of G without perfect matchings, based on Meshulam’s proof of\r\nDieudonn´e’s result
(Quart. J. Math., 1985).\r\nStarting from this result, we go on to establish more
connections\r\nbetween properties of graphs and matrix spaces. For example, we\r\nestablish
connections between acyclicity and nilpotency, between strong\r\nconnectivity
and irreducibility, and between isomorphism and\r\nconjugacy/congruence. For each
connection, we study three types of correspondences, namely the basic correspondence,
the inherited correspondence (for subgraphs and subspaces), and the induced correspondence\r\n(for
induced subgraphs and restrictions). Some correspondences lead to\r\nintriguing
generalizations of classical results, such as Dieudonn´e’s result\r\nmentioned
above, and a celebrated theorem of Gerstenhaber regarding the\r\nlargest dimension
of nil matrix spaces (Amer. J. Math., 1958).\r\nFinally, we show some implications
of our results to quantum information and present open problems in computational
complexity motivated\r\nby these results."
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Yinan
full_name: Li, Yinan
last_name: Li
- first_name: Youming
full_name: Qiao, Youming
last_name: Qiao
- first_name: Avi
full_name: Wigderson, Avi
last_name: Wigderson
- first_name: Yuval
full_name: Wigderson, Yuval
id: 2d0023a0-1567-11f0-833d-d5c1e476d4b5
last_name: Wigderson
- first_name: Chuanqi
full_name: Zhang, Chuanqi
last_name: Zhang
citation:
ama: Li Y, Qiao Y, Wigderson A, Wigderson Y, Zhang C. Connections between graphs
and matrix spaces. Israel Journal of Mathematics. 2023;256(2):513-580.
doi:10.1007/s11856-023-2515-7
apa: Li, Y., Qiao, Y., Wigderson, A., Wigderson, Y., & Zhang, C. (2023). Connections
between graphs and matrix spaces. Israel Journal of Mathematics. Springer
Nature. https://doi.org/10.1007/s11856-023-2515-7
chicago: Li, Yinan, Youming Qiao, Avi Wigderson, Yuval Wigderson, and Chuanqi Zhang.
“Connections between Graphs and Matrix Spaces.” Israel Journal of Mathematics.
Springer Nature, 2023. https://doi.org/10.1007/s11856-023-2515-7.
ieee: Y. Li, Y. Qiao, A. Wigderson, Y. Wigderson, and C. Zhang, “Connections between
graphs and matrix spaces,” Israel Journal of Mathematics, vol. 256, no.
2. Springer Nature, pp. 513–580, 2023.
ista: Li Y, Qiao Y, Wigderson A, Wigderson Y, Zhang C. 2023. Connections between
graphs and matrix spaces. Israel Journal of Mathematics. 256(2), 513–580.
mla: Li, Yinan, et al. “Connections between Graphs and Matrix Spaces.” Israel
Journal of Mathematics, vol. 256, no. 2, Springer Nature, 2023, pp. 513–80,
doi:10.1007/s11856-023-2515-7.
short: Y. Li, Y. Qiao, A. Wigderson, Y. Wigderson, C. Zhang, Israel Journal of Mathematics
256 (2023) 513–580.
date_created: 2026-06-29T10:52:37Z
date_published: 2023-09-01T00:00:00Z
date_updated: 2026-07-08T10:44:50Z
day: '01'
doi: 10.1007/s11856-023-2515-7
extern: '1'
external_id:
arxiv:
- '2206.04815'
fulldoi: https://doi.org/10.1007/s11856-023-2515-7
intvolume: ' 256'
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2206.04815
month: '09'
oa: 1
oa_version: Preprint
page: 513-580
publication: Israel Journal of Mathematics
publication_identifier:
eissn:
- 1565-8511
issn:
- 0021-2172
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Connections between graphs and matrix spaces
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 256
year: '2023'
...
---
OA_place: repository
OA_type: green
_id: '22159'
abstract:
- lang: eng
text: 'The size Ramsey number of a graph H is defined as the minimum number of edges
in a graph G such that there is a monochromatic copy of H in every two-coloring
of E(G). The size Ramsey number was introduced by Erdős, Faudree, Rousseau, and
Schelp in 1978 and they ended their foundational paper by asking whether one can
determine up to a constant factor the size Ramsey numbers of three families of
graphs: complete bipartite graphs, book graphs (obtained by adding many common
neighbors to the vertices of a clique), and starburst graphs (obtained by adding
many pendant edges to each vertex of a clique). In this paper, we completely resolve
the latter two questions and make substantial progress on the first by determining
the size Ramsey number of Ks,t up to a constant factor for all t=Ω(s log s).'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: David
full_name: Conlon, David
last_name: Conlon
- first_name: Jacob
full_name: Fox, Jacob
last_name: Fox
- first_name: Yuval
full_name: Wigderson, Yuval
id: 2d0023a0-1567-11f0-833d-d5c1e476d4b5
last_name: Wigderson
citation:
ama: Conlon D, Fox J, Wigderson Y. Three early problems on size Ramsey numbers.
Combinatorica. 2023;43(4):743-768. doi:10.1007/s00493-023-00034-7
apa: Conlon, D., Fox, J., & Wigderson, Y. (2023). Three early problems on size
Ramsey numbers. Combinatorica. Springer Nature. https://doi.org/10.1007/s00493-023-00034-7
chicago: Conlon, David, Jacob Fox, and Yuval Wigderson. “Three Early Problems on
Size Ramsey Numbers.” Combinatorica. Springer Nature, 2023. https://doi.org/10.1007/s00493-023-00034-7.
ieee: D. Conlon, J. Fox, and Y. Wigderson, “Three early problems on size Ramsey
numbers,” Combinatorica, vol. 43, no. 4. Springer Nature, pp. 743–768,
2023.
ista: Conlon D, Fox J, Wigderson Y. 2023. Three early problems on size Ramsey numbers.
Combinatorica. 43(4), 743–768.
mla: Conlon, David, et al. “Three Early Problems on Size Ramsey Numbers.” Combinatorica,
vol. 43, no. 4, Springer Nature, 2023, pp. 743–68, doi:10.1007/s00493-023-00034-7.
short: D. Conlon, J. Fox, Y. Wigderson, Combinatorica 43 (2023) 743–768.
date_created: 2026-06-29T10:51:32Z
date_published: 2023-08-01T00:00:00Z
date_updated: 2026-07-08T10:34:40Z
day: '01'
doi: 10.1007/s00493-023-00034-7
extern: '1'
external_id:
arxiv:
- '2111.05420'
fulldoi: https://doi.org/10.1007/s00493-023-00034-7
intvolume: ' 43'
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2111.05420
month: '08'
oa: 1
oa_version: Preprint
page: 743-768
publication: Combinatorica
publication_identifier:
eissn:
- 1439-6912
issn:
- 0209-9683
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Three early problems on size Ramsey numbers
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 43
year: '2023'
...
---
OA_place: publisher
_id: '14641'
abstract:
- lang: eng
text: "Mutation rates represent the net result of complex interactions among various\r\ncellular
processes and can dramatically influence the evolutionary fate of\r\nmicrobial
populations. However, many popular techniques used to study\r\nmutations are subject
to the confounding effects of heredity and the subtleties\r\nof adaptation to
selection, all of which make it difficult to observe any dynamic\r\nresponses
of mutation rates to fitness challenges. Furthermore, in spite of the\r\nubiquity
of quorum sensing systems across the bacterial domain and relevance\r\nfor many
physiological behaviors, the effects of such mechanisms on mutation\r\nrate and
adaptation remain poorly understood. In the following work, I\r\npresent the development
of a microfluidic droplet-based method to measure\r\nsingle base-pair mutation
rates in growing populations of the bacterium\r\nEscherichia coli. I use this
method to observe a stress-induced increase in\r\nmutation rate that is mediated
by luxS, a highly conserved bacterial quorum\r\nsensing component. I also show
that the aforementioned increase in mutation\r\nrate, and its associated control
by luxS, corresponds to a higher degree of\r\nadaptability under competitive environments."
acknowledged_ssus:
- _id: LifeSc
- _id: Bio
- _id: CampIT
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Mike
full_name: Hennessey-Wesen, Mike
id: 3F338C72-F248-11E8-B48F-1D18A9856A87
last_name: Hennessey-Wesen
citation:
ama: Hennessey-Wesen M. Adaptive mutation in E. coli modulated by luxS. 2023. doi:10.15479/at:ista:14641
apa: Hennessey-Wesen, M. (2023). Adaptive mutation in E. coli modulated by luxS.
Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:14641
chicago: Hennessey-Wesen, Mike. “Adaptive Mutation in E. Coli Modulated by LuxS.”
Institute of Science and Technology Austria, 2023. https://doi.org/10.15479/at:ista:14641.
ieee: M. Hennessey-Wesen, “Adaptive mutation in E. coli modulated by luxS,” Institute
of Science and Technology Austria, 2023.
ista: Hennessey-Wesen M. 2023. Adaptive mutation in E. coli modulated by luxS. Institute
of Science and Technology Austria.
mla: Hennessey-Wesen, Mike. Adaptive Mutation in E. Coli Modulated by LuxS.
Institute of Science and Technology Austria, 2023, doi:10.15479/at:ista:14641.
short: M. Hennessey-Wesen, Adaptive Mutation in E. Coli Modulated by LuxS, Institute
of Science and Technology Austria, 2023.
corr_author: '1'
das_tickbox: '1'
date_created: 2023-12-04T13:17:37Z
date_published: 2023-11-30T00:00:00Z
date_updated: 2026-07-13T10:55:56Z
day: '30'
ddc:
- '570'
degree_awarded: PhD
department:
- _id: GradSch
- _id: BjHo
doi: 10.15479/at:ista:14641
doi_confirm: '1'
ec_funded: 1
file:
- access_level: closed
checksum: 4127c285b34f4bf7fb31ef24f9d14c25
content_type: application/vnd.oasis.opendocument.text
creator: mhenness
date_created: 2023-12-06T13:13:26Z
date_updated: 2024-11-30T23:30:05Z
embargo_to: open_access
file_id: '14648'
file_name: mike_thesis_v06-12-2023.odt
file_size: 46405919
relation: source_file
- access_level: closed
checksum: f5203a61eddaf35235bbc51904d73982
content_type: application/pdf
creator: mhenness
date_created: 2023-12-06T13:14:15Z
date_updated: 2026-07-13T10:55:56Z
embargo: 2026-11-18
embargo_to: open_access
file_id: '14649'
file_name: mike_thesis_v06-12-2023.pdf
file_size: 21282155
relation: main_file
- access_level: closed
checksum: 902102d26d30e74dbd6cdd70a65820c3
content_type: application/pdf
creator: cchlebak
date_created: 2025-05-20T12:59:12Z
date_updated: 2025-05-20T22:31:34Z
description: for printing purposes only
embargo_to: open_access
file_id: '19720'
file_name: 2023_Hennessey_Michael_Thesis_print.pdf
file_size: 45847968
relation: other
title: Print version
file_date_updated: 2026-07-13T10:55:56Z
fulldoi: https://doi.org/10.15479/at:ista:14641
has_accepted_license: '1'
keyword:
- microfluidics
- miceobiology
- mutations
- quorum sensing
language:
- iso: eng
month: '11'
oa_version: Published Version
page: '104'
project:
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '665385'
name: International IST Doctoral Program
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
status: public
supervisor:
- first_name: Björn
full_name: Hof, Björn
id: 3A374330-F248-11E8-B48F-1D18A9856A87
last_name: Hof
orcid: 0000-0003-2057-2754
title: Adaptive mutation in E. coli modulated by luxS
type: dissertation
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
year: '2023'
...
---
OA_place: publisher
OA_type: hybrid
_id: '14666'
abstract:
- lang: eng
text: So-called spontaneous activity is a central hallmark of most nervous systems.
Such non-causal firing is contrary to the tenet of spikes as a means of communication,
and its purpose remains unclear. We propose that self-initiated firing can serve
as a release valve to protect neurons from the toxic conditions arising in mitochondria
from lower-than-baseline energy consumption. To demonstrate the viability of our
hypothesis, we built a set of models that incorporate recent experimental results
indicating homeostatic control of metabolic products—Adenosine triphosphate (ATP),
adenosine diphosphate (ADP), and reactive oxygen species (ROS)—by changes in firing.
We explore the relationship of metabolic cost of spiking with its effect on the
temporal patterning of spikes and reproduce experimentally observed changes in
intrinsic firing in the fruitfly dorsal fan-shaped body neuron in a model with
ROS-modulated potassium channels. We also show that metabolic spiking homeostasis
can produce indefinitely sustained avalanche dynamics in cortical circuits. Our
theory can account for key features of neuronal activity observed in many studies
ranging from ion channel function all the way to resting state dynamics. We finish
with a set of experimental predictions that would confirm an integrated, crucial
role for metabolically regulated spiking and firmly link metabolic homeostasis
and neuronal function.
acknowledgement: We thank Prof. C. Nazaret and Prof. J.-P. Mazat for sharing the code
of their mitochondrial model. We also thank G. Miesenböck, E. Marder, L. Abbott,
A. Kempf, P. Hasenhuetl, W. Podlaski, F. Zenke, E. Agnes, P. Bozelos, J. Watson,
B. Confavreux, and G. Christodoulou, and the rest of the Vogels Lab for their feedback.
This work was funded by Wellcome Trust and Royal Society Sir Henry Dale Research
Fellowship (WT100000), a Wellcome Trust Senior Research Fellowship (214316/Z/18/Z),
and a UK Research and Innovation, Biotechnology and Biological Sciences Research
Council grant (UKRI-BBSRC BB/N019512/1).
article_number: e2306525120
article_processing_charge: Yes (in subscription journal)
article_type: original
author:
- first_name: Chaitanya
full_name: Chintaluri, Chaitanya
id: BA06AFEE-A4BA-11EA-AE5C-14673DDC885E
last_name: Chintaluri
orcid: 0000-0003-4252-1608
- first_name: Tim P
full_name: Vogels, Tim P
id: CB6FF8D2-008F-11EA-8E08-2637E6697425
last_name: Vogels
orcid: 0000-0003-3295-6181
citation:
ama: Chintaluri C, Vogels TP. Metabolically regulated spiking could serve neuronal
energy homeostasis and protect from reactive oxygen species. Proceedings of
the National Academy of Sciences of the United States of America. 2023;120(48).
doi:10.1073/pnas.2306525120
apa: Chintaluri, C., & Vogels, T. P. (2023). Metabolically regulated spiking
could serve neuronal energy homeostasis and protect from reactive oxygen species.
Proceedings of the National Academy of Sciences of the United States of America.
National Academy of Sciences. https://doi.org/10.1073/pnas.2306525120
chicago: Chintaluri, Chaitanya, and Tim P Vogels. “Metabolically Regulated Spiking
Could Serve Neuronal Energy Homeostasis and Protect from Reactive Oxygen Species.”
Proceedings of the National Academy of Sciences of the United States of America.
National Academy of Sciences, 2023. https://doi.org/10.1073/pnas.2306525120.
ieee: C. Chintaluri and T. P. Vogels, “Metabolically regulated spiking could serve
neuronal energy homeostasis and protect from reactive oxygen species,” Proceedings
of the National Academy of Sciences of the United States of America, vol.
120, no. 48. National Academy of Sciences, 2023.
ista: Chintaluri C, Vogels TP. 2023. Metabolically regulated spiking could serve
neuronal energy homeostasis and protect from reactive oxygen species. Proceedings
of the National Academy of Sciences of the United States of America. 120(48),
e2306525120.
mla: Chintaluri, Chaitanya, and Tim P. Vogels. “Metabolically Regulated Spiking
Could Serve Neuronal Energy Homeostasis and Protect from Reactive Oxygen Species.”
Proceedings of the National Academy of Sciences of the United States of America,
vol. 120, no. 48, e2306525120, National Academy of Sciences, 2023, doi:10.1073/pnas.2306525120.
short: C. Chintaluri, T.P. Vogels, Proceedings of the National Academy of Sciences
of the United States of America 120 (2023).
corr_author: '1'
das_tickbox: '1'
date_created: 2023-12-10T23:01:00Z
date_published: 2023-11-21T00:00:00Z
date_updated: 2026-07-13T12:30:49Z
day: '21'
ddc:
- '570'
department:
- _id: TiVo
doi: 10.1073/pnas.2306525120
external_id:
isi:
- '001157389000005'
pmid:
- '37988463'
file:
- access_level: open_access
checksum: bf4ec38602a70dae4338077a5a4d497f
content_type: application/pdf
creator: dernst
date_created: 2023-12-11T12:45:12Z
date_updated: 2023-12-11T12:45:12Z
file_id: '14678'
file_name: 2023_PNAS_Chintaluri.pdf
file_size: 16891602
relation: main_file
success: 1
file_date_updated: 2023-12-11T12:45:12Z
fulldoi: https://doi.org/10.1073/pnas.2306525120
has_accepted_license: '1'
intvolume: ' 120'
isi: 1
issue: '48'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
pmid: 1
project:
- _id: c084a126-5a5b-11eb-8a69-d75314a70a87
grant_number: 214316/Z/18/Z
name: What’s in a memory? Spatiotemporal dynamics in strongly coupled recurrent
neuronal networks.
publication: Proceedings of the National Academy of Sciences of the United States
of America
publication_identifier:
eissn:
- 1091-6490
issn:
- 0027-8424
publication_status: published
publisher: National Academy of Sciences
quality_controlled: '1'
related_material:
link:
- relation: software
url: https://github.com/ccluri/metabolic_spiking
scopus_import: '1'
status: public
title: Metabolically regulated spiking could serve neuronal energy homeostasis and
protect from reactive oxygen species
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: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 120
year: '2023'
...
---
OA_place: repository
OA_type: green
_id: '22164'
abstract:
- lang: eng
text: 'The clique removal lemma says that for every ≥r 3 andε > 0, there exists
some δ > 0 so that every n‐vertex graph G with fewer than δnr copies of K r can
be made K r ‐free by removing at most εn2 edges. The dependence of δ on ε in this
result is notoriously difficult to determine: it is known that δ−1 must be at
least super‐polynomial in ε−1, and that it is at most of tower type in εlog −1.
We prove that if one imposes an appropriate minimum degree condition on G, then
one can actually take δ to be a linear function of ε in the clique removal lemma.
Moreover, we determine the threshold for such a minimum degree requirement, showing
that above this threshold we have linear bounds, whereas below the threshold the
bounds are once again super‐polynomial, as in the unrestricted removal lemma.
We also investigate this question for other graphs besides cliques, and prove
some general results about how minimum degree conditions affect the bounds in
the graph removal lemma.'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Jacob
full_name: Fox, Jacob
last_name: Fox
- first_name: Yuval
full_name: Wigderson, Yuval
id: 2d0023a0-1567-11f0-833d-d5c1e476d4b5
last_name: Wigderson
citation:
ama: Fox J, Wigderson Y. Minimum degree and the graph removal lemma. Journal
of Graph Theory. 2023;102(4):648-665. doi:10.1002/jgt.22891
apa: Fox, J., & Wigderson, Y. (2023). Minimum degree and the graph removal lemma.
Journal of Graph Theory. Wiley. https://doi.org/10.1002/jgt.22891
chicago: Fox, Jacob, and Yuval Wigderson. “Minimum Degree and the Graph Removal
Lemma.” Journal of Graph Theory. Wiley, 2023. https://doi.org/10.1002/jgt.22891.
ieee: J. Fox and Y. Wigderson, “Minimum degree and the graph removal lemma,” Journal
of Graph Theory, vol. 102, no. 4. Wiley, pp. 648–665, 2023.
ista: Fox J, Wigderson Y. 2023. Minimum degree and the graph removal lemma. Journal
of Graph Theory. 102(4), 648–665.
mla: Fox, Jacob, and Yuval Wigderson. “Minimum Degree and the Graph Removal Lemma.”
Journal of Graph Theory, vol. 102, no. 4, Wiley, 2023, pp. 648–65, doi:10.1002/jgt.22891.
short: J. Fox, Y. Wigderson, Journal of Graph Theory 102 (2023) 648–665.
date_created: 2026-06-29T10:53:26Z
date_published: 2023-04-01T00:00:00Z
date_updated: 2026-07-14T08:24:20Z
day: '01'
doi: 10.1002/jgt.22891
extern: '1'
external_id:
arxiv:
- '2105.09194'
fulldoi: https://doi.org/10.1002/jgt.22891
intvolume: ' 102'
issue: '4'
keyword:
- chromatic threshold
- graph removal lemma
- homomorphism threshold
- minimum degree conditions
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2105.09194
month: '04'
oa: 1
oa_version: Preprint
page: 648-665
publication: Journal of Graph Theory
publication_identifier:
eissn:
- 1097-0118
issn:
- 0364-9024
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: Minimum degree and the graph removal lemma
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 102
year: '2023'
...
---
OA_place: repository
OA_type: green
_id: '22165'
abstract:
- lang: eng
text: "The book graph \U0001D435(\U0001D458)\r\n\U0001D45B consists of \U0001D45B
copies of \U0001D43E\U0001D458+1 joined along a common \U0001D43E\U0001D458. In
the prequel to this paper, we studied the diagonal Ramsey number \U0001D45F(\U0001D435(\U0001D458)\r\n\U0001D45B,\U0001D435(\U0001D458)\r\n\U0001D45B).
Here we consider the natural off-diagonal variant \U0001D45F(\U0001D435(\U0001D458)\r\n\U0001D450\U0001D45B,\U0001D435(\U0001D458)\r\n\U0001D45B)
for fixed \U0001D450 ∈(0,1]. In this more general setting, we show that an interesting
dichotomy emerges: for very small \U0001D450, a simple \U0001D458-partite construction
dictates the Ramsey function and all nearly-extremal colourings are close to being
\U0001D458-partite, while, for \U0001D450 bounded away from 0, random colourings
of an appropriate density are asymptotically optimal and all nearly-extremal colourings
are quasirandom. Our investigations also open up a range of questions about what
happens for intermediate values of \U0001D450.\r\n\r\n"
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: David
full_name: Conlon, David
last_name: Conlon
- first_name: Jacob
full_name: Fox, Jacob
last_name: Fox
- first_name: Yuval
full_name: Wigderson, Yuval
id: 2d0023a0-1567-11f0-833d-d5c1e476d4b5
last_name: Wigderson
citation:
ama: Conlon D, Fox J, Wigderson Y. Off-diagonal book Ramsey numbers. Combinatorics,
Probability and Computing. 2023;32(3):516-545. doi:10.1017/s0963548322000360
apa: Conlon, D., Fox, J., & Wigderson, Y. (2023). Off-diagonal book Ramsey numbers.
Combinatorics, Probability and Computing. Cambridge University Press. https://doi.org/10.1017/s0963548322000360
chicago: Conlon, David, Jacob Fox, and Yuval Wigderson. “Off-Diagonal Book Ramsey
Numbers.” Combinatorics, Probability and Computing. Cambridge University
Press, 2023. https://doi.org/10.1017/s0963548322000360.
ieee: D. Conlon, J. Fox, and Y. Wigderson, “Off-diagonal book Ramsey numbers,” Combinatorics,
Probability and Computing, vol. 32, no. 3. Cambridge University Press, pp.
516–545, 2023.
ista: Conlon D, Fox J, Wigderson Y. 2023. Off-diagonal book Ramsey numbers. Combinatorics,
Probability and Computing. 32(3), 516–545.
mla: Conlon, David, et al. “Off-Diagonal Book Ramsey Numbers.” Combinatorics,
Probability and Computing, vol. 32, no. 3, Cambridge University Press, 2023,
pp. 516–45, doi:10.1017/s0963548322000360.
short: D. Conlon, J. Fox, Y. Wigderson, Combinatorics, Probability and Computing
32 (2023) 516–545.
date_created: 2026-06-29T10:53:47Z
date_published: 2023-05-01T00:00:00Z
date_updated: 2026-07-14T08:27:40Z
day: '01'
doi: 10.1017/s0963548322000360
extern: '1'
external_id:
arxiv:
- '2110.14483'
fulldoi: https://doi.org/10.1017/s0963548322000360
intvolume: ' 32'
issue: '3'
keyword:
- Ramsey theory
- book graphs
- Ramsey goodness
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2110.14483
mathsc:
- 05C55
- 05D10
month: '05'
oa: 1
oa_version: Preprint
page: 516-545
publication: Combinatorics, Probability and Computing
publication_identifier:
eissn:
- 1469-2163
issn:
- 0963-5483
publication_status: published
publisher: Cambridge University Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Off-diagonal book Ramsey numbers
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 32
year: '2023'
...
---
OA_place: repository
OA_type: green
_id: '22170'
abstract:
- lang: eng
text: "Extending an earlier conjecture of Erdős, Burr and Rosta conjectured that
among all two-colorings of the edges of a complete graph, the uniformly random
coloring asymptotically minimizes the number of monochromatic copies of any fixed
graph H. This conjecture was disproved independently by Sidorenko and Thomason.
The first author later found quantitatively stronger counterexamples, using the
Turán coloring, in which one of the two colors spans a balanced complete multipartite
graph.\r\nWe prove that the Turán coloring is extremal for an infinite family
of graphs, and that it is the unique extremal coloring. This yields the first
determination of the Ramsey multiplicity constant of a graph for which the Burr--Rosta
conjecture fails.\r\nWe also prove an analogous three-color result. In this case,
our result is conditional on a certain natural conjecture on the behavior of two-color
Ramsey numbers."
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Jacob
full_name: Fox, Jacob
last_name: Fox
- first_name: Yuval
full_name: Wigderson, Yuval
id: 2d0023a0-1567-11f0-833d-d5c1e476d4b5
last_name: Wigderson
citation:
ama: Fox J, Wigderson Y. Ramsey multiplicity and the Turán coloring. Advances
in Combinatorics. 2023. doi:10.19086/aic.2023.2
apa: Fox, J., & Wigderson, Y. (2023). Ramsey multiplicity and the Turán coloring.
Advances in Combinatorics. Alliance of Diamond Open Access Journals. https://doi.org/10.19086/aic.2023.2
chicago: Fox, Jacob, and Yuval Wigderson. “Ramsey Multiplicity and the Turán Coloring.”
Advances in Combinatorics. Alliance of Diamond Open Access Journals, 2023.
https://doi.org/10.19086/aic.2023.2.
ieee: J. Fox and Y. Wigderson, “Ramsey multiplicity and the Turán coloring,” Advances
in Combinatorics. Alliance of Diamond Open Access Journals, 2023.
ista: Fox J, Wigderson Y. 2023. Ramsey multiplicity and the Turán coloring. Advances
in Combinatorics.
mla: Fox, Jacob, and Yuval Wigderson. “Ramsey Multiplicity and the Turán Coloring.”
Advances in Combinatorics, Alliance of Diamond Open Access Journals, 2023,
doi:10.19086/aic.2023.2.
short: J. Fox, Y. Wigderson, Advances in Combinatorics (2023).
date_created: 2026-06-29T10:55:46Z
date_published: 2023-01-01T00:00:00Z
date_updated: 2026-07-14T08:45:53Z
day: '01'
doi: 10.19086/aic.2023.2
extern: '1'
external_id:
arxiv:
- '2207.07775'
fulldoi: https://doi.org/10.19086/aic.2023.2
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2207.07775
month: '01'
oa: 1
oa_version: Preprint
publication: Advances in Combinatorics
publication_identifier:
eissn:
- 2517-5599
publication_status: published
publisher: Alliance of Diamond Open Access Journals
quality_controlled: '1'
scopus_import: '1'
status: public
title: Ramsey multiplicity and the Turán coloring
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2023'
...
---
OA_place: repository
OA_type: green
_id: '22176'
abstract:
- lang: eng
text: "The Ramsey number r(G,H) is the minimum N such that every graph on N vertices
contains G as a subgraph or its complement contains H as a subgraph. For integers
n≥k≥1, the k-book Bk,n is the graph on n vertices consisting of a copy of Kk,
called the spine, as well as n−k additional vertices each adjacent to every vertex
of the spine and non-adjacent to each other. A connected graph H on n vertices
is called p-good if r(Kp,H)=(p−1)(n−1)+1. Nikiforov and Rousseau proved that if
n is sufficiently large in terms of p and k, then Bk,n is p-good. Their proof
uses Szemerédi's regularity lemma and gives a tower-type bound on n. We give a
short new proof that avoids using the regularity method and shows that every Bk,n
with n≥2k10p is p-good.\r\nUsing Szemerédi's regularity lemma, Nikiforov and Rousseau
also proved much more general goodness-type results, proving a tight bound on
r(G,H) for several families of sparse graphs G and H as long as |V(G)|<δ|V(H)|
for a small constant δ>0. Using our techniques, we prove a new result of this
type, showing that r(G,H)=(p−1)(n−1)+1 when H=Bk,n and G is a complete p-partite
graph whose first p−1 parts have constant size and whose last part has size δn,
for some small constant δ>0. Again, our proof does not use the regularity method,
and thus yields double-exponential bounds on δ.\r\n"
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Jacob
full_name: Fox, Jacob
last_name: Fox
- first_name: Xiaoyu
full_name: He, Xiaoyu
last_name: He
- first_name: Yuval
full_name: Wigderson, Yuval
id: 2d0023a0-1567-11f0-833d-d5c1e476d4b5
last_name: Wigderson
citation:
ama: Fox J, He X, Wigderson Y. Ramsey goodness of books revisited. Advances in
Combinatorics. 2023. doi:10.19086/aic.2023.4
apa: Fox, J., He, X., & Wigderson, Y. (2023). Ramsey goodness of books revisited.
Advances in Combinatorics. Alliance of Diamond Open Access Journals. https://doi.org/10.19086/aic.2023.4
chicago: Fox, Jacob, Xiaoyu He, and Yuval Wigderson. “Ramsey Goodness of Books Revisited.”
Advances in Combinatorics. Alliance of Diamond Open Access Journals, 2023.
https://doi.org/10.19086/aic.2023.4.
ieee: J. Fox, X. He, and Y. Wigderson, “Ramsey goodness of books revisited,” Advances
in Combinatorics. Alliance of Diamond Open Access Journals, 2023.
ista: Fox J, He X, Wigderson Y. 2023. Ramsey goodness of books revisited. Advances
in Combinatorics.
mla: Fox, Jacob, et al. “Ramsey Goodness of Books Revisited.” Advances in Combinatorics,
Alliance of Diamond Open Access Journals, 2023, doi:10.19086/aic.2023.4.
short: J. Fox, X. He, Y. Wigderson, Advances in Combinatorics (2023).
date_created: 2026-06-29T10:58:11Z
date_published: 2023-07-29T00:00:00Z
date_updated: 2026-07-14T09:05:44Z
day: '29'
doi: 10.19086/aic.2023.4
extern: '1'
external_id:
arxiv:
- '2109.09205'
fulldoi: https://doi.org/10.19086/aic.2023.4
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2109.09205
month: '07'
oa: 1
oa_version: Preprint
publication: Advances in Combinatorics
publication_identifier:
eissn:
- 2517-5599
publication_status: published
publisher: Alliance of Diamond Open Access Journals
quality_controlled: '1'
scopus_import: '1'
status: public
title: Ramsey goodness of books revisited
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2023'
...