---
_id: '7231'
abstract:
- lang: eng
text: Piecewise Barrier Tubes (PBT) is a new technique for flowpipe overapproximation
for nonlinear systems with polynomial dynamics, which leverages a combination
of barrier certificates. PBT has advantages over traditional time-step based methods
in dealing with those nonlinear dynamical systems in which there is a large difference
in speed between trajectories, producing an overapproximation that is time independent.
However, the existing approach for PBT is not efficient due to the application
of interval methods for enclosure-box computation, and it can only deal with continuous
dynamical systems without uncertainty. In this paper, we extend the approach with
the ability to handle both continuous and hybrid dynamical systems with uncertainty
that can reside in parameters and/or noise. We also improve the efficiency of
the method significantly, by avoiding the use of interval-based methods for the
enclosure-box computation without loosing soundness. We have developed a C++ prototype
implementing the proposed approach and we evaluate it on several benchmarks. The
experiments show that our approach is more efficient and precise than other methods
in the literature.
alternative_title:
- LNCS
article_processing_charge: No
arxiv: 1
author:
- first_name: Hui
full_name: Kong, Hui
id: 3BDE25AA-F248-11E8-B48F-1D18A9856A87
last_name: Kong
orcid: 0000-0002-3066-6941
- first_name: Ezio
full_name: Bartocci, Ezio
last_name: Bartocci
- first_name: Yu
full_name: Jiang, Yu
last_name: Jiang
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
citation:
ama: 'Kong H, Bartocci E, Jiang Y, Henzinger TA. Piecewise robust barrier tubes
for nonlinear hybrid systems with uncertainty. In: 17th International Conference
on Formal Modeling and Analysis of Timed Systems. Vol 11750. Springer Nature;
2019:123-141. doi:10.1007/978-3-030-29662-9_8'
apa: 'Kong, H., Bartocci, E., Jiang, Y., & Henzinger, T. A. (2019). Piecewise
robust barrier tubes for nonlinear hybrid systems with uncertainty. In 17th
International Conference on Formal Modeling and Analysis of Timed Systems
(Vol. 11750, pp. 123–141). Amsterdam, The Netherlands: Springer Nature. https://doi.org/10.1007/978-3-030-29662-9_8'
chicago: Kong, Hui, Ezio Bartocci, Yu Jiang, and Thomas A Henzinger. “Piecewise
Robust Barrier Tubes for Nonlinear Hybrid Systems with Uncertainty.” In 17th
International Conference on Formal Modeling and Analysis of Timed Systems,
11750:123–41. Springer Nature, 2019. https://doi.org/10.1007/978-3-030-29662-9_8.
ieee: H. Kong, E. Bartocci, Y. Jiang, and T. A. Henzinger, “Piecewise robust barrier
tubes for nonlinear hybrid systems with uncertainty,” in 17th International
Conference on Formal Modeling and Analysis of Timed Systems, Amsterdam, The
Netherlands, 2019, vol. 11750, pp. 123–141.
ista: 'Kong H, Bartocci E, Jiang Y, Henzinger TA. 2019. Piecewise robust barrier
tubes for nonlinear hybrid systems with uncertainty. 17th International Conference
on Formal Modeling and Analysis of Timed Systems. FORMATS: Formal Modeling and
Analysis of Timed Systems, LNCS, vol. 11750, 123–141.'
mla: Kong, Hui, et al. “Piecewise Robust Barrier Tubes for Nonlinear Hybrid Systems
with Uncertainty.” 17th International Conference on Formal Modeling and Analysis
of Timed Systems, vol. 11750, Springer Nature, 2019, pp. 123–41, doi:10.1007/978-3-030-29662-9_8.
short: H. Kong, E. Bartocci, Y. Jiang, T.A. Henzinger, in:, 17th International Conference
on Formal Modeling and Analysis of Timed Systems, Springer Nature, 2019, pp. 123–141.
conference:
end_date: 2019-08-29
location: Amsterdam, The Netherlands
name: 'FORMATS: Formal Modeling and Analysis of Timed Systems'
start_date: 2019-08-27
date_created: 2020-01-05T23:00:47Z
date_published: 2019-08-13T00:00:00Z
date_updated: 2025-04-15T06:26:06Z
day: '13'
department:
- _id: ToHe
doi: 10.1007/978-3-030-29662-9_8
external_id:
arxiv:
- '1907.11514'
isi:
- '000611677700008'
fulldoi: https://doi.org/10.1007/978-3-030-29662-9_8
intvolume: ' 11750'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1907.11514
month: '08'
oa: 1
oa_version: Preprint
page: 123-141
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: Formal methods for the design and analysis of complex systems
publication: 17th International Conference on Formal Modeling and Analysis of Timed
Systems
publication_identifier:
eissn:
- 1611-3349
isbn:
- 978-3-0302-9661-2
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Piecewise robust barrier tubes for nonlinear hybrid systems with uncertainty
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 11750
year: '2019'
...
---
_id: '7232'
abstract:
- lang: eng
text: 'We present Mixed-time Signal Temporal Logic (STL−MX), a specification formalism
which extends STL by capturing the discrete/ continuous time duality found in
many cyber-physical systems (CPS), as well as mixed-signal electronic designs.
In STL−MX, properties of components with continuous dynamics are expressed in
STL, while specifications of components with discrete dynamics are written in
LTL. To combine the two layers, we evaluate formulas on two traces, discrete-
and continuous-time, and introduce two interface operators that map signals, properties
and their satisfaction signals across the two time domains. We show that STL-mx
has the expressive power of STL supplemented with an implicit T-periodic clock
signal. We develop and implement an algorithm for monitoring STL-mx formulas and
illustrate the approach using a mixed-signal example. '
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Thomas
full_name: Ferrere, Thomas
id: 40960E6E-F248-11E8-B48F-1D18A9856A87
last_name: Ferrere
orcid: 0000-0001-5199-3143
- first_name: Oded
full_name: Maler, Oded
last_name: Maler
- first_name: Dejan
full_name: Nickovic, Dejan
id: 41BCEE5C-F248-11E8-B48F-1D18A9856A87
last_name: Nickovic
citation:
ama: 'Ferrere T, Maler O, Nickovic D. Mixed-time signal temporal logic. In: 17th
International Conference on Formal Modeling and Analysis of Timed Systems.
Vol 11750. Springer Nature; 2019:59-75. doi:10.1007/978-3-030-29662-9_4'
apa: 'Ferrere, T., Maler, O., & Nickovic, D. (2019). Mixed-time signal temporal
logic. In 17th International Conference on Formal Modeling and Analysis of
Timed Systems (Vol. 11750, pp. 59–75). Amsterdam, The Netherlands: Springer
Nature. https://doi.org/10.1007/978-3-030-29662-9_4'
chicago: Ferrere, Thomas, Oded Maler, and Dejan Nickovic. “Mixed-Time Signal Temporal
Logic.” In 17th International Conference on Formal Modeling and Analysis of
Timed Systems, 11750:59–75. Springer Nature, 2019. https://doi.org/10.1007/978-3-030-29662-9_4.
ieee: T. Ferrere, O. Maler, and D. Nickovic, “Mixed-time signal temporal logic,”
in 17th International Conference on Formal Modeling and Analysis of Timed Systems,
Amsterdam, The Netherlands, 2019, vol. 11750, pp. 59–75.
ista: 'Ferrere T, Maler O, Nickovic D. 2019. Mixed-time signal temporal logic. 17th
International Conference on Formal Modeling and Analysis of Timed Systems. FORMATS:
Formal Modeling and Anaysis of Timed Systems, LNCS, vol. 11750, 59–75.'
mla: Ferrere, Thomas, et al. “Mixed-Time Signal Temporal Logic.” 17th International
Conference on Formal Modeling and Analysis of Timed Systems, vol. 11750, Springer
Nature, 2019, pp. 59–75, doi:10.1007/978-3-030-29662-9_4.
short: T. Ferrere, O. Maler, D. Nickovic, in:, 17th International Conference on
Formal Modeling and Analysis of Timed Systems, Springer Nature, 2019, pp. 59–75.
conference:
end_date: 2019-08-29
location: Amsterdam, The Netherlands
name: 'FORMATS: Formal Modeling and Anaysis of Timed Systems'
start_date: 2019-08-27
date_created: 2020-01-05T23:00:48Z
date_published: 2019-08-13T00:00:00Z
date_updated: 2025-04-15T06:26:06Z
day: '13'
department:
- _id: ToHe
doi: 10.1007/978-3-030-29662-9_4
external_id:
isi:
- '000611677700004'
fulldoi: https://doi.org/10.1007/978-3-030-29662-9_4
intvolume: ' 11750'
isi: 1
language:
- iso: eng
month: '08'
oa_version: None
page: 59-75
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_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: 17th International Conference on Formal Modeling and Analysis of Timed
Systems
publication_identifier:
eissn:
- 1611-3349
isbn:
- 978-3-0302-9661-2
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Mixed-time signal temporal logic
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 11750
year: '2019'
...
---
_id: '7411'
abstract:
- lang: eng
text: "Proofs of sequential work (PoSW) are proof systems where a prover, upon receiving
a statement χ and a time parameter T computes a proof ϕ(χ,T) which is efficiently
and publicly verifiable. The proof can be computed in T sequential steps, but
not much less, even by a malicious party having large parallelism. A PoSW thus
serves as a proof that T units of time have passed since χ\r\n\r\nwas received.\r\n\r\nPoSW
were introduced by Mahmoody, Moran and Vadhan [MMV11], a simple and practical
construction was only recently proposed by Cohen and Pietrzak [CP18].\r\n\r\nIn
this work we construct a new simple PoSW in the random permutation model which
is almost as simple and efficient as [CP18] but conceptually very different. Whereas
the structure underlying [CP18] is a hash tree, our construction is based on skip
lists and has the interesting property that computing the PoSW is a reversible
computation.\r\nThe fact that the construction is reversible can potentially be
used for new applications like constructing proofs of replication. We also show
how to “embed” the sloth function of Lenstra and Weselowski [LW17] into our PoSW
to get a PoSW where one additionally can verify correctness of the output much
more efficiently than recomputing it (though recent constructions of “verifiable
delay functions” subsume most of the applications this construction was aiming
at)."
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Hamza M
full_name: Abusalah, Hamza M
id: 40297222-F248-11E8-B48F-1D18A9856A87
last_name: Abusalah
- first_name: Chethan
full_name: Kamath Hosdurg, Chethan
id: 4BD3F30E-F248-11E8-B48F-1D18A9856A87
last_name: Kamath Hosdurg
orcid: 0009-0006-6812-7317
- first_name: Karen
full_name: Klein, Karen
id: 3E83A2F8-F248-11E8-B48F-1D18A9856A87
last_name: Klein
- first_name: Krzysztof Z
full_name: Pietrzak, Krzysztof Z
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
- first_name: Michael
full_name: Walter, Michael
id: 488F98B0-F248-11E8-B48F-1D18A9856A87
last_name: Walter
orcid: 0000-0003-3186-2482
citation:
ama: 'Abusalah HM, Kamath Hosdurg C, Klein K, Pietrzak KZ, Walter M. Reversible
proofs of sequential work. In: Advances in Cryptology – EUROCRYPT 2019.
Vol 11477. Springer International Publishing; 2019:277-291. doi:10.1007/978-3-030-17656-3_10'
apa: 'Abusalah, H. M., Kamath Hosdurg, C., Klein, K., Pietrzak, K. Z., & Walter,
M. (2019). Reversible proofs of sequential work. In Advances in Cryptology
– EUROCRYPT 2019 (Vol. 11477, pp. 277–291). Darmstadt, Germany: Springer International
Publishing. https://doi.org/10.1007/978-3-030-17656-3_10'
chicago: Abusalah, Hamza M, Chethan Kamath Hosdurg, Karen Klein, Krzysztof Z Pietrzak,
and Michael Walter. “Reversible Proofs of Sequential Work.” In Advances in
Cryptology – EUROCRYPT 2019, 11477:277–91. Springer International Publishing,
2019. https://doi.org/10.1007/978-3-030-17656-3_10.
ieee: H. M. Abusalah, C. Kamath Hosdurg, K. Klein, K. Z. Pietrzak, and M. Walter,
“Reversible proofs of sequential work,” in Advances in Cryptology – EUROCRYPT
2019, Darmstadt, Germany, 2019, vol. 11477, pp. 277–291.
ista: 'Abusalah HM, Kamath Hosdurg C, Klein K, Pietrzak KZ, Walter M. 2019. Reversible
proofs of sequential work. Advances in Cryptology – EUROCRYPT 2019. EUROCRYPT:
International Conference on the Theory and Applications of Cryptographic Techniques,
LNCS, vol. 11477, 277–291.'
mla: Abusalah, Hamza M., et al. “Reversible Proofs of Sequential Work.” Advances
in Cryptology – EUROCRYPT 2019, vol. 11477, Springer International Publishing,
2019, pp. 277–91, doi:10.1007/978-3-030-17656-3_10.
short: H.M. Abusalah, C. Kamath Hosdurg, K. Klein, K.Z. Pietrzak, M. Walter, in:,
Advances in Cryptology – EUROCRYPT 2019, Springer International Publishing, 2019,
pp. 277–291.
conference:
end_date: 2019-05-23
location: Darmstadt, Germany
name: 'EUROCRYPT: International Conference on the Theory and Applications of Cryptographic
Techniques'
start_date: 2019-05-19
date_created: 2020-01-30T09:26:14Z
date_published: 2019-04-24T00:00:00Z
date_updated: 2026-04-16T10:27:47Z
day: '24'
department:
- _id: KrPi
doi: 10.1007/978-3-030-17656-3_10
ec_funded: 1
external_id:
isi:
- '000483516200010'
fulldoi: https://doi.org/10.1007/978-3-030-17656-3_10
intvolume: ' 11477'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2019/252
month: '04'
oa: 1
oa_version: Submitted Version
page: 277-291
project:
- _id: 258AA5B2-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '682815'
name: Teaching Old Crypto New Tricks
publication: Advances in Cryptology – EUROCRYPT 2019
publication_identifier:
eisbn:
- '9783030176563'
eissn:
- 1611-3349
isbn:
- '9783030176556'
issn:
- 0302-9743
publication_status: published
publisher: Springer International Publishing
quality_controlled: '1'
scopus_import: '1'
status: public
title: Reversible proofs of sequential work
type: conference
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 11477
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'
...
---
_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: '140'
abstract:
- lang: eng
text: Reachability analysis is difficult for hybrid automata with affine differential
equations, because the reach set needs to be approximated. Promising abstraction
techniques usually employ interval methods or template polyhedra. Interval methods
account for dense time and guarantee soundness, and there are interval-based tools
that overapproximate affine flowpipes. But interval methods impose bounded and
rigid shapes, which make refinement expensive and fixpoint detection difficult.
Template polyhedra, on the other hand, can be adapted flexibly and can be unbounded,
but sound template refinement for unbounded reachability analysis has been implemented
only for systems with piecewise constant dynamics. We capitalize on the advantages
of both techniques, combining interval arithmetic and template polyhedra, using
the former to abstract time and the latter to abstract space. During a CEGAR loop,
whenever a spurious error trajectory is found, we compute additional space constraints
and split time intervals, and use these space-time interpolants to eliminate the
counterexample. Space-time interpolation offers a lazy, flexible framework for
increasing precision while guaranteeing soundness, both for error avoidance and
fixpoint detection. To the best of out knowledge, this is the first abstraction
refinement scheme for the reachability analysis over unbounded and dense time
of affine hybrid systems, which is both sound and automatic. We demonstrate the
effectiveness of our algorithm with several benchmark examples, which cannot be
handled by other tools.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Goran
full_name: Frehse, Goran
last_name: Frehse
- first_name: Mirco
full_name: Giacobbe, Mirco
id: 3444EA5E-F248-11E8-B48F-1D18A9856A87
last_name: Giacobbe
orcid: 0000-0001-8180-0904
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
citation:
ama: 'Frehse G, Giacobbe M, Henzinger TA. Space-time interpolants. In: Vol 10981.
Springer; 2018:468-486. doi:10.1007/978-3-319-96145-3_25'
apa: 'Frehse, G., Giacobbe, M., & Henzinger, T. A. (2018). Space-time interpolants
(Vol. 10981, pp. 468–486). Presented at the CAV: Computer Aided Verification,
Oxford, United Kingdom: Springer. https://doi.org/10.1007/978-3-319-96145-3_25'
chicago: Frehse, Goran, Mirco Giacobbe, and Thomas A Henzinger. “Space-Time Interpolants,”
10981:468–86. Springer, 2018. https://doi.org/10.1007/978-3-319-96145-3_25.
ieee: 'G. Frehse, M. Giacobbe, and T. A. Henzinger, “Space-time interpolants,” presented
at the CAV: Computer Aided Verification, Oxford, United Kingdom, 2018, vol. 10981,
pp. 468–486.'
ista: 'Frehse G, Giacobbe M, Henzinger TA. 2018. Space-time interpolants. CAV: Computer
Aided Verification, LNCS, vol. 10981, 468–486.'
mla: Frehse, Goran, et al. Space-Time Interpolants. Vol. 10981, Springer,
2018, pp. 468–86, doi:10.1007/978-3-319-96145-3_25.
short: G. Frehse, M. Giacobbe, T.A. Henzinger, in:, Springer, 2018, pp. 468–486.
conference:
end_date: 2018-07-17
location: Oxford, United Kingdom
name: 'CAV: Computer Aided Verification'
start_date: 2018-07-14
date_created: 2018-12-11T11:44:50Z
date_published: 2018-07-18T00:00:00Z
date_updated: 2026-04-16T09:55:04Z
day: '18'
ddc:
- '005'
department:
- _id: ToHe
doi: 10.1007/978-3-319-96145-3_25
external_id:
isi:
- '000491481600025'
file:
- access_level: open_access
checksum: 6dca832f575d6b3f0ea9dff56f579142
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:17:53Z
date_updated: 2020-07-14T12:44:50Z
file_id: '5310'
file_name: IST-2018-1010-v1+1_space-time_interpolants.pdf
file_size: 563710
relation: main_file
file_date_updated: 2020-07-14T12:44:50Z
fulldoi: https://doi.org/10.1007/978-3-319-96145-3_25
has_accepted_license: '1'
intvolume: ' 10981'
isi: 1
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: 468 - 486
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 25F5A88A-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11402-N23
name: Moderne Concurrency Paradigms
publication_identifier:
issn:
- 0302-9743
publication_status: published
publisher: Springer
publist_id: '7783'
pubrep_id: '1010'
quality_controlled: '1'
related_material:
record:
- id: '6894'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Space-time interpolants
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: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 10981
year: '2018'
...
---
_id: '5679'
abstract:
- lang: eng
text: We study the almost-sure termination problem for probabilistic programs. First,
we show that supermartingales with lower bounds on conditional absolute difference
provide a sound approach for the almost-sure termination problem. Moreover, using
this approach we can obtain explicit optimal bounds on tail probabilities of non-termination
within a given number of steps. Second, we present a new approach based on Central
Limit Theorem for the almost-sure termination problem, and show that this approach
can establish almost-sure termination of programs which none of the existing approaches
can handle. Finally, we discuss algorithmic approaches for the two above methods
that lead to automated analysis techniques for almost-sure termination of probabilistic
programs.
alternative_title:
- LNCS
article_processing_charge: No
arxiv: 1
author:
- first_name: Mingzhang
full_name: Huang, Mingzhang
last_name: Huang
- first_name: Hongfei
full_name: Fu, Hongfei
last_name: Fu
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
citation:
ama: 'Huang M, Fu H, Chatterjee K. New approaches for almost-sure termination of
probabilistic programs. In: Ryu S, ed. Vol 11275. Springer; 2018:181-201. doi:10.1007/978-3-030-02768-1_11'
apa: 'Huang, M., Fu, H., & Chatterjee, K. (2018). New approaches for almost-sure
termination of probabilistic programs. In S. Ryu (Ed.) (Vol. 11275, pp. 181–201).
Presented at the 16th Asian Symposium on Programming Languages and Systems, APLAS,
Wellington, New Zealand: Springer. https://doi.org/10.1007/978-3-030-02768-1_11'
chicago: Huang, Mingzhang, Hongfei Fu, and Krishnendu Chatterjee. “New Approaches
for Almost-Sure Termination of Probabilistic Programs.” edited by Sukyoung Ryu,
11275:181–201. Springer, 2018. https://doi.org/10.1007/978-3-030-02768-1_11.
ieee: M. Huang, H. Fu, and K. Chatterjee, “New approaches for almost-sure termination
of probabilistic programs,” presented at the 16th Asian Symposium on Programming
Languages and Systems, APLAS, Wellington, New Zealand, 2018, vol. 11275, pp. 181–201.
ista: Huang M, Fu H, Chatterjee K. 2018. New approaches for almost-sure termination
of probabilistic programs. 16th Asian Symposium on Programming Languages and Systems,
APLAS, LNCS, vol. 11275, 181–201.
mla: Huang, Mingzhang, et al. New Approaches for Almost-Sure Termination of Probabilistic
Programs. Edited by Sukyoung Ryu, vol. 11275, Springer, 2018, pp. 181–201,
doi:10.1007/978-3-030-02768-1_11.
short: M. Huang, H. Fu, K. Chatterjee, in:, S. Ryu (Ed.), Springer, 2018, pp. 181–201.
conference:
end_date: 2018-12-06
location: Wellington, New Zealand
name: 16th Asian Symposium on Programming Languages and Systems, APLAS
start_date: 2018-12-02
date_created: 2018-12-16T22:59:20Z
date_published: 2018-12-01T00:00:00Z
date_updated: 2026-04-16T09:54:21Z
day: '01'
department:
- _id: KrCh
doi: 10.1007/978-3-030-02768-1_11
editor:
- first_name: Sukyoung
full_name: Ryu, Sukyoung
last_name: Ryu
external_id:
arxiv:
- '1806.06683'
isi:
- '000916310900011'
fulldoi: https://doi.org/10.1007/978-3-030-02768-1_11
intvolume: ' 11275'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1806.06683
month: '12'
oa: 1
oa_version: Preprint
page: 181-201
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 25892FC0-B435-11E9-9278-68D0E5697425
grant_number: ICT15-003
name: Efficient Algorithms for Computer Aided Verification
publication_identifier:
isbn:
- '9783030027674'
issn:
- 0302-9743
publisher: Springer
quality_controlled: '1'
scopus_import: '1'
status: public
title: New approaches for almost-sure termination of probabilistic programs
type: conference
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 11275
year: '2018'
...
---
_id: '5788'
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 winner or payoff of the game. Such
games are central in formal verification since they model the interaction between
a non-terminating system and its environment. We study bidding games in which
the players bid for the right to move the token. Two bidding rules have been defined.
In Richman bidding, in each round, the players simultaneously submit bids, and
the higher bidder moves the token and pays the other player. Poorman bidding is
similar except that the winner of the bidding pays the “bank” rather than the
other player. While poorman reachability games have been studied before, we present,
for the first time, results on infinite-duration poorman games. A central quantity
in these games is the ratio between the two players’ initial budgets. The questions
we study concern a necessary and sufficient ratio with which a player can achieve
a goal. For reachability objectives, such threshold ratios are known to exist
for both bidding rules. We show that the properties of poorman reachability games
extend to complex qualitative objectives such as parity, similarly to the Richman
case. Our most interesting results concern quantitative poorman games, namely
poorman mean-payoff games, where we construct optimal strategies depending on
the initial ratio, by showing a connection with random-turn based games. The connection
in itself is interesting, because it does not hold for reachability poorman games.
We also solve the complexity problems that arise in poorman bidding games.
alternative_title:
- LNCS
article_processing_charge: No
arxiv: 1
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
citation:
ama: 'Avni G, Henzinger TA, Ibsen-Jensen R. Infinite-duration poorman-bidding games.
In: Vol 11316. Springer; 2018:21-36. doi:10.1007/978-3-030-04612-5_2'
apa: 'Avni, G., Henzinger, T. A., & Ibsen-Jensen, R. (2018). Infinite-duration
poorman-bidding games (Vol. 11316, pp. 21–36). Presented at the 14th International
Conference on Web and Internet Economics, WINE, Oxford, UK: Springer. https://doi.org/10.1007/978-3-030-04612-5_2'
chicago: Avni, Guy, Thomas A Henzinger, and Rasmus Ibsen-Jensen. “Infinite-Duration
Poorman-Bidding Games,” 11316:21–36. Springer, 2018. https://doi.org/10.1007/978-3-030-04612-5_2.
ieee: G. Avni, T. A. Henzinger, and R. Ibsen-Jensen, “Infinite-duration poorman-bidding
games,” presented at the 14th International Conference on Web and Internet Economics,
WINE, Oxford, UK, 2018, vol. 11316, pp. 21–36.
ista: Avni G, Henzinger TA, Ibsen-Jensen R. 2018. Infinite-duration poorman-bidding
games. 14th International Conference on Web and Internet Economics, WINE, LNCS,
vol. 11316, 21–36.
mla: Avni, Guy, et al. Infinite-Duration Poorman-Bidding Games. Vol. 11316,
Springer, 2018, pp. 21–36, doi:10.1007/978-3-030-04612-5_2.
short: G. Avni, T.A. Henzinger, R. Ibsen-Jensen, in:, Springer, 2018, pp. 21–36.
conference:
end_date: 2018-12-17
location: Oxford, UK
name: 14th International Conference on Web and Internet Economics, WINE
start_date: 2018-12-15
date_created: 2018-12-30T22:59:14Z
date_published: 2018-11-21T00:00:00Z
date_updated: 2026-04-16T09:54:39Z
day: '21'
department:
- _id: ToHe
doi: 10.1007/978-3-030-04612-5_2
external_id:
arxiv:
- '1804.04372'
isi:
- '000865933000002'
fulldoi: https://doi.org/10.1007/978-3-030-04612-5_2
intvolume: ' 11316'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1804.04372
month: '11'
oa: 1
oa_version: Preprint
page: 21-36
project:
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: Formal methods for the design and analysis of complex systems
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 264B3912-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: M02369
name: Formal Methods meets Algorithmic Game Theory
publication_identifier:
isbn:
- '9783030046118'
issn:
- 0302-9743
publisher: Springer
quality_controlled: '1'
scopus_import: '1'
status: public
title: Infinite-duration poorman-bidding games
type: conference
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 11316
year: '2018'
...
---
_id: '6164'
abstract:
- lang: eng
text: In this paper, we propose an algorithm to build discrete spherical shell having
integer center and real-valued inner and outer radii on the face-centered cubic
(FCC) grid. We address the problem by mapping it to a 2D scenario and building
the shell layer by layer on hexagonal grids with additive manufacturing in mind.
The layered hexagonal grids get shifted according to need as we move from one
layer to another and forms the FCC grid in 3D. However, we restrict our computation
strictly to 2D in order to utilize symmetry and simplicity.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Girish
full_name: Koshti, Girish
last_name: Koshti
- first_name: Ranita
full_name: Biswas, Ranita
id: 3C2B033E-F248-11E8-B48F-1D18A9856A87
last_name: Biswas
orcid: 0000-0002-5372-7890
- first_name: Gaëlle
full_name: Largeteau-Skapin, Gaëlle
last_name: Largeteau-Skapin
- first_name: Rita
full_name: Zrour, Rita
last_name: Zrour
- first_name: Eric
full_name: Andres, Eric
last_name: Andres
- first_name: Partha
full_name: Bhowmick, Partha
last_name: Bhowmick
citation:
ama: 'Koshti G, Biswas R, Largeteau-Skapin G, Zrour R, Andres E, Bhowmick P. Sphere
construction on the FCC grid interpreted as layered hexagonal grids in 3D. In:
19th International Workshop. Vol 11255. Cham: Springer; 2018:82-96. doi:10.1007/978-3-030-05288-1_7'
apa: 'Koshti, G., Biswas, R., Largeteau-Skapin, G., Zrour, R., Andres, E., &
Bhowmick, P. (2018). Sphere construction on the FCC grid interpreted as layered
hexagonal grids in 3D. In 19th International Workshop (Vol. 11255, pp.
82–96). Cham: Springer. https://doi.org/10.1007/978-3-030-05288-1_7'
chicago: 'Koshti, Girish, Ranita Biswas, Gaëlle Largeteau-Skapin, Rita Zrour, Eric
Andres, and Partha Bhowmick. “Sphere Construction on the FCC Grid Interpreted
as Layered Hexagonal Grids in 3D.” In 19th International Workshop, 11255:82–96.
Cham: Springer, 2018. https://doi.org/10.1007/978-3-030-05288-1_7.'
ieee: G. Koshti, R. Biswas, G. Largeteau-Skapin, R. Zrour, E. Andres, and P. Bhowmick,
“Sphere construction on the FCC grid interpreted as layered hexagonal grids in
3D,” in 19th International Workshop, Porto, Portugal, 2018, vol. 11255,
pp. 82–96.
ista: 'Koshti G, Biswas R, Largeteau-Skapin G, Zrour R, Andres E, Bhowmick P. 2018.
Sphere construction on the FCC grid interpreted as layered hexagonal grids in
3D. 19th International Workshop. IWCIA: International Workshop on Combinatorial
Image Analysis, LNCS, vol. 11255, 82–96.'
mla: Koshti, Girish, et al. “Sphere Construction on the FCC Grid Interpreted as
Layered Hexagonal Grids in 3D.” 19th International Workshop, vol. 11255,
Springer, 2018, pp. 82–96, doi:10.1007/978-3-030-05288-1_7.
short: G. Koshti, R. Biswas, G. Largeteau-Skapin, R. Zrour, E. Andres, P. Bhowmick,
in:, 19th International Workshop, Springer, Cham, 2018, pp. 82–96.
conference:
end_date: 2018-11-24
location: Porto, Portugal
name: 'IWCIA: International Workshop on Combinatorial Image Analysis'
start_date: 2018-11-22
date_created: 2019-03-21T12:16:58Z
date_published: 2018-11-22T00:00:00Z
date_updated: 2022-01-27T15:26:39Z
day: '22'
doi: 10.1007/978-3-030-05288-1_7
extern: '1'
fulldoi: https://doi.org/10.1007/978-3-030-05288-1_7
intvolume: ' 11255'
language:
- iso: eng
month: '11'
oa_version: None
page: 82-96
place: Cham
publication: 19th International Workshop
publication_identifier:
eisbn:
- 978-3-030-05288-1
eissn:
- 1611-3349
isbn:
- 978-3-030-05287-4
issn:
- 0302-9743
publication_status: published
publisher: Springer
quality_controlled: '1'
status: public
title: Sphere construction on the FCC grid interpreted as layered hexagonal grids
in 3D
type: conference
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 11255
year: '2018'
...
---
_id: '8298'
abstract:
- lang: eng
text: Sharding, or partitioning the system’s state so that different subsets of
participants handle it, is a proven approach to building distributed systems whose
total capacity scales horizontally with the number of participants. Many distributed
ledgers have adopted this approach to increase their performance, however, they
focus on the permissionless setting that assumes the existence of a strong adversary.
In this paper, we deploy channels for permissioned blockchains. Our first contribution
is to adapt sharding on asset-management applications for the permissioned setting,
while preserving liveness and safety even on transactions spanning across-channels.
Our second contribution is to leverage channels as a confidentiality boundary,
enabling different organizations and consortia to preserve their privacy within
their channels and still be part of a bigger collaborative ecosystem. To make
our system concrete we map it on top of Hyperledger Fabric.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Elli
full_name: Androulaki, Elli
last_name: Androulaki
- first_name: Christian
full_name: Cachin, Christian
last_name: Cachin
- first_name: Angelo
full_name: De Caro, Angelo
last_name: De Caro
- first_name: Eleftherios
full_name: Kokoris Kogias, Eleftherios
id: f5983044-d7ef-11ea-ac6d-fd1430a26d30
last_name: Kokoris Kogias
citation:
ama: 'Androulaki E, Cachin C, De Caro A, Kokoris Kogias E. Channels: Horizontal
scaling and confidentiality on permissioned blockchains. In: Computer Security.
Vol 11098. Springer Nature; 2018:111-131. doi:10.1007/978-3-319-99073-6_6'
apa: 'Androulaki, E., Cachin, C., De Caro, A., & Kokoris Kogias, E. (2018).
Channels: Horizontal scaling and confidentiality on permissioned blockchains.
In Computer Security (Vol. 11098, pp. 111–131). Barcelona, Spain: Springer
Nature. https://doi.org/10.1007/978-3-319-99073-6_6'
chicago: 'Androulaki, Elli, Christian Cachin, Angelo De Caro, and Eleftherios Kokoris
Kogias. “Channels: Horizontal Scaling and Confidentiality on Permissioned Blockchains.”
In Computer Security, 11098:111–31. Springer Nature, 2018. https://doi.org/10.1007/978-3-319-99073-6_6.'
ieee: 'E. Androulaki, C. Cachin, A. De Caro, and E. Kokoris Kogias, “Channels: Horizontal
scaling and confidentiality on permissioned blockchains,” in Computer Security,
Barcelona, Spain, 2018, vol. 11098, pp. 111–131.'
ista: 'Androulaki E, Cachin C, De Caro A, Kokoris Kogias E. 2018. Channels: Horizontal
scaling and confidentiality on permissioned blockchains. Computer Security. ESORICS:
European Symposium on Research in Computer Security, LNCS, vol. 11098, 111–131.'
mla: 'Androulaki, Elli, et al. “Channels: Horizontal Scaling and Confidentiality
on Permissioned Blockchains.” Computer Security, vol. 11098, Springer Nature,
2018, pp. 111–31, doi:10.1007/978-3-319-99073-6_6.'
short: E. Androulaki, C. Cachin, A. De Caro, E. Kokoris Kogias, in:, Computer Security,
Springer Nature, 2018, pp. 111–131.
conference:
end_date: 2018-09-07
location: Barcelona, Spain
name: 'ESORICS: European Symposium on Research in Computer Security'
start_date: 2018-09-03
date_created: 2020-08-26T11:47:34Z
date_published: 2018-08-08T00:00:00Z
date_updated: 2021-01-12T08:17:57Z
day: '08'
doi: 10.1007/978-3-319-99073-6_6
extern: '1'
fulldoi: https://doi.org/10.1007/978-3-319-99073-6_6
intvolume: ' 11098'
language:
- iso: eng
month: '08'
oa_version: None
page: 111-131
publication: Computer Security
publication_identifier:
eisbn:
- '9783319990736'
isbn:
- '9783319990729'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
status: public
title: 'Channels: Horizontal scaling and confidentiality on permissioned blockchains'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 11098
year: '2018'
...
---
_id: '85'
abstract:
- lang: eng
text: Concurrent accesses to shared data structures must be synchronized to avoid
data races. Coarse-grained synchronization, which locks the entire data structure,
is easy to implement but does not scale. Fine-grained synchronization can scale
well, but can be hard to reason about. Hand-over-hand locking, in which operations
are pipelined as they traverse the data structure, combines fine-grained synchronization
with ease of use. However, the traditional implementation suffers from inherent
overheads. This paper introduces snapshot-based synchronization (SBS), a novel
hand-over-hand locking mechanism. SBS decouples the synchronization state from
the data, significantly improving cache utilization. Further, it relies on guarantees
provided by pipelining to minimize synchronization that requires cross-thread
communication. Snapshot-based synchronization thus scales much better than traditional
hand-over-hand locking, while maintaining the same ease of use.
acknowledgement: Trevor Brown was supported in part by the ISF (grants 2005/17 & 1749/14)
and by a NSERC post-doctoral fellowship.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Eran
full_name: Gilad, Eran
last_name: Gilad
- first_name: Trevor A
full_name: Brown, Trevor A
id: 3569F0A0-F248-11E8-B48F-1D18A9856A87
last_name: Brown
- first_name: Mark
full_name: Oskin, Mark
last_name: Oskin
- first_name: Yoav
full_name: Etsion, Yoav
last_name: Etsion
citation:
ama: 'Gilad E, Brown TA, Oskin M, Etsion Y. Snapshot based synchronization: A fast
replacement for Hand-over-Hand locking. In: Vol 11014. Springer; 2018:465-479.
doi:10.1007/978-3-319-96983-1_33'
apa: 'Gilad, E., Brown, T. A., Oskin, M., & Etsion, Y. (2018). Snapshot based
synchronization: A fast replacement for Hand-over-Hand locking (Vol. 11014, pp.
465–479). Presented at the Euro-Par: European Conference on Parallel Processing,
Turin, Italy: Springer. https://doi.org/10.1007/978-3-319-96983-1_33'
chicago: 'Gilad, Eran, Trevor A Brown, Mark Oskin, and Yoav Etsion. “Snapshot Based
Synchronization: A Fast Replacement for Hand-over-Hand Locking,” 11014:465–79.
Springer, 2018. https://doi.org/10.1007/978-3-319-96983-1_33.'
ieee: 'E. Gilad, T. A. Brown, M. Oskin, and Y. Etsion, “Snapshot based synchronization:
A fast replacement for Hand-over-Hand locking,” presented at the Euro-Par: European
Conference on Parallel Processing, Turin, Italy, 2018, vol. 11014, pp. 465–479.'
ista: 'Gilad E, Brown TA, Oskin M, Etsion Y. 2018. Snapshot based synchronization:
A fast replacement for Hand-over-Hand locking. Euro-Par: European Conference on
Parallel Processing, LNCS, vol. 11014, 465–479.'
mla: 'Gilad, Eran, et al. Snapshot Based Synchronization: A Fast Replacement
for Hand-over-Hand Locking. Vol. 11014, Springer, 2018, pp. 465–79, doi:10.1007/978-3-319-96983-1_33.'
short: E. Gilad, T.A. Brown, M. Oskin, Y. Etsion, in:, Springer, 2018, pp. 465–479.
conference:
end_date: 2018-08-31
location: Turin, Italy
name: 'Euro-Par: European Conference on Parallel Processing'
start_date: 2018-08-27
date_created: 2018-12-11T11:44:33Z
date_published: 2018-08-01T00:00:00Z
date_updated: 2026-04-16T09:53:41Z
day: '01'
ddc:
- '000'
department:
- _id: DaAl
doi: 10.1007/978-3-319-96983-1_33
external_id:
isi:
- '000851042300031'
file:
- access_level: open_access
checksum: 13a3f250be8878405e791b53c19722ad
content_type: application/pdf
creator: dernst
date_created: 2019-02-12T07:40:40Z
date_updated: 2020-07-14T12:48:14Z
file_id: '5954'
file_name: 2018_Brown.pdf
file_size: 665372
relation: main_file
file_date_updated: 2020-07-14T12:48:14Z
fulldoi: https://doi.org/10.1007/978-3-319-96983-1_33
has_accepted_license: '1'
intvolume: ' 11014'
isi: 1
language:
- iso: eng
month: '08'
oa: 1
oa_version: Preprint
page: 465 - 479
project:
- _id: 26450934-B435-11E9-9278-68D0E5697425
name: NSERC Postdoctoral fellowship
publication_identifier:
issn:
- 0302-9743
publication_status: published
publisher: Springer
publist_id: '7969'
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Snapshot based synchronization: A fast replacement for Hand-over-Hand locking'
type: conference
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 11014
year: '2018'
...
---
_id: '6941'
abstract:
- lang: eng
text: "Bitcoin has become the most successful cryptocurrency ever deployed, and
its most distinctive feature is that it is decentralized. Its underlying protocol
(Nakamoto consensus) achieves this by using proof of work, which has the drawback
that it causes the consumption of vast amounts of energy to maintain the ledger.
Moreover, Bitcoin mining dynamics have become less distributed over time.\r\n\r\nTowards
addressing these issues, we propose SpaceMint, a cryptocurrency based on proofs
of space instead of proofs of work. Miners in SpaceMint dedicate disk space rather
than computation. We argue that SpaceMint’s design solves or alleviates several
of Bitcoin’s issues: most notably, its large energy consumption. SpaceMint also
rewards smaller miners fairly according to their contribution to the network,
thus incentivizing more distributed participation.\r\n\r\nThis paper adapts proof
of space to enable its use in cryptocurrency, studies the attacks that can arise
against a Bitcoin-like blockchain that uses proof of space, and proposes a new
blockchain format and transaction types to address these attacks. Our prototype
shows that initializing 1 TB for mining takes about a day (a one-off setup cost),
and miners spend on average just a fraction of a second per block mined. Finally,
we provide a game-theoretic analysis modeling SpaceMint as an extensive game (the
canonical game-theoretic notion for games that take place over time) and show
that this stylized game satisfies a strong equilibrium notion, thereby arguing
for SpaceMint ’s stability and consensus."
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Sunoo
full_name: Park, Sunoo
last_name: Park
- first_name: Albert
full_name: Kwon, Albert
last_name: Kwon
- first_name: Georg
full_name: Fuchsbauer, Georg
id: 46B4C3EE-F248-11E8-B48F-1D18A9856A87
last_name: Fuchsbauer
- first_name: Peter
full_name: Gazi, Peter
id: 3E0BFE38-F248-11E8-B48F-1D18A9856A87
last_name: Gazi
- first_name: Joel F
full_name: Alwen, Joel F
id: 2A8DFA8C-F248-11E8-B48F-1D18A9856A87
last_name: Alwen
- 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: 'Park S, Kwon A, Fuchsbauer G, Gazi P, Alwen JF, Pietrzak KZ. SpaceMint: A
cryptocurrency based on proofs of space. In: 22nd International Conference
on Financial Cryptography and Data Security. Vol 10957. Springer Nature; 2018:480-499.
doi:10.1007/978-3-662-58387-6_26'
apa: 'Park, S., Kwon, A., Fuchsbauer, G., Gazi, P., Alwen, J. F., & Pietrzak,
K. Z. (2018). SpaceMint: A cryptocurrency based on proofs of space. In 22nd
International Conference on Financial Cryptography and Data Security (Vol.
10957, pp. 480–499). Nieuwpoort, Curacao: Springer Nature. https://doi.org/10.1007/978-3-662-58387-6_26'
chicago: 'Park, Sunoo, Albert Kwon, Georg Fuchsbauer, Peter Gazi, Joel F Alwen,
and Krzysztof Z Pietrzak. “SpaceMint: A Cryptocurrency Based on Proofs of Space.”
In 22nd International Conference on Financial Cryptography and Data Security,
10957:480–99. Springer Nature, 2018. https://doi.org/10.1007/978-3-662-58387-6_26.'
ieee: 'S. Park, A. Kwon, G. Fuchsbauer, P. Gazi, J. F. Alwen, and K. Z. Pietrzak,
“SpaceMint: A cryptocurrency based on proofs of space,” in 22nd International
Conference on Financial Cryptography and Data Security, Nieuwpoort, Curacao,
2018, vol. 10957, pp. 480–499.'
ista: 'Park S, Kwon A, Fuchsbauer G, Gazi P, Alwen JF, Pietrzak KZ. 2018. SpaceMint:
A cryptocurrency based on proofs of space. 22nd International Conference on Financial
Cryptography and Data Security. FC: Financial Cryptography and Data Security,
LNCS, vol. 10957, 480–499.'
mla: 'Park, Sunoo, et al. “SpaceMint: A Cryptocurrency Based on Proofs of Space.”
22nd International Conference on Financial Cryptography and Data Security,
vol. 10957, Springer Nature, 2018, pp. 480–99, doi:10.1007/978-3-662-58387-6_26.'
short: S. Park, A. Kwon, G. Fuchsbauer, P. Gazi, J.F. Alwen, K.Z. Pietrzak, in:,
22nd International Conference on Financial Cryptography and Data Security, Springer
Nature, 2018, pp. 480–499.
conference:
end_date: 2018-03-02
location: Nieuwpoort, Curacao
name: 'FC: Financial Cryptography and Data Security'
start_date: 2018-02-26
date_created: 2019-10-14T06:35:38Z
date_published: 2018-12-07T00:00:00Z
date_updated: 2026-04-16T10:30:49Z
day: '07'
department:
- _id: KrPi
doi: 10.1007/978-3-662-58387-6_26
ec_funded: 1
external_id:
isi:
- '000540656400026'
fulldoi: https://doi.org/10.1007/978-3-662-58387-6_26
intvolume: ' 10957'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2015/528
month: '12'
oa: 1
oa_version: Submitted Version
page: 480-499
project:
- _id: 258AA5B2-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '682815'
name: Teaching Old Crypto New Tricks
publication: 22nd International Conference on Financial Cryptography and Data Security
publication_identifier:
eisbn:
- '9783662583876'
eissn:
- 1611-3349
isbn:
- '9783662583869'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'SpaceMint: A cryptocurrency based on proofs of space'
type: conference
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 10957
year: '2018'
...
---
_id: '18282'
abstract:
- lang: eng
text: In this paper, we introduce a random forest semantic hashing scheme that embeds
tiny convolutional neural networks (CNN) into shallow random forests. A binary
hash code for a data point is obtained by a set of decision trees, setting ‘1’
for the visited tree leaf, and ‘0’ for the rest. We propose to first randomly
group arriving classes at each tree split node into two groups, obtaining a significantly
simplified two-class classification problem that can be a handled with a light-weight
CNN weak learner. Code uniqueness is achieved via the random class grouping, whilst
code consistency is achieved using a low-rank loss in the CNN weak learners that
encourages intra-class compactness for the two random class groups. Finally, we
introduce an information-theoretic approach for aggregating codes of individual
trees into a single hash code, producing a near-optimal unique hash for each class.
The proposed approach significantly outperforms state-of-the-art hashing methods
for image retrieval tasks on large-scale public datasets, and is comparable to
image classification methods while utilizing a more compact, efficient and scalable
representation. This work proposes a principled and robust procedure to train
and deploy in parallel an ensemble of light-weight CNNs, instead of simply going
deeper.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Qiang
full_name: Qiu, Qiang
last_name: Qiu
- first_name: José
full_name: Lezama, José
last_name: Lezama
- first_name: Alexander
full_name: Bronstein, Alexander
id: 58f3726e-7cba-11ef-ad8b-e6e8cb3904e6
last_name: Bronstein
orcid: 0000-0001-9699-8730
- first_name: Guillermo
full_name: Sapiro, Guillermo
last_name: Sapiro
citation:
ama: 'Qiu Q, Lezama J, Bronstein AM, Sapiro G. ForestHash: Semantic hashing with
shallow random forests and tiny convolutional networks. In: European Conference
on Computer Vision. Vol 11206. Springer Nature; 2018. doi:10.1007/978-3-030-01216-8_27'
apa: 'Qiu, Q., Lezama, J., Bronstein, A. M., & Sapiro, G. (2018). ForestHash:
Semantic hashing with shallow random forests and tiny convolutional networks.
In European Conference on Computer Vision (Vol. 11206). Munich, Germany:
Springer Nature. https://doi.org/10.1007/978-3-030-01216-8_27'
chicago: 'Qiu, Qiang, José Lezama, Alex M. Bronstein, and Guillermo Sapiro. “ForestHash:
Semantic Hashing with Shallow Random Forests and Tiny Convolutional Networks.”
In European Conference on Computer Vision, Vol. 11206. Springer Nature,
2018. https://doi.org/10.1007/978-3-030-01216-8_27.'
ieee: 'Q. Qiu, J. Lezama, A. M. Bronstein, and G. Sapiro, “ForestHash: Semantic
hashing with shallow random forests and tiny convolutional networks,” in European
Conference on Computer Vision, Munich, Germany, 2018, vol. 11206, no. Part
II.'
ista: 'Qiu Q, Lezama J, Bronstein AM, Sapiro G. 2018. ForestHash: Semantic hashing
with shallow random forests and tiny convolutional networks. European Conference
on Computer Vision. ECCV: European Conference on Computer Vision, LNCS, vol. 11206.'
mla: 'Qiu, Qiang, et al. “ForestHash: Semantic Hashing with Shallow Random Forests
and Tiny Convolutional Networks.” European Conference on Computer Vision,
vol. 11206, no. Part II, Springer Nature, 2018, doi:10.1007/978-3-030-01216-8_27.'
short: Q. Qiu, J. Lezama, A.M. Bronstein, G. Sapiro, in:, European Conference on
Computer Vision, Springer Nature, 2018.
conference:
end_date: 2018-09-14
location: Munich, Germany
name: 'ECCV: European Conference on Computer Vision'
start_date: 2018-09-08
date_created: 2024-10-09T07:47:30Z
date_published: 2018-10-09T00:00:00Z
date_updated: 2025-01-23T13:25:18Z
day: '09'
doi: 10.1007/978-3-030-01216-8_27
extern: '1'
fulldoi: https://doi.org/10.1007/978-3-030-01216-8_27
intvolume: ' 11206'
issue: Part II
language:
- iso: eng
month: '10'
oa_version: None
publication: European Conference on Computer Vision
publication_identifier:
eisbn:
- '9783030012168'
eissn:
- 1611-3349
isbn:
- '9783030012151'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'ForestHash: Semantic hashing with shallow random forests and tiny convolutional
networks'
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 11206
year: '2018'
...
---
_id: '18283'
abstract:
- lang: eng
text: Cardiac ultrasound imaging requires a high frame rate in order to capture
rapid motion. This can be achieved by multi-line acquisition (MLA), where several
narrow-focused received lines are obtained from each wide-focused transmitted
line. This shortens the acquisition time at the expense of introducing block artifacts.
In this paper, we propose a data-driven learning-based approach to improve the
MLA image quality. We train an end-to-end convolutional neural network on pairs
of real ultrasound cardiac data, acquired through MLA and the corresponding single-line
acquisition (SLA). The network achieves a significant improvement in image quality
for both 5- and 7-line MLA resulting in a decorrelation measure similar to that
of SLA while having the frame rate of MLA.
alternative_title:
- LNCS
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: Grigoriy
full_name: Zurakhov, Grigoriy
last_name: Zurakhov
- first_name: Alexander
full_name: Bronstein, Alexander
id: 58f3726e-7cba-11ef-ad8b-e6e8cb3904e6
last_name: Bronstein
orcid: 0000-0001-9699-8730
- first_name: Michael
full_name: Zibulevsky, Michael
last_name: Zibulevsky
- first_name: Oleg
full_name: Michailovich, Oleg
last_name: Michailovich
- first_name: Dan
full_name: Adam, Dan
last_name: Adam
- first_name: David
full_name: Blondheim, David
last_name: Blondheim
citation:
ama: 'Senouf O, Vedula S, Zurakhov G, et al. High frame-rate cardiac ultrasound
imaging with deep learning. In: International Conference on Medical Image Computing
and Computer Assisted Intervention. Vol 11070. Springer Nature; 2018:126-134.
doi:10.1007/978-3-030-00928-1_15'
apa: 'Senouf, O., Vedula, S., Zurakhov, G., Bronstein, A. M., Zibulevsky, M., Michailovich,
O., … Blondheim, D. (2018). High frame-rate cardiac ultrasound imaging with deep
learning. In International Conference on Medical Image Computing and Computer
Assisted Intervention (Vol. 11070, pp. 126–134). Granada, Spain: Springer
Nature. https://doi.org/10.1007/978-3-030-00928-1_15'
chicago: Senouf, Ortal, Sanketh Vedula, Grigoriy Zurakhov, Alex M. Bronstein, Michael
Zibulevsky, Oleg Michailovich, Dan Adam, and David Blondheim. “High Frame-Rate
Cardiac Ultrasound Imaging with Deep Learning.” In International Conference
on Medical Image Computing and Computer Assisted Intervention, 11070:126–34.
Springer Nature, 2018. https://doi.org/10.1007/978-3-030-00928-1_15.
ieee: O. Senouf et al., “High frame-rate cardiac ultrasound imaging with
deep learning,” in International Conference on Medical Image Computing and
Computer Assisted Intervention, Granada, Spain, 2018, vol. 11070, no. Part
1, pp. 126–134.
ista: 'Senouf O, Vedula S, Zurakhov G, Bronstein AM, Zibulevsky M, Michailovich
O, Adam D, Blondheim D. 2018. High frame-rate cardiac ultrasound imaging with
deep learning. International Conference on Medical Image Computing and Computer
Assisted Intervention. MICCAI: Medical Image Computing and Computer Assisted Intervention,
LNCS, vol. 11070, 126–134.'
mla: Senouf, Ortal, et al. “High Frame-Rate Cardiac Ultrasound Imaging with Deep
Learning.” International Conference on Medical Image Computing and Computer
Assisted Intervention, vol. 11070, no. Part 1, Springer Nature, 2018, pp.
126–34, doi:10.1007/978-3-030-00928-1_15.
short: O. Senouf, S. Vedula, G. Zurakhov, A.M. Bronstein, M. Zibulevsky, O. Michailovich,
D. Adam, D. Blondheim, in:, International Conference on Medical Image Computing
and Computer Assisted Intervention, Springer Nature, 2018, pp. 126–134.
conference:
end_date: 2018-09-20
location: Granada, Spain
name: 'MICCAI: Medical Image Computing and Computer Assisted Intervention'
start_date: 2018-09-16
date_created: 2024-10-09T07:47:49Z
date_published: 2018-09-14T00:00:00Z
date_updated: 2025-01-23T13:13:01Z
day: '14'
doi: 10.1007/978-3-030-00928-1_15
extern: '1'
fulldoi: https://doi.org/10.1007/978-3-030-00928-1_15
intvolume: ' 11070'
issue: Part 1
language:
- iso: eng
month: '09'
oa_version: None
page: 126 - 134
publication: International Conference on Medical Image Computing and Computer Assisted
Intervention
publication_identifier:
eisbn:
- '9783030009281'
eissn:
- 1611-3349
isbn:
- '9783030009274'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: High frame-rate cardiac ultrasound imaging with deep learning
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 11070
year: '2018'
...
---
_id: '18284'
abstract:
- lang: eng
text: Frame rate is a crucial consideration in cardiac ultrasound imaging and 3D
sonography. Several methods have been proposed in the medical ultrasound literature
aiming at accelerating the image acquisition. In this paper, we consider one such
method called multi-line transmission (MLT), in which several evenly separated
focused beams are transmitted simultaneously. While MLT reduces the acquisition
time, it comes at the expense of a heavy loss of contrast due to the interactions
between the beams (cross-talk artifact). In this paper, we introduce a data-driven
method to reduce the artifacts arising in MLT. To this end, we propose to train
an end-to-end convolutional neural network consisting of correction layers followed
by a constant apodization layer. The network is trained on pairs of raw data obtained
through MLT and the corresponding single-line transmission (SLT) data. Experimental
evaluation demonstrates significant improvement both in the visual image quality
and in objective measures such as contrast ratio and contrast-to-noise ratio,
while preserving resolution unlike traditional apodization-based methods. We show
that the proposed method is able to generalize well across different patients
and anatomies on real and phantom data.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Sanketh
full_name: Vedula, Sanketh
last_name: Vedula
- first_name: Ortal
full_name: Senouf, Ortal
last_name: Senouf
- first_name: Grigoriy
full_name: Zurakhov, Grigoriy
last_name: Zurakhov
- first_name: Alexander
full_name: Bronstein, Alexander
id: 58f3726e-7cba-11ef-ad8b-e6e8cb3904e6
last_name: Bronstein
orcid: 0000-0001-9699-8730
- first_name: Michael
full_name: Zibulevsky, Michael
last_name: Zibulevsky
- first_name: Oleg
full_name: Michailovich, Oleg
last_name: Michailovich
- first_name: Dan
full_name: Adam, Dan
last_name: Adam
- first_name: Diana
full_name: Gaitini, Diana
last_name: Gaitini
citation:
ama: 'Vedula S, Senouf O, Zurakhov G, et al. High quality ultrasonic multi-line
transmission through deep learning. In: First International Workshop, MLMIR
2018, Held in Conjunction with MICCAI 2018. Vol 11074. Springer Nature; 2018:147-155.
doi:10.1007/978-3-030-00129-2_17'
apa: 'Vedula, S., Senouf, O., Zurakhov, G., Bronstein, A. M., Zibulevsky, M., Michailovich,
O., … Gaitini, D. (2018). High quality ultrasonic multi-line transmission through
deep learning. In First International Workshop, MLMIR 2018, Held in Conjunction
with MICCAI 2018 (Vol. 11074, pp. 147–155). Granada, Spain: Springer Nature.
https://doi.org/10.1007/978-3-030-00129-2_17'
chicago: Vedula, Sanketh, Ortal Senouf, Grigoriy Zurakhov, Alex M. Bronstein, Michael
Zibulevsky, Oleg Michailovich, Dan Adam, and Diana Gaitini. “High Quality Ultrasonic
Multi-Line Transmission through Deep Learning.” In First International Workshop,
MLMIR 2018, Held in Conjunction with MICCAI 2018, 11074:147–55. Springer Nature,
2018. https://doi.org/10.1007/978-3-030-00129-2_17.
ieee: S. Vedula et al., “High quality ultrasonic multi-line transmission
through deep learning,” in First International Workshop, MLMIR 2018, Held in
Conjunction with MICCAI 2018, Granada, Spain, 2018, vol. 11074, pp. 147–155.
ista: 'Vedula S, Senouf O, Zurakhov G, Bronstein AM, Zibulevsky M, Michailovich
O, Adam D, Gaitini D. 2018. High quality ultrasonic multi-line transmission through
deep learning. First International Workshop, MLMIR 2018, Held in Conjunction with
MICCAI 2018. MLMIR: Workshop on Machine Learning for Medical Image Reconstruction,
LNCS, vol. 11074, 147–155.'
mla: Vedula, Sanketh, et al. “High Quality Ultrasonic Multi-Line Transmission through
Deep Learning.” First International Workshop, MLMIR 2018, Held in Conjunction
with MICCAI 2018, vol. 11074, Springer Nature, 2018, pp. 147–55, doi:10.1007/978-3-030-00129-2_17.
short: S. Vedula, O. Senouf, G. Zurakhov, A.M. Bronstein, M. Zibulevsky, O. Michailovich,
D. Adam, D. Gaitini, in:, First International Workshop, MLMIR 2018, Held in Conjunction
with MICCAI 2018, Springer Nature, 2018, pp. 147–155.
conference:
end_date: 2018-09-16
location: Granada, Spain
name: 'MLMIR: Workshop on Machine Learning for Medical Image Reconstruction'
start_date: 2018-09-16
date_created: 2024-10-09T07:48:06Z
date_published: 2018-09-12T00:00:00Z
date_updated: 2025-01-23T12:53:22Z
day: '12'
doi: 10.1007/978-3-030-00129-2_17
extern: '1'
fulldoi: https://doi.org/10.1007/978-3-030-00129-2_17
intvolume: ' 11074'
language:
- iso: eng
month: '09'
oa_version: None
page: 147 - 155
publication: First International Workshop, MLMIR 2018, Held in Conjunction with MICCAI
2018
publication_identifier:
eisbn:
- '9783030001292'
eissn:
- 1611-3349
isbn:
- '9783030001285'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: High quality ultrasonic multi-line transmission through deep learning
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 11074
year: '2018'
...
---
_id: '1116'
abstract:
- lang: eng
text: "Time-triggered switched networks are a deterministic communication infrastructure
used by real-time distributed embedded systems. Due to the criticality of the
applications running over them, developers need to ensure that end-to-end communication
is dependable and predictable. Traditional approaches assume static networks that
are not flexible to changes caused by reconfigurations or, more importantly, faults,
which are dealt with in the application using redundancy. We adopt the concept
of handling faults in the switches from non-real-time networks while maintaining
the required predictability. \r\n\r\nWe study a class of forwarding schemes that
can handle various types of failures. We consider probabilistic failures. We study
a class of forwarding schemes that can handle various types of failures. We consider
probabilistic failures. For a given network with a forwarding scheme and a constant
ℓ, we compute the {\\em score} of the scheme, namely the probability (induced
by faults) that at least ℓ messages arrive on time. We reduce the scoring problem
to a reachability problem on a Markov chain with a "product-like" structure.
Its special structure allows us to reason about it symbolically, and reduce the
scoring problem to #SAT. Our solution is generic and can be adapted to different
networks and other contexts. Also, we show the computational complexity of the
scoring problem is #P-complete, and we study methods to estimate the score. We
evaluate the effectiveness of our techniques with an implementation. "
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: Shubham
full_name: Goel, Shubham
last_name: Goel
- 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: Guillermo
full_name: Rodríguez Navas, Guillermo
last_name: Rodríguez Navas
citation:
ama: 'Avni G, Goel S, Henzinger TA, Rodríguez Navas G. Computing scores of forwarding
schemes in switched networks with probabilistic faults. In: Vol 10206. Springer;
2017:169-187. doi:10.1007/978-3-662-54580-5_10'
apa: 'Avni, G., Goel, S., Henzinger, T. A., & Rodríguez Navas, G. (2017). Computing
scores of forwarding schemes in switched networks with probabilistic faults (Vol.
10206, pp. 169–187). Presented at the TACAS: Tools and Algorithms for the Construction
and Analysis of Systems, Uppsala, Sweden: Springer. https://doi.org/10.1007/978-3-662-54580-5_10'
chicago: Avni, Guy, Shubham Goel, Thomas A Henzinger, and Guillermo Rodríguez Navas.
“Computing Scores of Forwarding Schemes in Switched Networks with Probabilistic
Faults,” 10206:169–87. Springer, 2017. https://doi.org/10.1007/978-3-662-54580-5_10.
ieee: 'G. Avni, S. Goel, T. A. Henzinger, and G. Rodríguez Navas, “Computing scores
of forwarding schemes in switched networks with probabilistic faults,” presented
at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems,
Uppsala, Sweden, 2017, vol. 10206, pp. 169–187.'
ista: 'Avni G, Goel S, Henzinger TA, Rodríguez Navas G. 2017. Computing scores of
forwarding schemes in switched networks with probabilistic faults. TACAS: Tools
and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 10206,
169–187.'
mla: Avni, Guy, et al. Computing Scores of Forwarding Schemes in Switched Networks
with Probabilistic Faults. Vol. 10206, Springer, 2017, pp. 169–87, doi:10.1007/978-3-662-54580-5_10.
short: G. Avni, S. Goel, T.A. Henzinger, G. Rodríguez Navas, in:, Springer, 2017,
pp. 169–187.
conference:
end_date: 2017-04-29
location: Uppsala, Sweden
name: 'TACAS: Tools and Algorithms for the Construction and Analysis of Systems'
start_date: 2017-04-22
corr_author: '1'
date_created: 2018-12-11T11:50:14Z
date_published: 2017-03-31T00:00:00Z
date_updated: 2026-04-16T09:56:24Z
day: '31'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.1007/978-3-662-54580-5_10
external_id:
isi:
- '000440733400010'
file:
- access_level: open_access
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:08:37Z
date_updated: 2018-12-12T10:08:37Z
file_id: '4698'
file_name: IST-2017-758-v1+1_tacas-cr.pdf
file_size: 321800
relation: main_file
file_date_updated: 2018-12-12T10:08:37Z
fulldoi: https://doi.org/10.1007/978-3-662-54580-5_10
has_accepted_license: '1'
intvolume: ' 10206'
isi: 1
language:
- iso: eng
month: '03'
oa: 1
oa_version: Submitted Version
page: 169 - 187
project:
- _id: 25F5A88A-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11402-N23
name: Moderne Concurrency Paradigms
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: Formal methods for the design and analysis of complex systems
publication_identifier:
issn:
- 0302-9743
publication_status: published
publisher: Springer
publist_id: '6246'
pubrep_id: '758'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Computing scores of forwarding schemes in switched networks with probabilistic
faults
type: conference
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 10206
year: '2017'
...
---
_id: '11772'
abstract:
- lang: eng
text: A dynamic graph algorithm is a data structure that supports operations on
dynamically changing graphs.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
citation:
ama: 'Henzinger M. The state of the art in dynamic graph algorithms. In: 44th
International Conference on Current Trends in Theory and Practice of Computer
Science. Vol 10706. Springer Nature; 2017:40–44. doi:10.1007/978-3-319-73117-9_3'
apa: 'Henzinger, M. (2017). The state of the art in dynamic graph algorithms. In
44th International Conference on Current Trends in Theory and Practice of Computer
Science (Vol. 10706, pp. 40–44). Krems, Austria: Springer Nature. https://doi.org/10.1007/978-3-319-73117-9_3'
chicago: Henzinger, Monika. “The State of the Art in Dynamic Graph Algorithms.”
In 44th International Conference on Current Trends in Theory and Practice of
Computer Science, 10706:40–44. Springer Nature, 2017. https://doi.org/10.1007/978-3-319-73117-9_3.
ieee: M. Henzinger, “The state of the art in dynamic graph algorithms,” in 44th
International Conference on Current Trends in Theory and Practice of Computer
Science, Krems, Austria, 2017, vol. 10706, pp. 40–44.
ista: 'Henzinger M. 2017. The state of the art in dynamic graph algorithms. 44th
International Conference on Current Trends in Theory and Practice of Computer
Science. SOFSEM: Theory and Practice of Computer Science, LNCS, vol. 10706, 40–44.'
mla: Henzinger, Monika. “The State of the Art in Dynamic Graph Algorithms.” 44th
International Conference on Current Trends in Theory and Practice of Computer
Science, vol. 10706, Springer Nature, 2017, pp. 40–44, doi:10.1007/978-3-319-73117-9_3.
short: M. Henzinger, in:, 44th International Conference on Current Trends in Theory
and Practice of Computer Science, Springer Nature, 2017, pp. 40–44.
conference:
end_date: 2018-02-02
location: Krems, Austria
name: 'SOFSEM: Theory and Practice of Computer Science'
start_date: 2018-01-29
date_created: 2022-08-08T13:16:37Z
date_published: 2017-12-22T00:00:00Z
date_updated: 2024-11-06T08:15:42Z
day: '22'
doi: 10.1007/978-3-319-73117-9_3
extern: '1'
fulldoi: https://doi.org/10.1007/978-3-319-73117-9_3
intvolume: ' 10706'
language:
- iso: eng
month: '12'
oa_version: None
page: 40–44
publication: 44th International Conference on Current Trends in Theory and Practice
of Computer Science
publication_identifier:
eisbn:
- '9783319731179'
isbn:
- '9783319731162'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: The state of the art in dynamic graph algorithms
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 10706
year: '2017'
...
---
_id: '12571'
abstract:
- lang: eng
text: We consider the problems of maintaining approximate maximum matching and minimum
vertex cover in a dynamic graph. Starting with the seminal work of Onak and Rubinfeld
[STOC 2010], this problem has received significant attention in recent years.
Very recently, extending the framework of Baswana, Gupta and Sen [FOCS 2011],
Solomon [FOCS 2016] gave a randomized 2-approximation dynamic algorithm for this
problem that has amortized update time of O(1) with high probability. We consider
the natural open question of derandomizing this result. We present a new deterministic
fully dynamic algorithm that maintains a O(1)-approximate minimum vertex cover
and maximum fractional matching, with an amortized update time of O(1). Previously,
the best deterministic algorithm for this problem was due to Bhattacharya, Henzinger
and Italiano [SODA 2015]; it had an approximation ratio of (2+ϵ) and an amortized
update time of O(logn/ϵ2). Our result can be generalized to give a fully dynamic
O(f3)-approximation algorithm with O(f2) amortized update time for the hypergraph
vertex cover and fractional matching problems, where every hyperedge has at most
f vertices.
alternative_title:
- LNCS
article_processing_charge: No
arxiv: 1
author:
- first_name: Sayan
full_name: Bhattacharya, Sayan
last_name: Bhattacharya
- first_name: Deeparnab
full_name: Chakrabarty, Deeparnab
last_name: Chakrabarty
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
citation:
ama: 'Bhattacharya S, Chakrabarty D, Henzinger M. Deterministic fully dynamic approximate
vertex cover and fractional matching in O(1) amortized update time. In: 19th
International Conference on Integer Programming and Combinatorial Optimization.
Vol 10328. Springer Nature; 2017:86-98. doi:10.1007/978-3-319-59250-3_8'
apa: 'Bhattacharya, S., Chakrabarty, D., & Henzinger, M. (2017). Deterministic
fully dynamic approximate vertex cover and fractional matching in O(1) amortized
update time. In 19th International Conference on Integer Programming and Combinatorial
Optimization (Vol. 10328, pp. 86–98). Waterloo, ON, Canada: Springer Nature.
https://doi.org/10.1007/978-3-319-59250-3_8'
chicago: Bhattacharya, Sayan, Deeparnab Chakrabarty, and Monika Henzinger. “Deterministic
Fully Dynamic Approximate Vertex Cover and Fractional Matching in O(1) Amortized
Update Time.” In 19th International Conference on Integer Programming and Combinatorial
Optimization, 10328:86–98. Springer Nature, 2017. https://doi.org/10.1007/978-3-319-59250-3_8.
ieee: S. Bhattacharya, D. Chakrabarty, and M. Henzinger, “Deterministic fully dynamic
approximate vertex cover and fractional matching in O(1) amortized update time,”
in 19th International Conference on Integer Programming and Combinatorial Optimization,
Waterloo, ON, Canada, 2017, vol. 10328, pp. 86–98.
ista: 'Bhattacharya S, Chakrabarty D, Henzinger M. 2017. Deterministic fully dynamic
approximate vertex cover and fractional matching in O(1) amortized update time.
19th International Conference on Integer Programming and Combinatorial Optimization.
IPCO: Integer Programming and Combinatorial Optimization, LNCS, vol. 10328, 86–98.'
mla: Bhattacharya, Sayan, et al. “Deterministic Fully Dynamic Approximate Vertex
Cover and Fractional Matching in O(1) Amortized Update Time.” 19th International
Conference on Integer Programming and Combinatorial Optimization, vol. 10328,
Springer Nature, 2017, pp. 86–98, doi:10.1007/978-3-319-59250-3_8.
short: S. Bhattacharya, D. Chakrabarty, M. Henzinger, in:, 19th International Conference
on Integer Programming and Combinatorial Optimization, Springer Nature, 2017,
pp. 86–98.
conference:
end_date: 2017-06-28
location: Waterloo, ON, Canada
name: 'IPCO: Integer Programming and Combinatorial Optimization'
start_date: 2017-06-26
date_created: 2023-02-20T07:52:31Z
date_published: 2017-05-24T00:00:00Z
date_updated: 2024-11-06T12:03:44Z
day: '24'
doi: 10.1007/978-3-319-59250-3_8
extern: '1'
external_id:
arxiv:
- '1611.00198'
fulldoi: https://doi.org/10.1007/978-3-319-59250-3_8
intvolume: ' 10328'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1611.00198
month: '05'
oa: 1
oa_version: Preprint
page: 86-98
publication: 19th International Conference on Integer Programming and Combinatorial
Optimization
publication_identifier:
eisbn:
- '9783319592503'
isbn:
- '9783319592497'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Deterministic fully dynamic approximate vertex cover and fractional matching
in O(1) amortized update time
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 10328
year: '2017'
...
---
_id: '13160'
abstract:
- lang: eng
text: "Transforming deterministic ω\r\n-automata into deterministic parity automata
is traditionally done using variants of appearance records. We present a more
efficient variant of this approach, tailored to Rabin automata, and several optimizations
applicable to all appearance records. We compare the methods experimentally and
find out that our method produces smaller automata than previous approaches. Moreover,
the experiments demonstrate the potential of our method for LTL synthesis, using
LTL-to-Rabin translators. It leads to significantly smaller parity automata when
compared to state-of-the-art approaches on complex formulae."
acknowledgement: This work is partially funded by the DFG project “Verified Model
Checkers” and by the Czech Science Foundation, grant No. P202/12/G061.
alternative_title:
- LNCS
article_processing_charge: No
arxiv: 1
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: Clara
full_name: Waldmann, Clara
last_name: Waldmann
- first_name: Maximilian
full_name: Weininger, Maximilian
last_name: Weininger
citation:
ama: 'Kretinsky J, Meggendorfer T, Waldmann C, Weininger M. Index appearance record
for transforming Rabin automata into parity automata. In: Tools and Algorithms
for the Construction and Analysis of Systems. Vol 10205. Springer; 2017:443-460.
doi:10.1007/978-3-662-54577-5_26'
apa: 'Kretinsky, J., Meggendorfer, T., Waldmann, C., & Weininger, M. (2017).
Index appearance record for transforming Rabin automata into parity automata.
In Tools and Algorithms for the Construction and Analysis of Systems (Vol.
10205, pp. 443–460). Uppsala, Sweden: Springer. https://doi.org/10.1007/978-3-662-54577-5_26'
chicago: Kretinsky, Jan, Tobias Meggendorfer, Clara Waldmann, and Maximilian Weininger.
“Index Appearance Record for Transforming Rabin Automata into Parity Automata.”
In Tools and Algorithms for the Construction and Analysis of Systems, 10205:443–60.
Springer, 2017. https://doi.org/10.1007/978-3-662-54577-5_26.
ieee: J. Kretinsky, T. Meggendorfer, C. Waldmann, and M. Weininger, “Index appearance
record for transforming Rabin automata into parity automata,” in Tools and
Algorithms for the Construction and Analysis of Systems, Uppsala, Sweden,
2017, vol. 10205, pp. 443–460.
ista: 'Kretinsky J, Meggendorfer T, Waldmann C, Weininger M. 2017. Index appearance
record for transforming Rabin automata into parity automata. Tools and Algorithms
for the Construction and Analysis of Systems. TACAS: Tools and Algorithms for
the Construction and Analysis of Systems, LNCS, vol. 10205, 443–460.'
mla: Kretinsky, Jan, et al. “Index Appearance Record for Transforming Rabin Automata
into Parity Automata.” Tools and Algorithms for the Construction and Analysis
of Systems, vol. 10205, Springer, 2017, pp. 443–60, doi:10.1007/978-3-662-54577-5_26.
short: J. Kretinsky, T. Meggendorfer, C. Waldmann, M. Weininger, in:, Tools and
Algorithms for the Construction and Analysis of Systems, Springer, 2017, pp. 443–460.
conference:
end_date: 2017-04-29
location: Uppsala, Sweden
name: 'TACAS: Tools and Algorithms for the Construction and Analysis of Systems'
start_date: 2017-04-22
corr_author: '1'
date_created: 2023-06-21T13:21:14Z
date_published: 2017-03-31T00:00:00Z
date_updated: 2025-09-18T10:42:48Z
day: '31'
department:
- _id: KrCh
doi: 10.1007/978-3-662-54577-5_26
external_id:
arxiv:
- '1701.05738'
isi:
- '000440734900026'
fulldoi: https://doi.org/10.1007/978-3-662-54577-5_26
intvolume: ' 10205'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.1701.05738
month: '03'
oa: 1
oa_version: Preprint
page: 443-460
publication: Tools and Algorithms for the Construction and Analysis of Systems
publication_identifier:
eisbn:
- '9783662545775'
eissn:
- 1611-3349
isbn:
- '9783662545768'
issn:
- 0302-9743
publication_status: published
publisher: Springer
quality_controlled: '1'
status: public
title: Index appearance record for transforming Rabin automata into parity automata
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 10205
year: '2017'
...
---
_id: '5801'
abstract:
- lang: eng
text: Space filling circles and spheres have various applications in mathematical
imaging and physical modeling. In this paper, we first show how the thinnest (i.e.,
2-minimal) model of digital sphere can be augmented to a space filling model by
fixing certain “simple voxels” and “filler voxels” associated with it. Based on
elementary number-theoretic properties of such voxels, we design an efficient
incremental algorithm for generation of these space filling spheres with successively
increasing radius. The novelty of the proposed technique is established further
through circular space filling on 3D digital plane. As evident from a preliminary
set of experimental result, this can particularly be useful for parallel computing
of 3D Voronoi diagrams in the digital space.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Shivam
full_name: Dwivedi, Shivam
last_name: Dwivedi
- first_name: Aniket
full_name: Gupta, Aniket
last_name: Gupta
- first_name: Siddhant
full_name: Roy, Siddhant
last_name: Roy
- first_name: Ranita
full_name: Biswas, Ranita
id: 3C2B033E-F248-11E8-B48F-1D18A9856A87
last_name: Biswas
orcid: 0000-0002-5372-7890
- first_name: Partha
full_name: Bhowmick, Partha
last_name: Bhowmick
citation:
ama: 'Dwivedi S, Gupta A, Roy S, Biswas R, Bhowmick P. Fast and Efficient Incremental
Algorithms for Circular and Spherical Propagation in Integer Space. In: 20th
IAPR International Conference. Vol 10502. Cham: Springer Nature; 2017:347-359.
doi:10.1007/978-3-319-66272-5_28'
apa: 'Dwivedi, S., Gupta, A., Roy, S., Biswas, R., & Bhowmick, P. (2017). Fast
and Efficient Incremental Algorithms for Circular and Spherical Propagation in
Integer Space. In 20th IAPR International Conference (Vol. 10502, pp. 347–359).
Cham: Springer Nature. https://doi.org/10.1007/978-3-319-66272-5_28'
chicago: 'Dwivedi, Shivam, Aniket Gupta, Siddhant Roy, Ranita Biswas, and Partha
Bhowmick. “Fast and Efficient Incremental Algorithms for Circular and Spherical
Propagation in Integer Space.” In 20th IAPR International Conference, 10502:347–59.
Cham: Springer Nature, 2017. https://doi.org/10.1007/978-3-319-66272-5_28.'
ieee: S. Dwivedi, A. Gupta, S. Roy, R. Biswas, and P. Bhowmick, “Fast and Efficient
Incremental Algorithms for Circular and Spherical Propagation in Integer Space,”
in 20th IAPR International Conference, Vienna, Austria, 2017, vol. 10502,
pp. 347–359.
ista: 'Dwivedi S, Gupta A, Roy S, Biswas R, Bhowmick P. 2017. Fast and Efficient
Incremental Algorithms for Circular and Spherical Propagation in Integer Space.
20th IAPR International Conference. DGCI: International Conference on Discrete
Geometry for Computer Imagery, LNCS, vol. 10502, 347–359.'
mla: Dwivedi, Shivam, et al. “Fast and Efficient Incremental Algorithms for Circular
and Spherical Propagation in Integer Space.” 20th IAPR International Conference,
vol. 10502, Springer Nature, 2017, pp. 347–59, doi:10.1007/978-3-319-66272-5_28.
short: S. Dwivedi, A. Gupta, S. Roy, R. Biswas, P. Bhowmick, in:, 20th IAPR International
Conference, Springer Nature, Cham, 2017, pp. 347–359.
conference:
end_date: 2017-09-21
location: Vienna, Austria
name: 'DGCI: International Conference on Discrete Geometry for Computer Imagery'
start_date: 2017-09-19
date_created: 2019-01-08T20:42:22Z
date_published: 2017-08-22T00:00:00Z
date_updated: 2022-01-27T15:34:25Z
day: '22'
doi: 10.1007/978-3-319-66272-5_28
extern: '1'
fulldoi: https://doi.org/10.1007/978-3-319-66272-5_28
intvolume: ' 10502'
language:
- iso: eng
month: '08'
oa_version: None
page: 347-359
place: Cham
publication: 20th IAPR International Conference
publication_identifier:
eisbn:
- 978-3-319-66272-5
eissn:
- 1611-3349
isbn:
- 978-3-319-66271-8
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
status: public
title: Fast and Efficient Incremental Algorithms for Circular and Spherical Propagation
in Integer Space
type: conference
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 10502
year: '2017'
...