---
OA_place: repository
OA_type: green
_id: '18261'
article_processing_charge: No
arxiv: 1
author:
- first_name: Anton
full_name: Tsitsulin, Anton
last_name: Tsitsulin
- first_name: Davide
full_name: Mottin, Davide
last_name: Mottin
- first_name: Panagiotis
full_name: Karras, Panagiotis
last_name: Karras
- first_name: Alexander
full_name: Bronstein, Alexander
id: 58f3726e-7cba-11ef-ad8b-e6e8cb3904e6
last_name: Bronstein
orcid: 0000-0001-9699-8730
- first_name: Emmanuel
full_name: Müller, Emmanuel
last_name: Müller
citation:
ama: 'Tsitsulin A, Mottin D, Karras P, Bronstein AM, Müller E. Spectral graph complexity.
In: Companion Proceedings of The 2019 World Wide Web Conference. ACM; 2019:308-309.
doi:10.1145/3308560.3316589'
apa: 'Tsitsulin, A., Mottin, D., Karras, P., Bronstein, A. M., & Müller, E.
(2019). Spectral graph complexity. In Companion Proceedings of The 2019 World
Wide Web Conference (pp. 308–309). San Francisco, CA, United States: ACM.
https://doi.org/10.1145/3308560.3316589'
chicago: Tsitsulin, Anton, Davide Mottin, Panagiotis Karras, Alex M. Bronstein,
and Emmanuel Müller. “Spectral Graph Complexity.” In Companion Proceedings
of The 2019 World Wide Web Conference, 308–9. ACM, 2019. https://doi.org/10.1145/3308560.3316589.
ieee: A. Tsitsulin, D. Mottin, P. Karras, A. M. Bronstein, and E. Müller, “Spectral
graph complexity,” in Companion Proceedings of The 2019 World Wide Web Conference,
San Francisco, CA, United States, 2019, pp. 308–309.
ista: 'Tsitsulin A, Mottin D, Karras P, Bronstein AM, Müller E. 2019. Spectral graph
complexity. Companion Proceedings of The 2019 World Wide Web Conference. WWW:
The Web Conference, 308–309.'
mla: Tsitsulin, Anton, et al. “Spectral Graph Complexity.” Companion Proceedings
of The 2019 World Wide Web Conference, ACM, 2019, pp. 308–09, doi:10.1145/3308560.3316589.
short: A. Tsitsulin, D. Mottin, P. Karras, A.M. Bronstein, E. Müller, in:, Companion
Proceedings of The 2019 World Wide Web Conference, ACM, 2019, pp. 308–309.
conference:
end_date: 2019-05-17
location: San Francisco, CA, United States
name: 'WWW: The Web Conference'
start_date: 2019-05-13
date_created: 2024-10-08T13:08:59Z
date_published: 2019-05-13T00:00:00Z
date_updated: 2025-02-04T14:57:55Z
day: '13'
doi: 10.1145/3308560.3316589
extern: '1'
external_id:
arxiv:
- '2211.01434'
fulldoi: https://doi.org/10.1145/3308560.3316589
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2211.01434
month: '05'
oa: 1
oa_version: Preprint
page: 308 - 309
publication: Companion Proceedings of The 2019 World Wide Web Conference
publication_identifier:
isbn:
- '9781450366755'
publication_status: published
publisher: ACM
quality_controlled: '1'
scopus_import: '1'
status: public
title: Spectral graph complexity
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2019'
...
---
_id: '18262'
abstract:
- lang: eng
text: This paper explores a fully unsupervised deep learning approach for computing
distance-preserving maps that generate low-dimensional embeddings for a certain
class of manifolds. We use the Siamese configuration to train a neural network
to solve the problem of least squares multidimensional scaling for generating
maps that approximately preserve geodesic distances. By training with only a few
landmarks, we show a significantly improved local and nonlocal generalization
of the isometric mapping as compared to analogous non-parametric counterparts.
Importantly, the combination of a deep-learning framework with a multidimensional
scaling objective enables a numerical analysis of network architectures to aid
in understanding their representation power. This provides a geometric perspective
to the generalizability of deep learning.
article_number: '8658791'
article_processing_charge: No
arxiv: 1
author:
- first_name: Gautam
full_name: Pai, Gautam
last_name: Pai
- first_name: Ronen
full_name: Talmon, Ronen
last_name: Talmon
- first_name: Alexander
full_name: Bronstein, Alexander
id: 58f3726e-7cba-11ef-ad8b-e6e8cb3904e6
last_name: Bronstein
orcid: 0000-0001-9699-8730
- first_name: Ron
full_name: Kimmel, Ron
last_name: Kimmel
citation:
ama: 'Pai G, Talmon R, Bronstein AM, Kimmel R. DIMAL: Deep isometric manifold learning
using sparse geodesic sampling. In: 2019 IEEE Winter Conference on Applications
of Computer Vision (WACV). IEEE; 2019. doi:10.1109/wacv.2019.00092'
apa: 'Pai, G., Talmon, R., Bronstein, A. M., & Kimmel, R. (2019). DIMAL: Deep
isometric manifold learning using sparse geodesic sampling. In 2019 IEEE Winter
Conference on Applications of Computer Vision (WACV). Waikoloa, HI, United
States: IEEE. https://doi.org/10.1109/wacv.2019.00092'
chicago: 'Pai, Gautam, Ronen Talmon, Alex M. Bronstein, and Ron Kimmel. “DIMAL:
Deep Isometric Manifold Learning Using Sparse Geodesic Sampling.” In 2019 IEEE
Winter Conference on Applications of Computer Vision (WACV). IEEE, 2019. https://doi.org/10.1109/wacv.2019.00092.'
ieee: 'G. Pai, R. Talmon, A. M. Bronstein, and R. Kimmel, “DIMAL: Deep isometric
manifold learning using sparse geodesic sampling,” in 2019 IEEE Winter Conference
on Applications of Computer Vision (WACV), Waikoloa, HI, United States, 2019.'
ista: 'Pai G, Talmon R, Bronstein AM, Kimmel R. 2019. DIMAL: Deep isometric manifold
learning using sparse geodesic sampling. 2019 IEEE Winter Conference on Applications
of Computer Vision (WACV). 19th IEEE Winter Conference on Applications of Computer
Vision, 8658791.'
mla: 'Pai, Gautam, et al. “DIMAL: Deep Isometric Manifold Learning Using Sparse
Geodesic Sampling.” 2019 IEEE Winter Conference on Applications of Computer
Vision (WACV), 8658791, IEEE, 2019, doi:10.1109/wacv.2019.00092.'
short: G. Pai, R. Talmon, A.M. Bronstein, R. Kimmel, in:, 2019 IEEE Winter Conference
on Applications of Computer Vision (WACV), IEEE, 2019.
conference:
end_date: 2019-01-11
location: Waikoloa, HI, United States
name: 19th IEEE Winter Conference on Applications of Computer Vision
start_date: 2019-01-07
date_created: 2024-10-08T13:09:16Z
date_published: 2019-03-07T00:00:00Z
date_updated: 2025-01-14T14:34:56Z
day: '07'
doi: 10.1109/wacv.2019.00092
extern: '1'
external_id:
arxiv:
- '1711.06011'
fulldoi: https://doi.org/10.1109/wacv.2019.00092
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.1711.06011
month: '03'
oa: 1
oa_version: Preprint
publication: 2019 IEEE Winter Conference on Applications of Computer Vision (WACV)
publication_identifier:
isbn:
- '9781728119762'
publication_status: published
publisher: IEEE
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'DIMAL: Deep isometric manifold learning using sparse geodesic sampling'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2019'
...
---
OA_place: repository
OA_type: green
_id: '18263'
abstract:
- lang: eng
text: We consider the tasks of representing, analysing and manipulating maps between
shapes. We model maps as densities over the product manifold of the input shapes;
these densities can be treated as scalar functions and therefore are manipulable
using the language of signal processing on manifolds. Being a manifold itself,
the product space endows the set of maps with a geometry of its own, which we
exploit to define map operations in the spectral domain; we also derive relationships
with other existing representations (soft maps and functional maps). To apply
these ideas in practice, we discretize product manifolds and their Laplace–Beltrami
operators, and we introduce localized spectral analysis of the product manifold
as a novel tool for map processing. Our framework applies to maps defined between
and across 2D and 3D shapes without requiring special adjustment, and it can be
implemented efficiently with simple operations on sparse matrices.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: E.
full_name: Rodolà, E.
last_name: Rodolà
- first_name: Z.
full_name: Lähner, Z.
last_name: Lähner
- first_name: Alexander
full_name: Bronstein, Alexander
id: 58f3726e-7cba-11ef-ad8b-e6e8cb3904e6
last_name: Bronstein
orcid: 0000-0001-9699-8730
- first_name: M. M.
full_name: Bronstein, M. M.
last_name: Bronstein
- first_name: J.
full_name: Solomon, J.
last_name: Solomon
citation:
ama: Rodolà E, Lähner Z, Bronstein AM, Bronstein MM, Solomon J. Functional maps
representation on product manifolds. Computer Graphics Forum. 2019;38(1):678-689.
doi:10.1111/cgf.13598
apa: Rodolà, E., Lähner, Z., Bronstein, A. M., Bronstein, M. M., & Solomon,
J. (2019). Functional maps representation on product manifolds. Computer Graphics
Forum. Wiley. https://doi.org/10.1111/cgf.13598
chicago: Rodolà, E., Z. Lähner, Alex M. Bronstein, M. M. Bronstein, and J. Solomon.
“Functional Maps Representation on Product Manifolds.” Computer Graphics Forum.
Wiley, 2019. https://doi.org/10.1111/cgf.13598.
ieee: E. Rodolà, Z. Lähner, A. M. Bronstein, M. M. Bronstein, and J. Solomon, “Functional
maps representation on product manifolds,” Computer Graphics Forum, vol.
38, no. 1. Wiley, pp. 678–689, 2019.
ista: Rodolà E, Lähner Z, Bronstein AM, Bronstein MM, Solomon J. 2019. Functional
maps representation on product manifolds. Computer Graphics Forum. 38(1), 678–689.
mla: Rodolà, E., et al. “Functional Maps Representation on Product Manifolds.” Computer
Graphics Forum, vol. 38, no. 1, Wiley, 2019, pp. 678–89, doi:10.1111/cgf.13598.
short: E. Rodolà, Z. Lähner, A.M. Bronstein, M.M. Bronstein, J. Solomon, Computer
Graphics Forum 38 (2019) 678–689.
date_created: 2024-10-08T13:09:33Z
date_published: 2019-02-01T00:00:00Z
date_updated: 2024-10-16T13:07:30Z
day: '01'
doi: 10.1111/cgf.13598
extern: '1'
external_id:
arxiv:
- '1809.10940'
fulldoi: https://doi.org/10.1111/cgf.13598
intvolume: ' 38'
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.1809.10940
month: '02'
oa: 1
oa_version: Preprint
page: 678-689
publication: Computer Graphics Forum
publication_identifier:
eissn:
- 1467-8659
issn:
- 0167-7055
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: Functional maps representation on product manifolds
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 38
year: '2019'
...
---
OA_place: repository
OA_type: green
_id: '18264'
abstract:
- lang: eng
text: We present DeepISP, a full end-to-end deep neural model of the camera image
signal processing pipeline. Our model learns a mapping from the raw low-light
mosaiced image to the final visually compelling image and encompasses low-level
tasks, such as demosaicing and denoising, as well as higher-level tasks, such
as color correction and image adjustment. The training and evaluation of the pipeline
were performed on a dedicated data set containing pairs of low-light and well-lit
images captured by a Samsung S7 smartphone camera in both raw and processed JPEG
formats. The proposed solution achieves the state-of-the-art performance in objective
evaluation of peak signal-to-noise ratio on the subtask of joint denoising and
demosaicing. For the full end-to-end pipeline, it achieves better visual quality
compared to the manufacturer ISP, in both a subjective human assessment and when
rated by a deep model trained for assessing image quality.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Eli
full_name: Schwartz, Eli
last_name: Schwartz
- first_name: Raja
full_name: Giryes, Raja
last_name: Giryes
- first_name: Alexander
full_name: Bronstein, Alexander
id: 58f3726e-7cba-11ef-ad8b-e6e8cb3904e6
last_name: Bronstein
orcid: 0000-0001-9699-8730
citation:
ama: 'Schwartz E, Giryes R, Bronstein AM. DeepISP: Toward learning an end-to-end
image processing pipeline. IEEE Transactions on Image Processing. 2019;28(2):912-923.
doi:10.1109/tip.2018.2872858'
apa: 'Schwartz, E., Giryes, R., & Bronstein, A. M. (2019). DeepISP: Toward learning
an end-to-end image processing pipeline. IEEE Transactions on Image Processing.
Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/tip.2018.2872858'
chicago: 'Schwartz, Eli, Raja Giryes, and Alex M. Bronstein. “DeepISP: Toward Learning
an End-to-End Image Processing Pipeline.” IEEE Transactions on Image Processing.
Institute of Electrical and Electronics Engineers, 2019. https://doi.org/10.1109/tip.2018.2872858.'
ieee: 'E. Schwartz, R. Giryes, and A. M. Bronstein, “DeepISP: Toward learning an
end-to-end image processing pipeline,” IEEE Transactions on Image Processing,
vol. 28, no. 2. Institute of Electrical and Electronics Engineers, pp. 912–923,
2019.'
ista: 'Schwartz E, Giryes R, Bronstein AM. 2019. DeepISP: Toward learning an end-to-end
image processing pipeline. IEEE Transactions on Image Processing. 28(2), 912–923.'
mla: 'Schwartz, Eli, et al. “DeepISP: Toward Learning an End-to-End Image Processing
Pipeline.” IEEE Transactions on Image Processing, vol. 28, no. 2, Institute
of Electrical and Electronics Engineers, 2019, pp. 912–23, doi:10.1109/tip.2018.2872858.'
short: E. Schwartz, R. Giryes, A.M. Bronstein, IEEE Transactions on Image Processing
28 (2019) 912–923.
date_created: 2024-10-08T13:09:51Z
date_published: 2019-02-01T00:00:00Z
date_updated: 2024-10-16T13:03:28Z
day: '01'
doi: 10.1109/tip.2018.2872858
extern: '1'
external_id:
arxiv:
- '1801.06724'
pmid:
- '30281451'
fulldoi: https://doi.org/10.1109/tip.2018.2872858
intvolume: ' 28'
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.1801.06724
month: '02'
oa: 1
oa_version: Preprint
page: 912-923
pmid: 1
publication: IEEE Transactions on Image Processing
publication_identifier:
issn:
- 1057-7149
- 1941-0042
publication_status: published
publisher: Institute of Electrical and Electronics Engineers
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'DeepISP: Toward learning an end-to-end image processing pipeline'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 28
year: '2019'
...
---
OA_place: repository
OA_type: free access
_id: '18268'
abstract:
- lang: eng
text: The registration of surfaces with non-rigid deformation, especially non-isometric
deformations, is a challenging problem. When applying such techniques to real
scans, the problem is compounded by topological and geometric inconsistencies
between shapes. In this paper, we capture a benchmark dataset of scanned 3D shapes
undergoing various controlled deformations (articulating, bending, stretching
and topologically changing), along with ground truth correspondences. With the
aid of this tiered benchmark of increasingly challenging real scans, we explore
this problem and investigate how robust current state-of- the-art methods perform
in different challenging registration and correspondence scenarios. We discover
that changes in topology is a challenging problem for some methods and that machine
learning-based approaches prove to be more capable of handling non-isometric deformations
on shapes that are moderately similar to the training set.
article_processing_charge: No
author:
- first_name: R.M.
full_name: Dyke, R.M.
last_name: Dyke
- first_name: C.
full_name: Stride, C.
last_name: Stride
- first_name: Y.-K.
full_name: Lai, Y.-K.
last_name: Lai
- first_name: P.L.
full_name: Rosin, P.L.
last_name: Rosin
- first_name: M.
full_name: Aubry, M.
last_name: Aubry
- first_name: A.
full_name: Boyarski, A.
last_name: Boyarski
- first_name: Alexander
full_name: Bronstein, Alexander
id: 58f3726e-7cba-11ef-ad8b-e6e8cb3904e6
last_name: Bronstein
orcid: 0000-0001-9699-8730
- first_name: M.M.
full_name: Bronstein, M.M.
last_name: Bronstein
- first_name: D.
full_name: Cremers, D.
last_name: Cremers
- first_name: M.
full_name: Fisher, M.
last_name: Fisher
- first_name: T.
full_name: Groueix, T.
last_name: Groueix
- first_name: D.
full_name: Guo, D.
last_name: Guo
- first_name: V.G.
full_name: Kim, V.G.
last_name: Kim
- first_name: R.
full_name: Kimmel, R.
last_name: Kimmel
- first_name: Z.
full_name: Lähner, Z.
last_name: Lähner
- first_name: K.
full_name: Li, K.
last_name: Li
- first_name: O.
full_name: Litany, O.
last_name: Litany
- first_name: T.
full_name: Remez, T.
last_name: Remez
- first_name: E.
full_name: Rodola, E.
last_name: Rodola
- first_name: B.C.
full_name: Russell, B.C.
last_name: Russell
- first_name: Y.
full_name: Sahillioglu, Y.
last_name: Sahillioglu
- first_name: R.
full_name: Slossberg, R.
last_name: Slossberg
- first_name: G.K.L.
full_name: Tam, G.K.L.
last_name: Tam
- first_name: M.
full_name: Vestner, M.
last_name: Vestner
- first_name: Z.
full_name: Wu, Z.
last_name: Wu
- first_name: J.
full_name: Yang, J.
last_name: Yang
citation:
ama: 'Dyke RM, Stride C, Lai Y-K, et al. Shape correspondence with isometric and
non-isometric deformations. In: Eurographics Workshop on 3D Object Retrieval.
The Eurographics Association; 2019. doi:10.2312/3DOR.20191069'
apa: Dyke, R. M., Stride, C., Lai, Y.-K., Rosin, P. L., Aubry, M., Boyarski, A.,
… Yang, J. (2019). Shape correspondence with isometric and non-isometric deformations.
In Eurographics Workshop on 3D Object Retrieval. The Eurographics Association.
https://doi.org/10.2312/3DOR.20191069
chicago: Dyke, R.M., C. Stride, Y.-K. Lai, P.L. Rosin, M. Aubry, A. Boyarski, Alex
M. Bronstein, et al. “Shape Correspondence with Isometric and Non-Isometric Deformations.”
In Eurographics Workshop on 3D Object Retrieval. The Eurographics Association,
2019. https://doi.org/10.2312/3DOR.20191069.
ieee: R. M. Dyke et al., “Shape correspondence with isometric and non-isometric
deformations,” in Eurographics Workshop on 3D Object Retrieval, 2019.
ista: Dyke RM, Stride C, Lai Y-K, Rosin PL, Aubry M, Boyarski A, Bronstein AM, Bronstein
MM, Cremers D, Fisher M, Groueix T, Guo D, Kim VG, Kimmel R, Lähner Z, Li K, Litany
O, Remez T, Rodola E, Russell BC, Sahillioglu Y, Slossberg R, Tam GKL, Vestner
M, Wu Z, Yang J. 2019. Shape correspondence with isometric and non-isometric deformations.
Eurographics Workshop on 3D Object Retrieval. .
mla: Dyke, R. M., et al. “Shape Correspondence with Isometric and Non-Isometric
Deformations.” Eurographics Workshop on 3D Object Retrieval, The Eurographics
Association, 2019, doi:10.2312/3DOR.20191069.
short: R.M. Dyke, C. Stride, Y.-K. Lai, P.L. Rosin, M. Aubry, A. Boyarski, A.M.
Bronstein, M.M. Bronstein, D. Cremers, M. Fisher, T. Groueix, D. Guo, V.G. Kim,
R. Kimmel, Z. Lähner, K. Li, O. Litany, T. Remez, E. Rodola, B.C. Russell, Y.
Sahillioglu, R. Slossberg, G.K.L. Tam, M. Vestner, Z. Wu, J. Yang, in:, Eurographics
Workshop on 3D Object Retrieval, The Eurographics Association, 2019.
date_created: 2024-10-09T07:40:27Z
date_published: 2019-01-01T00:00:00Z
date_updated: 2025-02-03T09:44:33Z
day: '01'
doi: 10.2312/3DOR.20191069
extern: '1'
fulldoi: https://doi.org/10.2312/3DOR.20191069
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.2312/3DOR.20191069
month: '01'
oa: 1
oa_version: Published Version
publication: Eurographics Workshop on 3D Object Retrieval
publication_identifier:
eissn:
- 1997-0471
publication_status: published
publisher: The Eurographics Association
quality_controlled: '1'
status: public
title: Shape correspondence with isometric and non-isometric deformations
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2019'
...
---
_id: '18269'
abstract:
- lang: eng
text: 'In the past few years, deep learning-based methods have demonstrated enormous
success for solving inverse problems in medical imaging. In this work, we address
the following question: Given a set of measurements obtained from real imaging
experiments, what is the best way to use a learnable model and the physics of
the modality to solve the inverse problem and reconstruct the latent image? Standard
supervised learning based methods approach this problem by collecting data sets
of known latent images and their corresponding measurements. However, these methods
are often impractical due to the lack of availability of appropriately sized training
sets, and, more generally, due to the inherent difficulty in measuring the “groundtruth”
latent image. In light of this, we propose a self-supervised approach to training
inverse models in medical imaging in the absence of aligned data. Our method only
requiring access to the measurements and the forward model at training. We showcase
its effectiveness on inverse problems arising in accelerated magnetic resonance
imaging (MRI). '
article_processing_charge: No
author:
- first_name: Ortal
full_name: Senouf, Ortal
last_name: Senouf
- first_name: Sanketh
full_name: Vedula, Sanketh
last_name: Vedula
- first_name: Tomer
full_name: Weiss, Tomer
last_name: Weiss
- first_name: Alexander
full_name: Bronstein, Alexander
id: 58f3726e-7cba-11ef-ad8b-e6e8cb3904e6
last_name: Bronstein
orcid: 0000-0001-9699-8730
- first_name: Oleg
full_name: Michailovich, Oleg
last_name: Michailovich
- first_name: Michael
full_name: Zibulevsky, Michael
last_name: Zibulevsky
citation:
ama: 'Senouf O, Vedula S, Weiss T, Bronstein AM, Michailovich O, Zibulevsky M. Self-supervised
learning of inverse problem solvers in medical imaging. In: First MICCAI Workshop,
DART 2019, and First International Workshop, MIL3ID 2019. Vol 11795. Springer
International Publishing; 2019:111-119. doi:10.1007/978-3-030-33391-1_13'
apa: 'Senouf, O., Vedula, S., Weiss, T., Bronstein, A. M., Michailovich, O., &
Zibulevsky, M. (2019). Self-supervised learning of inverse problem solvers in
medical imaging. In First MICCAI Workshop, DART 2019, and First International
Workshop, MIL3ID 2019 (Vol. 11795, pp. 111–119). Shenzhen, China: Springer
International Publishing. https://doi.org/10.1007/978-3-030-33391-1_13'
chicago: Senouf, Ortal, Sanketh Vedula, Tomer Weiss, Alex M. Bronstein, Oleg Michailovich,
and Michael Zibulevsky. “Self-Supervised Learning of Inverse Problem Solvers in
Medical Imaging.” In First MICCAI Workshop, DART 2019, and First International
Workshop, MIL3ID 2019, 11795:111–19. Springer International Publishing, 2019.
https://doi.org/10.1007/978-3-030-33391-1_13.
ieee: O. Senouf, S. Vedula, T. Weiss, A. M. Bronstein, O. Michailovich, and M. Zibulevsky,
“Self-supervised learning of inverse problem solvers in medical imaging,” in First
MICCAI Workshop, DART 2019, and First International Workshop, MIL3ID 2019,
Shenzhen, China, 2019, vol. 11795, pp. 111–119.
ista: 'Senouf O, Vedula S, Weiss T, Bronstein AM, Michailovich O, Zibulevsky M.
2019. Self-supervised learning of inverse problem solvers in medical imaging.
First MICCAI Workshop, DART 2019, and First International Workshop, MIL3ID 2019.
DART: MICCAI Workshop on Domain Adaptation and Representation Transfer and MIL3ID:
International Workshop on Medical Image Learning with Less Labels and Imperfect
Data vol. 11795, 111–119.'
mla: Senouf, Ortal, et al. “Self-Supervised Learning of Inverse Problem Solvers
in Medical Imaging.” First MICCAI Workshop, DART 2019, and First International
Workshop, MIL3ID 2019, vol. 11795, Springer International Publishing, 2019,
pp. 111–19, doi:10.1007/978-3-030-33391-1_13.
short: O. Senouf, S. Vedula, T. Weiss, A.M. Bronstein, O. Michailovich, M. Zibulevsky,
in:, First MICCAI Workshop, DART 2019, and First International Workshop, MIL3ID
2019, Springer International Publishing, 2019, pp. 111–119.
conference:
end_date: 2019-10-17
location: Shenzhen, China
name: 'DART: MICCAI Workshop on Domain Adaptation and Representation Transfer and
MIL3ID: International Workshop on Medical Image Learning with Less Labels and
Imperfect Data'
start_date: 2019-10-13
date_created: 2024-10-09T07:41:33Z
date_published: 2019-10-12T00:00:00Z
date_updated: 2025-01-23T14:50:36Z
day: '12'
doi: 10.1007/978-3-030-33391-1_13
extern: '1'
fulldoi: https://doi.org/10.1007/978-3-030-33391-1_13
intvolume: ' 11795'
language:
- iso: eng
month: '10'
oa_version: None
page: 111 - 119
publication: First MICCAI Workshop, DART 2019, and First International Workshop, MIL3ID
2019
publication_identifier:
eisbn:
- '9783030333911'
eissn:
- 1611-3349
isbn:
- '9783030333904'
issn:
- 0302-9743
publication_status: published
publisher: Springer International Publishing
quality_controlled: '1'
scopus_import: '1'
status: public
title: Self-supervised learning of inverse problem solvers in medical imaging
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 11795
year: '2019'
...
---
OA_place: repository
OA_type: green
_id: '22048'
abstract:
- lang: eng
text: We prove symplectic non-squeezing for the cubic nonlinear Schrödinger equation
on the line via finite-dimensional approximation.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Rowan
full_name: Killip, Rowan
last_name: Killip
- first_name: Monica
full_name: Visan, Monica
id: 056daca0-b8d1-11f0-964f-f91054abf8ca
last_name: Visan
- first_name: Xiaoyi
full_name: Zhang, Xiaoyi
last_name: Zhang
citation:
ama: Killip R, Vişan M, Zhang X. Symplectic non-squeezing for the cubic NLS on the
line. International Mathematics Research Notices. 2019;2019(5):1312-1332.
doi:10.1093/imrn/rnx152
apa: Killip, R., Vişan, M., & Zhang, X. (2019). Symplectic non-squeezing for
the cubic NLS on the line. International Mathematics Research Notices.
Oxford University Press. https://doi.org/10.1093/imrn/rnx152
chicago: Killip, Rowan, Monica Vişan, and Xiaoyi Zhang. “Symplectic Non-Squeezing
for the Cubic NLS on the Line.” International Mathematics Research Notices.
Oxford University Press, 2019. https://doi.org/10.1093/imrn/rnx152.
ieee: R. Killip, M. Vişan, and X. Zhang, “Symplectic non-squeezing for the cubic
NLS on the line,” International Mathematics Research Notices, vol. 2019,
no. 5. Oxford University Press, pp. 1312–1332, 2019.
ista: Killip R, Vişan M, Zhang X. 2019. Symplectic non-squeezing for the cubic NLS
on the line. International Mathematics Research Notices. 2019(5), 1312–1332.
mla: Killip, Rowan, et al. “Symplectic Non-Squeezing for the Cubic NLS on the Line.”
International Mathematics Research Notices, vol. 2019, no. 5, Oxford University
Press, 2019, pp. 1312–32, doi:10.1093/imrn/rnx152.
short: R. Killip, M. Vişan, X. Zhang, International Mathematics Research Notices
2019 (2019) 1312–1332.
das_tickbox: '1'
date_created: 2026-06-19T07:50:08Z
date_published: 2019-03-01T00:00:00Z
date_updated: 2026-06-25T08:08:21Z
day: '01'
doi: 10.1093/imrn/rnx152
extern: '1'
external_id:
arxiv:
- '1606.09467'
fulldoi: https://doi.org/10.1093/imrn/rnx152
intvolume: ' 2019'
issue: '5'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.1606.09467
month: '03'
oa: 1
oa_version: Preprint
page: 1312-1332
publication: International Mathematics Research Notices
publication_identifier:
eissn:
- 1687-0247
issn:
- 1073-7928
publication_status: published
publisher: Oxford University Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Symplectic non-squeezing for the cubic NLS on the line
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2019
year: '2019'
...
---
OA_place: repository
OA_type: green
_id: '22066'
abstract:
- lang: eng
text: "We prove almost sure global existence and scattering for the energy-critical
nonlinear Schrödinger equation with randomized spherically symmetric initial data
in \U0001D43B\U0001D460(ℝ4) with \r\n5/6<\U0001D460<1. We were inspired to consider
this problem by the recent work of Dodson–Lührmann–Mendelson, which treated the
analogous problem for the energy-critical wave equation."
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Rowan
full_name: Killip, Rowan
last_name: Killip
- first_name: Jason
full_name: Murphy, Jason
last_name: Murphy
- first_name: Monica
full_name: Visan, Monica
id: 056daca0-b8d1-11f0-964f-f91054abf8ca
last_name: Visan
citation:
ama: Killip R, Murphy J, Vişan M. Almost sure scattering for the energy-critical
NLS with radial data below H1(R4). Communications in Partial Differential Equations.
2019;44(1):51-71. doi:10.1080/03605302.2018.1541904
apa: Killip, R., Murphy, J., & Vişan, M. (2019). Almost sure scattering for
the energy-critical NLS with radial data below H1(R4). Communications in Partial
Differential Equations. Informa UK Limited. https://doi.org/10.1080/03605302.2018.1541904
chicago: Killip, Rowan, Jason Murphy, and Monica Vişan. “Almost Sure Scattering
for the Energy-Critical NLS with Radial Data below H1(R4).” Communications
in Partial Differential Equations. Informa UK Limited, 2019. https://doi.org/10.1080/03605302.2018.1541904.
ieee: R. Killip, J. Murphy, and M. Vişan, “Almost sure scattering for the energy-critical
NLS with radial data below H1(R4),” Communications in Partial Differential
Equations, vol. 44, no. 1. Informa UK Limited, pp. 51–71, 2019.
ista: Killip R, Murphy J, Vişan M. 2019. Almost sure scattering for the energy-critical
NLS with radial data below H1(R4). Communications in Partial Differential Equations.
44(1), 51–71.
mla: Killip, Rowan, et al. “Almost Sure Scattering for the Energy-Critical NLS with
Radial Data below H1(R4).” Communications in Partial Differential Equations,
vol. 44, no. 1, Informa UK Limited, 2019, pp. 51–71, doi:10.1080/03605302.2018.1541904.
short: R. Killip, J. Murphy, M. Vişan, Communications in Partial Differential Equations
44 (2019) 51–71.
das_tickbox: '1'
date_created: 2026-06-19T08:13:26Z
date_published: 2019-02-15T00:00:00Z
date_updated: 2026-06-30T07:16:06Z
day: '15'
doi: 10.1080/03605302.2018.1541904
extern: '1'
external_id:
arxiv:
- '1707.09051'
fulldoi: https://doi.org/10.1080/03605302.2018.1541904
intvolume: ' 44'
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.1707.09051
mathsc:
- 35Q55
month: '02'
oa: 1
oa_version: Preprint
page: 51-71
publication: Communications in Partial Differential Equations
publication_identifier:
eissn:
- 1532-4133
issn:
- 0360-5302
publication_status: published
publisher: Informa UK Limited
quality_controlled: '1'
scopus_import: '1'
status: public
title: Almost sure scattering for the energy-critical NLS with radial data below H1(R4)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 44
year: '2019'
...
---
OA_place: repository
OA_type: green
_id: '22077'
abstract:
- lang: eng
text: We prove inverse Strichartz theorems at L^2 regularity for a family of Schrödinger
evolutions in one space dimension. Prior results rely on spacetime Fourier analysis
and are limited to the translation-invariant equation i∂ t u=−1/2 Δu. Motivated
by applications to the mass-critical Schrödinger equation with external potentials
(such as the harmonic oscillator), we use a physical space approach.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Casey
full_name: Jao, Casey
last_name: Jao
- first_name: Rowan
full_name: Killip, Rowan
last_name: Killip
- first_name: Monica
full_name: Visan, Monica
id: 056daca0-b8d1-11f0-964f-f91054abf8ca
last_name: Visan
citation:
ama: Jao C, Killip R, Vişan M. Mass-critical inverse Strichartz theorems for 1d
Schrödinger operators. Revista Matemática Iberoamericana. 2019;35(3):703-730.
doi:10.4171/rmi/1067
apa: Jao, C., Killip, R., & Vişan, M. (2019). Mass-critical inverse Strichartz
theorems for 1d Schrödinger operators. Revista Matemática Iberoamericana.
European Mathematical Society Press. https://doi.org/10.4171/rmi/1067
chicago: Jao, Casey, Rowan Killip, and Monica Vişan. “Mass-Critical Inverse Strichartz
Theorems for 1d Schrödinger Operators.” Revista Matemática Iberoamericana.
European Mathematical Society Press, 2019. https://doi.org/10.4171/rmi/1067.
ieee: C. Jao, R. Killip, and M. Vişan, “Mass-critical inverse Strichartz theorems
for 1d Schrödinger operators,” Revista Matemática Iberoamericana, vol.
35, no. 3. European Mathematical Society Press, pp. 703–730, 2019.
ista: Jao C, Killip R, Vişan M. 2019. Mass-critical inverse Strichartz theorems
for 1d Schrödinger operators. Revista Matemática Iberoamericana. 35(3), 703–730.
mla: Jao, Casey, et al. “Mass-Critical Inverse Strichartz Theorems for 1d Schrödinger
Operators.” Revista Matemática Iberoamericana, vol. 35, no. 3, European
Mathematical Society Press, 2019, pp. 703–30, doi:10.4171/rmi/1067.
short: C. Jao, R. Killip, M. Vişan, Revista Matemática Iberoamericana 35 (2019)
703–730.
das_tickbox: '1'
date_created: 2026-06-19T08:25:23Z
date_published: 2019-03-01T00:00:00Z
date_updated: 2026-06-30T11:32:27Z
day: '01'
doi: 10.4171/rmi/1067
extern: '1'
external_id:
arxiv:
- '1509.03592'
fulldoi: https://doi.org/10.4171/rmi/1067
intvolume: ' 35'
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.1509.03592
month: '03'
oa: 1
oa_version: Preprint
page: 703-730
publication: Revista Matemática Iberoamericana
publication_identifier:
eissn:
- 2235-0616
issn:
- 0213-2230
publication_status: published
publisher: European Mathematical Society Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Mass-critical inverse Strichartz theorems for 1d Schrödinger operators
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 35
year: '2019'
...
---
_id: '10879'
abstract:
- lang: eng
text: We study effects of a bounded and compactly supported perturbation on multidimensional
continuum random Schrödinger operators in the region of complete localisation.
Our main emphasis is on Anderson orthogonality for random Schrödinger operators.
Among others, we prove that Anderson orthogonality does occur for Fermi energies
in the region of complete localisation with a non-zero probability. This partially
confirms recent non-rigorous findings [V. Khemani et al., Nature Phys. 11 (2015),
560–565]. The spectral shift function plays an important role in our analysis
of Anderson orthogonality. We identify it with the index of the corresponding
pair of spectral projections and explore the consequences thereof. All our results
rely on the main technical estimate of this paper which guarantees separate exponential
decay of the disorder-averaged Schatten p-norm of χa(f(H)−f(Hτ))χb in a and b.
Here, Hτ is a perturbation of the random Schrödinger operator H, χa is the multiplication
operator corresponding to the indicator function of a unit cube centred about
a∈Rd, and f is in a suitable class of functions of bounded variation with distributional
derivative supported in the region of complete localisation for H.
acknowledgement: M.G. was supported by the DFG under grant GE 2871/1-1.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Adrian M
full_name: Dietlein, Adrian M
id: 317CB464-F248-11E8-B48F-1D18A9856A87
last_name: Dietlein
- first_name: Martin
full_name: Gebert, Martin
last_name: Gebert
- first_name: Peter
full_name: Müller, Peter
last_name: Müller
citation:
ama: Dietlein AM, Gebert M, Müller P. Perturbations of continuum random Schrödinger
operators with applications to Anderson orthogonality and the spectral shift function.
Journal of Spectral Theory. 2019;9(3):921-965. doi:10.4171/jst/267
apa: Dietlein, A. M., Gebert, M., & Müller, P. (2019). Perturbations of continuum
random Schrödinger operators with applications to Anderson orthogonality and the
spectral shift function. Journal of Spectral Theory. EMS Press. https://doi.org/10.4171/jst/267
chicago: Dietlein, Adrian M, Martin Gebert, and Peter Müller. “Perturbations of
Continuum Random Schrödinger Operators with Applications to Anderson Orthogonality
and the Spectral Shift Function.” Journal of Spectral Theory. EMS Press,
2019. https://doi.org/10.4171/jst/267.
ieee: A. M. Dietlein, M. Gebert, and P. Müller, “Perturbations of continuum random
Schrödinger operators with applications to Anderson orthogonality and the spectral
shift function,” Journal of Spectral Theory, vol. 9, no. 3. EMS Press,
pp. 921–965, 2019.
ista: Dietlein AM, Gebert M, Müller P. 2019. Perturbations of continuum random Schrödinger
operators with applications to Anderson orthogonality and the spectral shift function.
Journal of Spectral Theory. 9(3), 921–965.
mla: Dietlein, Adrian M., et al. “Perturbations of Continuum Random Schrödinger
Operators with Applications to Anderson Orthogonality and the Spectral Shift Function.”
Journal of Spectral Theory, vol. 9, no. 3, EMS Press, 2019, pp. 921–65,
doi:10.4171/jst/267.
short: A.M. Dietlein, M. Gebert, P. Müller, Journal of Spectral Theory 9 (2019)
921–965.
das_tickbox: '1'
date_created: 2022-03-18T12:36:42Z
date_published: 2019-03-01T00:00:00Z
date_updated: 2026-07-06T11:54:18Z
day: '01'
department:
- _id: LaEr
doi: 10.4171/jst/267
external_id:
arxiv:
- '1701.02956'
isi:
- '000484709400006'
fulldoi: https://doi.org/10.4171/jst/267
intvolume: ' 9'
isi: 1
issue: '3'
keyword:
- Random Schrödinger operators
- spectral shift function
- Anderson orthogonality
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1701.02956
month: '03'
oa: 1
oa_version: Preprint
page: 921-965
publication: Journal of Spectral Theory
publication_identifier:
issn:
- 1664-039X
publication_status: published
publisher: EMS Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Perturbations of continuum random Schrödinger operators with applications to
Anderson orthogonality and the spectral shift function
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 9
year: '2019'
...
---
_id: '439'
abstract:
- lang: eng
text: "We count points over a finite field on wild character varieties,of Riemann
surfaces for singularities with regular semisimple leading term. The new feature
in our counting formulas is the appearance of characters of Yokonuma–Hecke algebras.
Our result leads to the conjecture that the mixed Hodge polynomials of these character
varieties agree with previously conjectured perverse Hodge polynomials of certain
twisted parabolic Higgs moduli spaces, indicating the\r\npossibility of a P =
W conjecture for a suitable wild Hitchin system."
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Tamas
full_name: Hausel, Tamas
id: 4A0666D8-F248-11E8-B48F-1D18A9856A87
last_name: Hausel
orcid: 0000-0002-9582-2634
- first_name: Martin
full_name: Mereb, Martin
id: 43D735EE-F248-11E8-B48F-1D18A9856A87
last_name: Mereb
- first_name: Michael
full_name: Wong, Michael
last_name: Wong
citation:
ama: Hausel T, Mereb M, Wong M. Arithmetic and representation theory of wild character
varieties. Journal of the European Mathematical Society. 2019;21(10):2995-3052.
doi:10.4171/JEMS/896
apa: Hausel, T., Mereb, M., & Wong, M. (2019). Arithmetic and representation
theory of wild character varieties. Journal of the European Mathematical Society.
EMS Press. https://doi.org/10.4171/JEMS/896
chicago: Hausel, Tamás, Martin Mereb, and Michael Wong. “Arithmetic and Representation
Theory of Wild Character Varieties.” Journal of the European Mathematical Society.
EMS Press, 2019. https://doi.org/10.4171/JEMS/896.
ieee: T. Hausel, M. Mereb, and M. Wong, “Arithmetic and representation theory of
wild character varieties,” Journal of the European Mathematical Society,
vol. 21, no. 10. EMS Press, pp. 2995–3052, 2019.
ista: Hausel T, Mereb M, Wong M. 2019. Arithmetic and representation theory of wild
character varieties. Journal of the European Mathematical Society. 21(10), 2995–3052.
mla: Hausel, Tamás, et al. “Arithmetic and Representation Theory of Wild Character
Varieties.” Journal of the European Mathematical Society, vol. 21, no.
10, EMS Press, 2019, pp. 2995–3052, doi:10.4171/JEMS/896.
short: T. Hausel, M. Mereb, M. Wong, Journal of the European Mathematical Society
21 (2019) 2995–3052.
das_tickbox: '1'
date_created: 2018-12-11T11:46:29Z
date_published: 2019-10-01T00:00:00Z
date_updated: 2026-07-06T11:54:39Z
day: '01'
department:
- _id: TaHa
doi: 10.4171/JEMS/896
ec_funded: 1
external_id:
arxiv:
- '1604.03382'
isi:
- '000480413600002'
fulldoi: https://doi.org/10.4171/JEMS/896
intvolume: ' 21'
isi: 1
issue: '10'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1604.03382
month: '10'
oa: 1
oa_version: Preprint
page: 2995-3052
project:
- _id: 25E549F4-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '320593'
name: Arithmetic and physics of Higgs moduli spaces
publication: Journal of the European Mathematical Society
publication_identifier:
eissn:
- 1435-9855
publication_status: published
publisher: EMS Press
publist_id: '7384'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Arithmetic and representation theory of wild character varieties
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 21
year: '2019'
...
---
_id: '9726'
abstract:
- lang: eng
text: A detailed description of the two stochastic models, table of parameters,
supplementary data for Figures 4 and 5, parameter dependence of the results, and
an analysis on motors with different force–velocity functions (PDF)
article_processing_charge: No
author:
- first_name: Mehmet C
full_name: Ucar, Mehmet C
id: 50B2A802-6007-11E9-A42B-EB23E6697425
last_name: Ucar
orcid: 0000-0003-0506-4217
- first_name: Reinhard
full_name: Lipowsky, Reinhard
last_name: Lipowsky
citation:
ama: Ucar MC, Lipowsky R. Supplementary information - Collective force generation
by molecular motors is determined by strain-induced unbinding. 2019. doi:10.1021/acs.nanolett.9b04445.s001
apa: Ucar, M. C., & Lipowsky, R. (2019). Supplementary information - Collective
force generation by molecular motors is determined by strain-induced unbinding.
American Chemical Society. https://doi.org/10.1021/acs.nanolett.9b04445.s001
chicago: Ucar, Mehmet C, and Reinhard Lipowsky. “Supplementary Information - Collective
Force Generation by Molecular Motors Is Determined by Strain-Induced Unbinding.”
American Chemical Society, 2019. https://doi.org/10.1021/acs.nanolett.9b04445.s001.
ieee: M. C. Ucar and R. Lipowsky, “Supplementary information - Collective force
generation by molecular motors is determined by strain-induced unbinding.” American
Chemical Society, 2019.
ista: Ucar MC, Lipowsky R. 2019. Supplementary information - Collective force generation
by molecular motors is determined by strain-induced unbinding, American Chemical
Society, 10.1021/acs.nanolett.9b04445.s001.
mla: Ucar, Mehmet C., and Reinhard Lipowsky. Supplementary Information - Collective
Force Generation by Molecular Motors Is Determined by Strain-Induced Unbinding.
American Chemical Society, 2019, doi:10.1021/acs.nanolett.9b04445.s001.
short: M.C. Ucar, R. Lipowsky, (2019).
date_created: 2021-07-27T09:51:46Z
date_published: 2019-12-19T00:00:00Z
date_updated: 2026-07-06T12:13:40Z
day: '19'
department:
- _id: EdHa
doi: 10.1021/acs.nanolett.9b04445.s001
fulldoi: https://doi.org/10.1021/acs.nanolett.9b04445.s001
month: '12'
oa_version: Published Version
publisher: American Chemical Society
related_material:
record:
- id: '7166'
relation: used_in_publication
status: public
status: public
title: Supplementary information - Collective force generation by molecular motors
is determined by strain-induced unbinding
type: research_data_reference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2019'
...
---
_id: '6986'
abstract:
- lang: eng
text: 'Li-Nadler proposed a conjecture about traces of Hecke categories, which implies
the semistable part of the Betti geometric Langlands conjecture of Ben-Zvi-Nadler
in genus 1. We prove a Weyl group analogue of this conjecture. Our theorem holds
in the natural generality of reflection groups in Euclidean or hyperbolic space.
As a corollary, we give an expression of the centralizer of a finite order element
in a reflection group using homotopy theory. '
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Penghui
full_name: Li, Penghui
id: 42A24CCC-F248-11E8-B48F-1D18A9856A87
last_name: Li
citation:
ama: Li P. A colimit of traces of reflection groups. Proceedings of the American
Mathematical Society. 2019;147(11):4597-4604. doi:10.1090/proc/14586
apa: Li, P. (2019). A colimit of traces of reflection groups. Proceedings of
the American Mathematical Society. American Mathematical Society. https://doi.org/10.1090/proc/14586
chicago: Li, Penghui. “A Colimit of Traces of Reflection Groups.” Proceedings
of the American Mathematical Society. American Mathematical Society, 2019.
https://doi.org/10.1090/proc/14586.
ieee: P. Li, “A colimit of traces of reflection groups,” Proceedings of the American
Mathematical Society, vol. 147, no. 11. American Mathematical Society, pp.
4597–4604, 2019.
ista: Li P. 2019. A colimit of traces of reflection groups. Proceedings of the American
Mathematical Society. 147(11), 4597–4604.
mla: Li, Penghui. “A Colimit of Traces of Reflection Groups.” Proceedings of
the American Mathematical Society, vol. 147, no. 11, American Mathematical
Society, 2019, pp. 4597–604, doi:10.1090/proc/14586.
short: P. Li, Proceedings of the American Mathematical Society 147 (2019) 4597–4604.
das_tickbox: '1'
date_created: 2019-11-04T16:10:50Z
date_published: 2019-11-01T00:00:00Z
date_updated: 2026-07-06T12:24:07Z
day: '01'
department:
- _id: TaHa
doi: 10.1090/proc/14586
ec_funded: 1
external_id:
arxiv:
- '1810.07039'
isi:
- '000488621700004'
fulldoi: https://doi.org/10.1090/proc/14586
intvolume: ' 147'
isi: 1
issue: '11'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1810.07039
month: '11'
oa: 1
oa_version: Preprint
page: 4597-4604
project:
- _id: 25E549F4-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '320593'
name: Arithmetic and physics of Higgs moduli spaces
publication: Proceedings of the American Mathematical Society
publication_identifier:
eissn:
- 1088-6826
issn:
- 0002-9939
publication_status: published
publisher: American Mathematical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: A colimit of traces of reflection groups
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 147
year: '2019'
...
---
_id: '6050'
abstract:
- lang: eng
text: 'We answer a question of David Hilbert: given two circles it is not possible
in general to construct their centers using only a straightedge. On the other
hand, we give infinitely many families of pairs of circles for which such construction
is possible. '
article_processing_charge: No
arxiv: 1
author:
- first_name: Arseniy
full_name: Akopyan, Arseniy
id: 430D2C90-F248-11E8-B48F-1D18A9856A87
last_name: Akopyan
orcid: 0000-0002-2548-617X
- first_name: Roman
full_name: Fedorov, Roman
last_name: Fedorov
citation:
ama: Akopyan A, Fedorov R. Two circles and only a straightedge. Proceedings of
the American Mathematical Society. 2019;147:91-102. doi:10.1090/proc/14240
apa: Akopyan, A., & Fedorov, R. (2019). Two circles and only a straightedge.
Proceedings of the American Mathematical Society. American Mathematical
Society. https://doi.org/10.1090/proc/14240
chicago: Akopyan, Arseniy, and Roman Fedorov. “Two Circles and Only a Straightedge.”
Proceedings of the American Mathematical Society. American Mathematical
Society, 2019. https://doi.org/10.1090/proc/14240.
ieee: A. Akopyan and R. Fedorov, “Two circles and only a straightedge,” Proceedings
of the American Mathematical Society, vol. 147. American Mathematical Society,
pp. 91–102, 2019.
ista: Akopyan A, Fedorov R. 2019. Two circles and only a straightedge. Proceedings
of the American Mathematical Society. 147, 91–102.
mla: Akopyan, Arseniy, and Roman Fedorov. “Two Circles and Only a Straightedge.”
Proceedings of the American Mathematical Society, vol. 147, American Mathematical
Society, 2019, pp. 91–102, doi:10.1090/proc/14240.
short: A. Akopyan, R. Fedorov, Proceedings of the American Mathematical Society
147 (2019) 91–102.
das_tickbox: '1'
date_created: 2019-02-24T22:59:19Z
date_published: 2019-01-01T00:00:00Z
date_updated: 2026-07-06T12:23:38Z
day: '01'
department:
- _id: HeEd
doi: 10.1090/proc/14240
external_id:
arxiv:
- '1709.02562'
isi:
- '000450363900008'
fulldoi: https://doi.org/10.1090/proc/14240
intvolume: ' 147'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1709.02562
month: '01'
oa: 1
oa_version: Preprint
page: 91-102
publication: Proceedings of the American Mathematical Society
publication_status: published
publisher: American Mathematical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: Two circles and only a straightedge
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 147
year: '2019'
...
---
_id: '6029'
abstract:
- lang: eng
text: Protein micropatterning has become an important tool for many biomedical applications
as well as in academic research. Current techniques that allow to reduce the feature
size of patterns below 1 μm are, however, often costly and require sophisticated
equipment. We present here a straightforward and convenient method to generate
highly condensed nanopatterns of proteins without the need for clean room facilities
or expensive equipment. Our approach is based on nanocontact printing and allows
for the fabrication of protein patterns with feature sizes of 80 nm and periodicities
down to 140 nm. This was made possible by the use of the material X-poly(dimethylsiloxane)
(X-PDMS) in a two-layer stamp layout for protein printing. In a proof of principle,
different proteins at various scales were printed and the pattern quality was
evaluated by atomic force microscopy (AFM) and super-resolution fluorescence microscopy.
article_number: '655'
article_processing_charge: No
author:
- first_name: Marco
full_name: Lindner, Marco
last_name: Lindner
- first_name: Aliz
full_name: Tresztenyak, Aliz
last_name: Tresztenyak
- first_name: Gergö
full_name: Fülöp, Gergö
last_name: Fülöp
- first_name: Wiebke
full_name: Jahr, Wiebke
id: 425C1CE8-F248-11E8-B48F-1D18A9856A87
last_name: Jahr
orcid: 0000-0003-0201-2315
- first_name: Adrian
full_name: Prinz, Adrian
last_name: Prinz
- first_name: Iris
full_name: Prinz, Iris
last_name: Prinz
- first_name: Johann G
full_name: Danzl, Johann G
id: 42EFD3B6-F248-11E8-B48F-1D18A9856A87
last_name: Danzl
orcid: 0000-0001-8559-3973
- first_name: Gerhard J.
full_name: Schütz, Gerhard J.
last_name: Schütz
- first_name: Eva
full_name: Sevcsik, Eva
last_name: Sevcsik
citation:
ama: Lindner M, Tresztenyak A, Fülöp G, et al. A fast and simple contact printing
approach to generate 2D protein nanopatterns. Frontiers in Chemistry. 2019;6.
doi:10.3389/fchem.2018.00655
apa: Lindner, M., Tresztenyak, A., Fülöp, G., Jahr, W., Prinz, A., Prinz, I., …
Sevcsik, E. (2019). A fast and simple contact printing approach to generate 2D
protein nanopatterns. Frontiers in Chemistry. Frontiers Media. https://doi.org/10.3389/fchem.2018.00655
chicago: Lindner, Marco, Aliz Tresztenyak, Gergö Fülöp, Wiebke Jahr, Adrian Prinz,
Iris Prinz, Johann G Danzl, Gerhard J. Schütz, and Eva Sevcsik. “A Fast and Simple
Contact Printing Approach to Generate 2D Protein Nanopatterns.” Frontiers in
Chemistry. Frontiers Media, 2019. https://doi.org/10.3389/fchem.2018.00655.
ieee: M. Lindner et al., “A fast and simple contact printing approach to
generate 2D protein nanopatterns,” Frontiers in Chemistry, vol. 6. Frontiers
Media, 2019.
ista: Lindner M, Tresztenyak A, Fülöp G, Jahr W, Prinz A, Prinz I, Danzl JG, Schütz
GJ, Sevcsik E. 2019. A fast and simple contact printing approach to generate 2D
protein nanopatterns. Frontiers in Chemistry. 6, 655.
mla: Lindner, Marco, et al. “A Fast and Simple Contact Printing Approach to Generate
2D Protein Nanopatterns.” Frontiers in Chemistry, vol. 6, 655, Frontiers
Media, 2019, doi:10.3389/fchem.2018.00655.
short: M. Lindner, A. Tresztenyak, G. Fülöp, W. Jahr, A. Prinz, I. Prinz, J.G. Danzl,
G.J. Schütz, E. Sevcsik, Frontiers in Chemistry 6 (2019).
das_tickbox: '1'
date_created: 2019-02-17T22:59:24Z
date_published: 2019-01-24T00:00:00Z
date_updated: 2026-07-06T13:03:56Z
day: '24'
ddc:
- '540'
department:
- _id: JoDa
doi: 10.3389/fchem.2018.00655
external_id:
isi:
- '000456718000001'
file:
- access_level: open_access
checksum: 7841301d7c53b56ef873791b4b6f7b24
content_type: application/pdf
creator: dernst
date_created: 2019-02-18T15:10:34Z
date_updated: 2020-07-14T12:47:17Z
file_id: '6039'
file_name: 2019_frontiers_Lindner.pdf
file_size: 1766820
relation: main_file
file_date_updated: 2020-07-14T12:47:17Z
fulldoi: https://doi.org/10.3389/fchem.2018.00655
has_accepted_license: '1'
intvolume: ' 6'
isi: 1
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
publication: Frontiers in Chemistry
publication_identifier:
eissn:
- 2296-2646
publication_status: published
publisher: Frontiers Media
quality_controlled: '1'
scopus_import: '1'
status: public
title: A fast and simple contact printing approach to generate 2D protein nanopatterns
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: 6
year: '2019'
...
---
_id: '5886'
abstract:
- lang: eng
text: Problems involving quantum impurities, in which one or a few particles are
interacting with a macroscopic environment, represent a pervasive paradigm, spanning
across atomic, molecular, and condensed-matter physics. In this paper we introduce
new variational approaches to quantum impurities and apply them to the Fröhlich
polaron–a quasiparticle formed out of an electron (or other point-like impurity)
in a polar medium, and to the angulon–a quasiparticle formed out of a rotating
molecule in a bosonic bath. We benchmark these approaches against established
theories, evaluating their accuracy as a function of the impurity-bath coupling.
article_processing_charge: No
author:
- first_name: Xiang
full_name: Li, Xiang
id: 4B7E523C-F248-11E8-B48F-1D18A9856A87
last_name: Li
- first_name: Giacomo
full_name: Bighin, Giacomo
id: 4CA96FD4-F248-11E8-B48F-1D18A9856A87
last_name: Bighin
orcid: 0000-0001-8823-9777
- first_name: Enderalp
full_name: Yakaboylu, Enderalp
id: 38CB71F6-F248-11E8-B48F-1D18A9856A87
last_name: Yakaboylu
orcid: 0000-0001-5973-0874
- first_name: Mikhail
full_name: Lemeshko, Mikhail
id: 37CB05FA-F248-11E8-B48F-1D18A9856A87
last_name: Lemeshko
orcid: 0000-0002-6990-7802
citation:
ama: 'Li X, Bighin G, Yakaboylu E, Lemeshko M. Variational approaches to quantum
impurities: from the Fröhlich polaron to the angulon. Molecular Physics.
2019. doi:10.1080/00268976.2019.1567852'
apa: 'Li, X., Bighin, G., Yakaboylu, E., & Lemeshko, M. (2019). Variational
approaches to quantum impurities: from the Fröhlich polaron to the angulon. Molecular
Physics. Taylor & Francis. https://doi.org/10.1080/00268976.2019.1567852'
chicago: 'Li, Xiang, Giacomo Bighin, Enderalp Yakaboylu, and Mikhail Lemeshko. “Variational
Approaches to Quantum Impurities: From the Fröhlich Polaron to the Angulon.” Molecular
Physics. Taylor & Francis, 2019. https://doi.org/10.1080/00268976.2019.1567852.'
ieee: 'X. Li, G. Bighin, E. Yakaboylu, and M. Lemeshko, “Variational approaches
to quantum impurities: from the Fröhlich polaron to the angulon,” Molecular
Physics. Taylor & Francis, 2019.'
ista: 'Li X, Bighin G, Yakaboylu E, Lemeshko M. 2019. Variational approaches to
quantum impurities: from the Fröhlich polaron to the angulon. Molecular Physics.'
mla: 'Li, Xiang, et al. “Variational Approaches to Quantum Impurities: From the
Fröhlich Polaron to the Angulon.” Molecular Physics, Taylor & Francis,
2019, doi:10.1080/00268976.2019.1567852.'
short: X. Li, G. Bighin, E. Yakaboylu, M. Lemeshko, Molecular Physics (2019).
das_tickbox: '1'
date_created: 2019-01-27T22:59:10Z
date_published: 2019-01-18T00:00:00Z
date_updated: 2026-07-07T05:31:10Z
day: '18'
ddc:
- '530'
department:
- _id: MiLe
doi: 10.1080/00268976.2019.1567852
ec_funded: 1
external_id:
isi:
- '000474641400008'
file:
- access_level: open_access
checksum: 178964744b636a6f036372f4f090a657
content_type: application/pdf
creator: dernst
date_created: 2019-01-29T08:32:57Z
date_updated: 2020-07-14T12:47:13Z
file_id: '5896'
file_name: 2019_MolecularPhysics_Li.pdf
file_size: 1309966
relation: main_file
file_date_updated: 2020-07-14T12:47:13Z
fulldoi: https://doi.org/10.1080/00268976.2019.1567852
has_accepted_license: '1'
isi: 1
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
project:
- _id: 26031614-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P29902
name: Quantum rotations in the presence of a many-body environment
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication: Molecular Physics
publication_identifier:
issn:
- 0026-8976
publication_status: published
publisher: Taylor & Francis
quality_controlled: '1'
related_material:
record:
- id: '8958'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: 'Variational approaches to quantum impurities: from the Fröhlich polaron to
the angulon'
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
year: '2019'
...
---
_id: '5680'
abstract:
- lang: eng
text: Pollinators display a remarkable diversity of foraging strategies with flowering
plants, from primarily mutualistic interactions to cheating through nectar robbery.
Despite numerous studies on the effect of nectar robbing on components of plant
fitness, its contribution to reproductive isolation is unclear. We experimentally
tested the impact of different pollinator strategies in a natural hybrid zone
between two subspecies of Antirrhinum majus with alternate flower colour guides.
On either side of a steep cline in flower colour between Antirrhinum majus pseudomajus
(magenta) and A. m. striatum (yellow), we quantified the behaviour of all floral
visitors at different time points during the flowering season. Using long-run
camera surveys, we quantify the impact of nectar robbing on the number of flowers
visited per inflorescence and the flower probing time. We further experimentally
tested the effect of nectar robbing on female reproductive success by manipulating
the intensity of robbing. While robbing increased over time the number of legitimate
visitors tended to decrease concomitantly. We found that the number of flowers
pollinated on a focal inflorescence decreased with the number of prior robbing
events. However, in the manipulative experiment, fruit set and fruit volume did
not vary significantly between low robbing and control treatments. Our findings
challenge the idea that robbers have a negative impact on plant fitness through
female function. This study also adds to our understanding of the components of
pollinator-mediated reproductive isolation and the maintenance of Antirrhinum
hybrid zones.
article_processing_charge: No
author:
- first_name: Christophe
full_name: Andalo, Christophe
last_name: Andalo
- first_name: Monique
full_name: Burrus, Monique
last_name: Burrus
- first_name: Sandrine
full_name: Paute, Sandrine
last_name: Paute
- first_name: Christine
full_name: Lauzeral, Christine
last_name: Lauzeral
- first_name: David
full_name: Field, David
id: 419049E2-F248-11E8-B48F-1D18A9856A87
last_name: Field
orcid: 0000-0002-4014-8478
citation:
ama: Andalo C, Burrus M, Paute S, Lauzeral C, Field D. Prevalence of legitimate
pollinators and nectar robbers and the consequences for fruit set in an Antirrhinum
majus hybrid zone. Botany Letters. 2019;166(1):80-92. doi:10.1080/23818107.2018.1545142
apa: Andalo, C., Burrus, M., Paute, S., Lauzeral, C., & Field, D. (2019). Prevalence
of legitimate pollinators and nectar robbers and the consequences for fruit set
in an Antirrhinum majus hybrid zone. Botany Letters. Taylor & Francis.
https://doi.org/10.1080/23818107.2018.1545142
chicago: Andalo, Christophe, Monique Burrus, Sandrine Paute, Christine Lauzeral,
and David Field. “Prevalence of Legitimate Pollinators and Nectar Robbers and
the Consequences for Fruit Set in an Antirrhinum Majus Hybrid Zone.” Botany
Letters. Taylor & Francis, 2019. https://doi.org/10.1080/23818107.2018.1545142.
ieee: C. Andalo, M. Burrus, S. Paute, C. Lauzeral, and D. Field, “Prevalence of
legitimate pollinators and nectar robbers and the consequences for fruit set in
an Antirrhinum majus hybrid zone,” Botany Letters, vol. 166, no. 1. Taylor
& Francis, pp. 80–92, 2019.
ista: Andalo C, Burrus M, Paute S, Lauzeral C, Field D. 2019. Prevalence of legitimate
pollinators and nectar robbers and the consequences for fruit set in an Antirrhinum
majus hybrid zone. Botany Letters. 166(1), 80–92.
mla: Andalo, Christophe, et al. “Prevalence of Legitimate Pollinators and Nectar
Robbers and the Consequences for Fruit Set in an Antirrhinum Majus Hybrid Zone.”
Botany Letters, vol. 166, no. 1, Taylor & Francis, 2019, pp. 80–92,
doi:10.1080/23818107.2018.1545142.
short: C. Andalo, M. Burrus, S. Paute, C. Lauzeral, D. Field, Botany Letters 166
(2019) 80–92.
das_tickbox: '1'
date_created: 2018-12-16T22:59:20Z
date_published: 2019-01-01T00:00:00Z
date_updated: 2026-07-07T05:33:54Z
day: '01'
department:
- _id: NiBa
doi: 10.1080/23818107.2018.1545142
external_id:
isi:
- '000463802800009'
fulldoi: https://doi.org/10.1080/23818107.2018.1545142
intvolume: ' 166'
isi: 1
issue: '1'
language:
- iso: eng
month: '01'
oa_version: None
page: 80-92
publication: Botany Letters
publication_identifier:
eissn:
- 2381-8115
issn:
- 2381-8107
publication_status: published
publisher: Taylor & Francis
quality_controlled: '1'
scopus_import: '1'
status: public
title: Prevalence of legitimate pollinators and nectar robbers and the consequences
for fruit set in an Antirrhinum majus hybrid zone
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 166
year: '2019'
...
---
_id: '6657'
abstract:
- lang: eng
text: 'In this article a model is described how Open Access definitions can be formed
on the basis of objective criteria. The common Open Access definitions such as
"gold" and "green" are not exactly defined. This becomes a problem as soon as
one begins to measure Open Access, for example if the development of the Open
Access share should be monitored. This was discussed in the working group on Open
Access Monitoring of the AT2OA project and the present model was developed,
which is based on 5 critics with 4 characteristics: location, licence, version,
embargo and conditions of the Open Access publication are taken into account.
In the meantime, the model has also been tested in practice using R scripts, and
the initial results are quite promising.'
article_processing_charge: No
article_type: original
author:
- first_name: Patrick
full_name: Danowski, Patrick
id: 2EBD1598-F248-11E8-B48F-1D18A9856A87
last_name: Danowski
orcid: 0000-0002-6026-4409
citation:
ama: Danowski P. An Austrian proposal for the classification of Open Access Tuples
(COAT) - distinguish different open access types beyond colors. Mitteilungen
der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare. 2019;72(1):59-65.
doi:10.31263/voebm.v72i1.2276
apa: Danowski, P. (2019). An Austrian proposal for the classification of Open Access
Tuples (COAT) - distinguish different open access types beyond colors. Mitteilungen
Der Vereinigung Österreichischer Bibliothekarinnen Und Bibliothekare. Vereinigung
Österreichischer Bibliothekarinnen und Bibliothekare. https://doi.org/10.31263/voebm.v72i1.2276
chicago: Danowski, Patrick. “An Austrian Proposal for the Classification of Open
Access Tuples (COAT) - Distinguish Different Open Access Types beyond Colors.”
Mitteilungen Der Vereinigung Österreichischer Bibliothekarinnen Und Bibliothekare.
Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare, 2019. https://doi.org/10.31263/voebm.v72i1.2276.
ieee: P. Danowski, “An Austrian proposal for the classification of Open Access Tuples
(COAT) - distinguish different open access types beyond colors,” Mitteilungen
der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare, vol.
72, no. 1. Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare, pp.
59–65, 2019.
ista: Danowski P. 2019. An Austrian proposal for the classification of Open Access
Tuples (COAT) - distinguish different open access types beyond colors. Mitteilungen
der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare. 72(1), 59–65.
mla: Danowski, Patrick. “An Austrian Proposal for the Classification of Open Access
Tuples (COAT) - Distinguish Different Open Access Types beyond Colors.” Mitteilungen
Der Vereinigung Österreichischer Bibliothekarinnen Und Bibliothekare, vol.
72, no. 1, Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare, 2019,
pp. 59–65, doi:10.31263/voebm.v72i1.2276.
short: P. Danowski, Mitteilungen Der Vereinigung Österreichischer Bibliothekarinnen
Und Bibliothekare 72 (2019) 59–65.
corr_author: '1'
date_created: 2019-07-21T21:59:15Z
date_published: 2019-05-17T00:00:00Z
date_updated: 2026-07-07T06:28:30Z
day: '17'
ddc:
- '020'
department:
- _id: E-Lib
doi: 10.31263/voebm.v72i1.2276
file:
- access_level: open_access
checksum: c0d2695d6d0d34e62ba06fb3f0ebaaed
content_type: application/pdf
creator: apreinsp
date_created: 2019-07-22T08:45:03Z
date_updated: 2020-07-14T12:47:35Z
file_id: '6661'
file_name: 2019_MitteilungenDerVOEB_Danowski.pdf
file_size: 468558
relation: main_file
file_date_updated: 2020-07-14T12:47:35Z
fulldoi: https://doi.org/10.31263/voebm.v72i1.2276
has_accepted_license: '1'
intvolume: ' 72'
issue: '1'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
page: 59-65
publication: Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare
publication_identifier:
eissn:
- 1022-2588
publication_status: published
publisher: Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare
quality_controlled: '1'
related_material:
record:
- id: '5686'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: An Austrian proposal for the classification of Open Access Tuples (COAT) -
distinguish different open access types beyond colors
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: 72
year: '2019'
...
---
_id: '6822'
abstract:
- lang: eng
text: "In two-player games on graphs, the players move a token through a graph to
produce an infinite path, which determines the qualitative winner or quantitative
payoff of the game. In bidding games, in each turn, we hold an auction between
the two players to determine which player moves the token. Bidding games have
largely been studied with concrete bidding mechanisms that are variants of a first-price
auction: in each turn both players simultaneously submit bids, the higher\r\nbidder
moves the token, and pays his bid to the lower bidder in Richman bidding, to the
bank in poorman bidding, and in taxman bidding, the bid is split between the other
player and the bank according to a predefined constant factor. Bidding games are
deterministic games. They have an intriguing connection with a fragment of stochastic
games called \r\n randomturn games. We study, for the first time, a combination
of bidding games with probabilistic behavior; namely, we study bidding games that
are played on Markov decision processes, where the players bid for the right to
choose the next action, which determines the probability distribution according
to which the next vertex is chosen. We study parity and meanpayoff bidding games
on MDPs and extend results from the deterministic bidding setting to the probabilistic
one."
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Guy
full_name: Avni, Guy
id: 463C8BC2-F248-11E8-B48F-1D18A9856A87
last_name: Avni
orcid: 0000-0001-5588-8287
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Rasmus
full_name: Ibsen-Jensen, Rasmus
id: 3B699956-F248-11E8-B48F-1D18A9856A87
last_name: Ibsen-Jensen
orcid: 0000-0003-4783-0389
- first_name: Petr
full_name: Novotny, Petr
last_name: Novotny
citation:
ama: 'Avni G, Henzinger TA, Ibsen-Jensen R, Novotny P. Bidding games on Markov decision
processes. In: Proceedings of the 13th International Conference of Reachability
Problems. Vol 11674. Springer; 2019:1-12. doi:10.1007/978-3-030-30806-3_1'
apa: 'Avni, G., Henzinger, T. A., Ibsen-Jensen, R., & Novotny, P. (2019). Bidding
games on Markov decision processes. In Proceedings of the 13th International
Conference of Reachability Problems (Vol. 11674, pp. 1–12). Brussels, Belgium:
Springer. https://doi.org/10.1007/978-3-030-30806-3_1'
chicago: Avni, Guy, Thomas A Henzinger, Rasmus Ibsen-Jensen, and Petr Novotny. “Bidding
Games on Markov Decision Processes.” In Proceedings of the 13th International
Conference of Reachability Problems, 11674:1–12. Springer, 2019. https://doi.org/10.1007/978-3-030-30806-3_1.
ieee: G. Avni, T. A. Henzinger, R. Ibsen-Jensen, and P. Novotny, “Bidding games
on Markov decision processes,” in Proceedings of the 13th International Conference
of Reachability Problems, Brussels, Belgium, 2019, vol. 11674, pp. 1–12.
ista: 'Avni G, Henzinger TA, Ibsen-Jensen R, Novotny P. 2019. Bidding games on Markov
decision processes. Proceedings of the 13th International Conference of Reachability
Problems. RP: Reachability Problems, LNCS, vol. 11674, 1–12.'
mla: Avni, Guy, et al. “Bidding Games on Markov Decision Processes.” Proceedings
of the 13th International Conference of Reachability Problems, vol. 11674,
Springer, 2019, pp. 1–12, doi:10.1007/978-3-030-30806-3_1.
short: G. Avni, T.A. Henzinger, R. Ibsen-Jensen, P. Novotny, in:, Proceedings of
the 13th International Conference of Reachability Problems, Springer, 2019, pp.
1–12.
conference:
end_date: 2019-09-13
location: Brussels, Belgium
name: 'RP: Reachability Problems'
start_date: 2019-09-11
das_tickbox: '1'
date_created: 2019-08-19T07:58:10Z
date_published: 2019-09-06T00:00:00Z
date_updated: 2026-07-07T13:29:21Z
day: '06'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.1007/978-3-030-30806-3_1
external_id:
isi:
- '001333747500001'
file:
- access_level: open_access
checksum: 45ebbc709af2b247d28c7c293c01504b
content_type: application/pdf
creator: gavni
date_created: 2019-08-19T07:56:40Z
date_updated: 2020-07-14T12:47:41Z
file_id: '6823'
file_name: prob.pdf
file_size: 436635
relation: main_file
file_date_updated: 2020-07-14T12:47:41Z
fulldoi: https://doi.org/10.1007/978-3-030-30806-3_1
has_accepted_license: '1'
intvolume: ' 11674'
isi: 1
language:
- iso: eng
month: '09'
oa: 1
oa_version: Submitted Version
page: 1-12
project:
- _id: 264B3912-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: M02369
name: Formal Methods meets Algorithmic Game Theory
- _id: 25F2ACDE-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11402-N23
name: Rigorous Systems Engineering
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: Formal methods for the design and analysis of complex systems
publication: Proceedings of the 13th International Conference of Reachability Problems
publication_identifier:
isbn:
- 978-303030805-6
issn:
- 0302-9743
publication_status: published
publisher: Springer
quality_controlled: '1'
scopus_import: '1'
status: public
title: Bidding games on Markov decision processes
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 11674
year: '2019'
...
---
_id: '6528'
abstract:
- lang: eng
text: We construct a verifiable delay function (VDF) by showing how the Rivest-Shamir-Wagner
time-lock puzzle can be made publicly verifiable. Concretely, we give a statistically
sound public-coin protocol to prove that a tuple (N,x,T,y) satisfies y=x2T (mod
N) where the prover doesn’t know the factorization of N and its running time is
dominated by solving the puzzle, that is, compute x2T, which is conjectured to
require T sequential squarings. To get a VDF we make this protocol non-interactive
using the Fiat-Shamir heuristic.The motivation for this work comes from the Chia
blockchain design, which uses a VDF as akey ingredient. For typical parameters
(T≤2 40, N= 2048), our proofs are of size around 10K B, verification cost around
three RSA exponentiations and computing the proof is 8000 times faster than solving
the puzzle even without any parallelism.
alternative_title:
- LIPIcs
article_number: '60'
article_processing_charge: No
author:
- first_name: Krzysztof Z
full_name: Pietrzak, Krzysztof Z
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
citation:
ama: 'Pietrzak KZ. Simple verifiable delay functions. In: 10th Innovations in
Theoretical Computer Science Conference. Vol 124. Schloss Dagstuhl - Leibniz-Zentrum
für Informatik; 2019. doi:10.4230/LIPICS.ITCS.2019.60'
apa: 'Pietrzak, K. Z. (2019). Simple verifiable delay functions. In 10th Innovations
in Theoretical Computer Science Conference (Vol. 124). San Diego, CA, United
States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.ITCS.2019.60'
chicago: Pietrzak, Krzysztof Z. “Simple Verifiable Delay Functions.” In 10th
Innovations in Theoretical Computer Science Conference, Vol. 124. Schloss
Dagstuhl - Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPICS.ITCS.2019.60.
ieee: K. Z. Pietrzak, “Simple verifiable delay functions,” in 10th Innovations
in Theoretical Computer Science Conference, San Diego, CA, United States,
2019, vol. 124.
ista: 'Pietrzak KZ. 2019. Simple verifiable delay functions. 10th Innovations in
Theoretical Computer Science Conference. ITCS: Innovations in Theoretical Computer
Science, LIPIcs, vol. 124, 60.'
mla: Pietrzak, Krzysztof Z. “Simple Verifiable Delay Functions.” 10th Innovations
in Theoretical Computer Science Conference, vol. 124, 60, Schloss Dagstuhl
- Leibniz-Zentrum für Informatik, 2019, doi:10.4230/LIPICS.ITCS.2019.60.
short: K.Z. Pietrzak, in:, 10th Innovations in Theoretical Computer Science Conference,
Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.
conference:
end_date: 2019-01-12
location: San Diego, CA, United States
name: 'ITCS: Innovations in Theoretical Computer Science'
start_date: 2019-01-10
cryptoeprintid: 1
das_tickbox: '1'
date_created: 2019-06-06T14:12:36Z
date_published: 2019-01-10T00:00:00Z
date_updated: 2026-07-07T13:31:01Z
day: '10'
ddc:
- '000'
department:
- _id: KrPi
doi: 10.4230/LIPICS.ITCS.2019.60
ec_funded: 1
external_id:
cryptoeprintid:
- 2018/627
file:
- access_level: open_access
checksum: f0ae1bb161431d9db3dea5ace082bfb5
content_type: application/pdf
creator: dernst
date_created: 2019-06-06T14:22:04Z
date_updated: 2020-07-14T12:47:33Z
file_id: '6529'
file_name: 2019_LIPIcs_Pietrzak.pdf
file_size: 558770
relation: main_file
file_date_updated: 2020-07-14T12:47:33Z
fulldoi: https://doi.org/10.4230/LIPICS.ITCS.2019.60
has_accepted_license: '1'
intvolume: ' 124'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
project:
- _id: 258AA5B2-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '682815'
name: Teaching Old Crypto New Tricks
publication: 10th Innovations in Theoretical Computer Science Conference
publication_identifier:
isbn:
- 978-3-95977-095-8
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: '1'
status: public
title: Simple verifiable delay functions
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: 124
year: '2019'
...