---
_id: '688'
abstract:
- lang: eng
  text: 'We show that the framework of topological data analysis can be extended from
    metrics to general Bregman divergences, widening the scope of possible applications.
    Examples are the Kullback - Leibler divergence, which is commonly used for comparing
    text and images, and the Itakura - Saito divergence, popular for speech and sound.
    In particular, we prove that appropriately generalized čech and Delaunay (alpha)
    complexes capture the correct homotopy type, namely that of the corresponding
    union of Bregman balls. Consequently, their filtrations give the correct persistence
    diagram, namely the one generated by the uniformly growing Bregman balls. Moreover,
    we show that unlike the metric setting, the filtration of Vietoris-Rips complexes
    may fail to approximate the persistence diagram. We propose algorithms to compute
    the thus generalized čech, Vietoris-Rips and Delaunay complexes and experimentally
    test their efficiency. Lastly, we explain their surprisingly good performance
    by making a connection with discrete Morse theory. '
alternative_title:
- LIPIcs
author:
- first_name: Herbert
  full_name: Edelsbrunner, Herbert
  id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
  last_name: Edelsbrunner
  orcid: 0000-0002-9823-6833
- first_name: Hubert
  full_name: Wagner, Hubert
  id: 379CA8B8-F248-11E8-B48F-1D18A9856A87
  last_name: Wagner
citation:
  ama: 'Edelsbrunner H, Wagner H. Topological data analysis with Bregman divergences.
    In: Vol 77. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017:391-3916.
    doi:<a href="https://doi.org/10.4230/LIPIcs.SoCG.2017.39">10.4230/LIPIcs.SoCG.2017.39</a>'
  apa: 'Edelsbrunner, H., &#38; Wagner, H. (2017). Topological data analysis with
    Bregman divergences (Vol. 77, pp. 391–3916). Presented at the Symposium on Computational
    Geometry, SoCG, Brisbane, Australia: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
    <a href="https://doi.org/10.4230/LIPIcs.SoCG.2017.39">https://doi.org/10.4230/LIPIcs.SoCG.2017.39</a>'
  chicago: Edelsbrunner, Herbert, and Hubert Wagner. “Topological Data Analysis with
    Bregman Divergences,” 77:391–3916. Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
    2017. <a href="https://doi.org/10.4230/LIPIcs.SoCG.2017.39">https://doi.org/10.4230/LIPIcs.SoCG.2017.39</a>.
  ieee: H. Edelsbrunner and H. Wagner, “Topological data analysis with Bregman divergences,”
    presented at the Symposium on Computational Geometry, SoCG, Brisbane, Australia,
    2017, vol. 77, pp. 391–3916.
  ista: Edelsbrunner H, Wagner H. 2017. Topological data analysis with Bregman divergences.
    Symposium on Computational Geometry, SoCG, LIPIcs, vol. 77, 391–3916.
  mla: Edelsbrunner, Herbert, and Hubert Wagner. <i>Topological Data Analysis with
    Bregman Divergences</i>. Vol. 77, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
    2017, pp. 391–3916, doi:<a href="https://doi.org/10.4230/LIPIcs.SoCG.2017.39">10.4230/LIPIcs.SoCG.2017.39</a>.
  short: H. Edelsbrunner, H. Wagner, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
    2017, pp. 391–3916.
conference:
  end_date: 2017-07-07
  location: Brisbane, Australia
  name: Symposium on Computational Geometry, SoCG
  start_date: 2017-07-04
date_created: 2018-12-11T11:47:56Z
date_published: 2017-06-01T00:00:00Z
date_updated: 2021-01-12T08:09:26Z
day: '01'
ddc:
- '514'
- '516'
department:
- _id: HeEd
- _id: UlWa
doi: 10.4230/LIPIcs.SoCG.2017.39
file:
- access_level: open_access
  checksum: 067ab0cb3f962bae6c3af6bf0094e0f3
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T10:11:03Z
  date_updated: 2020-07-14T12:47:42Z
  file_id: '4856'
  file_name: IST-2017-895-v1+1_LIPIcs-SoCG-2017-39.pdf
  file_size: 990546
  relation: main_file
file_date_updated: 2020-07-14T12:47:42Z
has_accepted_license: '1'
intvolume: '        77'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: 391-3916
publication_identifier:
  issn:
  - '18688969'
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '7021'
pubrep_id: '895'
quality_controlled: '1'
scopus_import: 1
status: public
title: Topological data analysis with Bregman divergences
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: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 77
year: '2017'
...
---
_id: '697'
abstract:
- lang: eng
  text: 'De, Trevisan and Tulsiani [CRYPTO 2010] show that every distribution over
    n-bit strings which has constant statistical distance to uniform (e.g., the output
    of a pseudorandom generator mapping n-1 to n bit strings), can be distinguished
    from the uniform distribution with advantage epsilon by a circuit of size O( 2^n
    epsilon^2). We generalize this result, showing that a distribution which has less
    than k bits of min-entropy, can be distinguished from any distribution with k
    bits of delta-smooth min-entropy with advantage epsilon by a circuit of size O(2^k
    epsilon^2/delta^2). As a special case, this implies that any distribution with
    support at most 2^k (e.g., the output of a pseudoentropy generator mapping k to
    n bit strings) can be distinguished from any given distribution with min-entropy
    k+1 with advantage epsilon by a circuit of size O(2^k epsilon^2). Our result thus
    shows that pseudoentropy distributions face basically the same non-uniform attacks
    as pseudorandom distributions. '
alternative_title:
- LIPIcs
article_number: '39'
author:
- 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: Maciej
  full_name: Skórski, Maciej
  id: EC09FA6A-02D0-11E9-8223-86B7C91467DD
  last_name: Skórski
citation:
  ama: 'Pietrzak KZ, Skórski M. Non uniform attacks against pseudoentropy. In: Vol
    80. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:<a href="https://doi.org/10.4230/LIPIcs.ICALP.2017.39">10.4230/LIPIcs.ICALP.2017.39</a>'
  apa: 'Pietrzak, K. Z., &#38; Skórski, M. (2017). Non uniform attacks against pseudoentropy
    (Vol. 80). Presented at the ICALP: International Colloquium on Automata, Languages,
    and Programming, Warsaw, Poland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
    <a href="https://doi.org/10.4230/LIPIcs.ICALP.2017.39">https://doi.org/10.4230/LIPIcs.ICALP.2017.39</a>'
  chicago: Pietrzak, Krzysztof Z, and Maciej Skórski. “Non Uniform Attacks against
    Pseudoentropy,” Vol. 80. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.
    <a href="https://doi.org/10.4230/LIPIcs.ICALP.2017.39">https://doi.org/10.4230/LIPIcs.ICALP.2017.39</a>.
  ieee: 'K. Z. Pietrzak and M. Skórski, “Non uniform attacks against pseudoentropy,”
    presented at the ICALP: International Colloquium on Automata, Languages, and Programming,
    Warsaw, Poland, 2017, vol. 80.'
  ista: 'Pietrzak KZ, Skórski M. 2017. Non uniform attacks against pseudoentropy.
    ICALP: International Colloquium on Automata, Languages, and Programming, LIPIcs,
    vol. 80, 39.'
  mla: Pietrzak, Krzysztof Z., and Maciej Skórski. <i>Non Uniform Attacks against
    Pseudoentropy</i>. Vol. 80, 39, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
    2017, doi:<a href="https://doi.org/10.4230/LIPIcs.ICALP.2017.39">10.4230/LIPIcs.ICALP.2017.39</a>.
  short: K.Z. Pietrzak, M. Skórski, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
    2017.
conference:
  end_date: 2017-07-14
  location: Warsaw, Poland
  name: 'ICALP: International Colloquium on Automata, Languages, and Programming'
  start_date: 2017-07-10
date_created: 2018-12-11T11:47:59Z
date_published: 2017-07-01T00:00:00Z
date_updated: 2021-01-12T08:11:15Z
day: '01'
ddc:
- '005'
department:
- _id: KrPi
doi: 10.4230/LIPIcs.ICALP.2017.39
ec_funded: 1
file:
- access_level: open_access
  checksum: e95618a001692f1af2d68f5fde43bc1f
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T10:08:40Z
  date_updated: 2020-07-14T12:47:46Z
  file_id: '4701'
  file_name: IST-2017-893-v1+1_LIPIcs-ICALP-2017-39.pdf
  file_size: 601004
  relation: main_file
file_date_updated: 2020-07-14T12:47:46Z
has_accepted_license: '1'
intvolume: '        80'
language:
- iso: eng
month: '07'
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_identifier:
  issn:
  - '18688969'
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '7003'
pubrep_id: '893'
quality_controlled: '1'
scopus_import: 1
status: public
title: Non uniform attacks against pseudoentropy
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: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 80
year: '2017'
...
---
_id: '710'
abstract:
- lang: eng
  text: 'We revisit the problem of estimating entropy of discrete distributions from
    independent samples, studied recently by Acharya, Orlitsky, Suresh and Tyagi (SODA
    2015), improving their upper and lower bounds on the necessary sample size n.
    For estimating Renyi entropy of order alpha, up to constant accuracy and error
    probability, we show the following * Upper bounds n = O(1) 2^{(1-1/alpha)H_alpha}
    for integer alpha&gt;1, as the worst case over distributions with Renyi entropy
    equal to H_alpha. * Lower bounds n = Omega(1) K^{1-1/alpha} for any real alpha&gt;1,
    with the constant being an inverse polynomial of the accuracy, as the worst case
    over all distributions on K elements. Our upper bounds essentially replace the
    alphabet size by a factor exponential in the entropy, which offers improvements
    especially in low or medium entropy regimes (interesting for example in anomaly
    detection). As for the lower bounds, our proof explicitly shows how the complexity
    depends on both alphabet and accuracy, partially solving the open problem posted
    in previous works. The argument for upper bounds derives a clean identity for
    the variance of falling-power sum of a multinomial distribution. Our approach
    for lower bounds utilizes convex optimization to find a distribution with possibly
    worse estimation performance, and may be of independent interest as a tool to
    work with Le Cam’s two point method. '
alternative_title:
- LIPIcs
article_number: '20'
author:
- first_name: Maciej
  full_name: Obremski, Maciej
  last_name: Obremski
- first_name: Maciej
  full_name: Skórski, Maciej
  id: EC09FA6A-02D0-11E9-8223-86B7C91467DD
  last_name: Skórski
citation:
  ama: 'Obremski M, Skórski M. Renyi entropy estimation revisited. In: Vol 81. Schloss
    Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:<a href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.20">10.4230/LIPIcs.APPROX-RANDOM.2017.20</a>'
  apa: 'Obremski, M., &#38; Skórski, M. (2017). Renyi entropy estimation revisited
    (Vol. 81). Presented at the 20th International Workshop on Approximation Algorithms
    for Combinatorial Optimization Problems, APPROX, Berkeley, USA: Schloss Dagstuhl
    - Leibniz-Zentrum für Informatik. <a href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.20">https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.20</a>'
  chicago: Obremski, Maciej, and Maciej Skórski. “Renyi Entropy Estimation Revisited,”
    Vol. 81. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. <a href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.20">https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.20</a>.
  ieee: M. Obremski and M. Skórski, “Renyi entropy estimation revisited,” presented
    at the 20th International Workshop on Approximation Algorithms for Combinatorial
    Optimization Problems, APPROX, Berkeley, USA, 2017, vol. 81.
  ista: Obremski M, Skórski M. 2017. Renyi entropy estimation revisited. 20th International
    Workshop on Approximation Algorithms for Combinatorial Optimization Problems,
    APPROX, LIPIcs, vol. 81, 20.
  mla: Obremski, Maciej, and Maciej Skórski. <i>Renyi Entropy Estimation Revisited</i>.
    Vol. 81, 20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:<a href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.20">10.4230/LIPIcs.APPROX-RANDOM.2017.20</a>.
  short: M. Obremski, M. Skórski, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
    2017.
conference:
  end_date: 2017-08-18
  location: Berkeley, USA
  name: 20th International Workshop on Approximation Algorithms for Combinatorial
    Optimization Problems, APPROX
  start_date: 2017-08-18
date_created: 2018-12-11T11:48:04Z
date_published: 2017-08-01T00:00:00Z
date_updated: 2021-01-12T08:11:50Z
day: '01'
ddc:
- '005'
- '600'
department:
- _id: KrPi
doi: 10.4230/LIPIcs.APPROX-RANDOM.2017.20
ec_funded: 1
file:
- access_level: open_access
  checksum: 89225c7dcec2c93838458c9102858985
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T10:13:10Z
  date_updated: 2020-07-14T12:47:49Z
  file_id: '4991'
  file_name: IST-2017-888-v1+1_LIPIcs-APPROX-RANDOM-2017-20.pdf
  file_size: 604813
  relation: main_file
file_date_updated: 2020-07-14T12:47:49Z
has_accepted_license: '1'
intvolume: '        81'
language:
- iso: eng
month: '08'
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_identifier:
  issn:
  - '18688969'
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '6979'
pubrep_id: '888'
quality_controlled: '1'
scopus_import: 1
status: public
title: Renyi entropy estimation revisited
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: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 81
year: '2017'
...
---
_id: '711'
abstract:
- lang: eng
  text: Nested weighted automata (NWA) present a robust and convenient automata-theoretic
    formalism for quantitative specifications. Previous works have considered NWA
    that processed input words only in the forward direction. It is natural to allow
    the automata to process input words backwards as well, for example, to measure
    the maximal or average time between a response and the preceding request. We therefore
    introduce and study bidirectional NWA that can process input words in both directions.
    First, we show that bidirectional NWA can express interesting quantitative properties
    that are not expressible by forward-only NWA. Second, for the fundamental decision
    problems of emptiness and universality, we establish decidability and complexity
    results for the new framework which match the best-known results for the special
    case of forward-only NWA. Thus, for NWA, the increased expressiveness of bidirectionality
    is achieved at no additional computational complexity. This is in stark contrast
    to the unweighted case, where bidirectional finite automata are no more expressive
    but exponentially more succinct than their forward-only counterparts.
alternative_title:
- LIPIcs
article_number: '5'
author:
- first_name: Krishnendu
  full_name: Chatterjee, Krishnendu
  id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
  last_name: Chatterjee
  orcid: 0000-0002-4561-241X
- 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: Jan
  full_name: Otop, Jan
  last_name: Otop
citation:
  ama: 'Chatterjee K, Henzinger TA, Otop J. Bidirectional nested weighted automata.
    In: Vol 85. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:<a href="https://doi.org/10.4230/LIPIcs.CONCUR.2017.5">10.4230/LIPIcs.CONCUR.2017.5</a>'
  apa: 'Chatterjee, K., Henzinger, T. A., &#38; Otop, J. (2017). Bidirectional nested
    weighted automata (Vol. 85). Presented at the 28th International Conference on
    Concurrency Theory, CONCUR, Berlin, Germany: Schloss Dagstuhl - Leibniz-Zentrum
    für Informatik. <a href="https://doi.org/10.4230/LIPIcs.CONCUR.2017.5">https://doi.org/10.4230/LIPIcs.CONCUR.2017.5</a>'
  chicago: Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Bidirectional
    Nested Weighted Automata,” Vol. 85. Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
    2017. <a href="https://doi.org/10.4230/LIPIcs.CONCUR.2017.5">https://doi.org/10.4230/LIPIcs.CONCUR.2017.5</a>.
  ieee: K. Chatterjee, T. A. Henzinger, and J. Otop, “Bidirectional nested weighted
    automata,” presented at the 28th International Conference on Concurrency Theory,
    CONCUR, Berlin, Germany, 2017, vol. 85.
  ista: Chatterjee K, Henzinger TA, Otop J. 2017. Bidirectional nested weighted automata.
    28th International Conference on Concurrency Theory, CONCUR, LIPIcs, vol. 85,
    5.
  mla: Chatterjee, Krishnendu, et al. <i>Bidirectional Nested Weighted Automata</i>.
    Vol. 85, 5, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:<a href="https://doi.org/10.4230/LIPIcs.CONCUR.2017.5">10.4230/LIPIcs.CONCUR.2017.5</a>.
  short: K. Chatterjee, T.A. Henzinger, J. Otop, in:, Schloss Dagstuhl - Leibniz-Zentrum
    für Informatik, 2017.
conference:
  end_date: 2017-09-08
  location: Berlin, Germany
  name: 28th International Conference on Concurrency Theory, CONCUR
  start_date: 2017-09-05
date_created: 2018-12-11T11:48:04Z
date_published: 2017-08-01T00:00:00Z
date_updated: 2021-01-12T08:11:53Z
day: '01'
ddc:
- '004'
- '005'
department:
- _id: KrCh
- _id: ToHe
doi: 10.4230/LIPIcs.CONCUR.2017.5
file:
- access_level: open_access
  checksum: d2bda4783821a6358333fe27f11f4737
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T10:08:02Z
  date_updated: 2020-07-14T12:47:49Z
  file_id: '4661'
  file_name: IST-2017-886-v1+1_LIPIcs-CONCUR-2017-5.pdf
  file_size: 570294
  relation: main_file
file_date_updated: 2020-07-14T12:47:49Z
has_accepted_license: '1'
intvolume: '        85'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
publication_identifier:
  issn:
  - '18688969'
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '6976'
pubrep_id: '886'
quality_controlled: '1'
scopus_import: 1
status: public
title: Bidirectional nested weighted automata
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: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 85
year: '2017'
...
---
_id: '963'
abstract:
- lang: eng
  text: 'Network games are widely used as a model for selfish resource-allocation
    problems. In the classical model, each player selects a path connecting her source
    and target vertex. The cost of traversing an edge depends on the number of players
    that traverse it. Thus, it abstracts the fact that different users may use a resource
    at different times and for different durations, which plays an important role
    in defining the costs of the users in reality. For example, when transmitting
    packets in a communication network, routing traffic in a road network, or processing
    a task in a production system, the traversal of the network involves an inherent
    delay, and so sharing and congestion of resources crucially depends on time. We
    study timed network games , which add a time component to network games. Each
    vertex v in the network is associated with a cost function, mapping the load on
    v to the price that a player pays for staying in v for one time unit with this
    load. In addition, each edge has a guard, describing time intervals in which the
    edge can be traversed, forcing the players to spend time on vertices. Unlike earlier
    work that add a time component to network games, the time in our model is continuous
    and cannot be discretized. In particular, players have uncountably many strategies,
    and a game may have uncountably many pure Nash equilibria. We study properties
    of timed network games with cost-sharing or congestion cost functions: their stability,
    equilibrium inefficiency, and complexity. In particular, we show that the answer
    to the question whether we can restrict attention to boundary strategies, namely
    ones in which edges are traversed only at the boundaries of guards, is mixed. '
alternative_title:
- LIPIcs
article_number: '37'
author:
- first_name: Guy
  full_name: Avni, Guy
  id: 463C8BC2-F248-11E8-B48F-1D18A9856A87
  last_name: Avni
  orcid: 0000-0001-5588-8287
- first_name: Shibashis
  full_name: Guha, Shibashis
  last_name: Guha
- first_name: Orna
  full_name: Kupferman, Orna
  last_name: Kupferman
citation:
  ama: 'Avni G, Guha S, Kupferman O. Timed network games with clocks. In: Vol 83.
    Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:<a href="https://doi.org/10.4230/LIPIcs.MFCS.2017.37">10.4230/LIPIcs.MFCS.2017.37</a>'
  apa: 'Avni, G., Guha, S., &#38; Kupferman, O. (2017). Timed network games with clocks
    (Vol. 83). Presented at the MFCS: Mathematical Foundations of Computer Science
    (SG), Aalborg, Denmark: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a
    href="https://doi.org/10.4230/LIPIcs.MFCS.2017.37">https://doi.org/10.4230/LIPIcs.MFCS.2017.37</a>'
  chicago: Avni, Guy, Shibashis Guha, and Orna Kupferman. “Timed Network Games with
    Clocks,” Vol. 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. <a
    href="https://doi.org/10.4230/LIPIcs.MFCS.2017.37">https://doi.org/10.4230/LIPIcs.MFCS.2017.37</a>.
  ieee: 'G. Avni, S. Guha, and O. Kupferman, “Timed network games with clocks,” presented
    at the MFCS: Mathematical Foundations of Computer Science (SG), Aalborg, Denmark,
    2017, vol. 83.'
  ista: 'Avni G, Guha S, Kupferman O. 2017. Timed network games with clocks. MFCS:
    Mathematical Foundations of Computer Science (SG), LIPIcs, vol. 83, 37.'
  mla: Avni, Guy, et al. <i>Timed Network Games with Clocks</i>. Vol. 83, 37, Schloss
    Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:<a href="https://doi.org/10.4230/LIPIcs.MFCS.2017.37">10.4230/LIPIcs.MFCS.2017.37</a>.
  short: G. Avni, S. Guha, O. Kupferman, in:, Schloss Dagstuhl - Leibniz-Zentrum für
    Informatik, 2017.
conference:
  end_date: 2017-08-25
  location: Aalborg, Denmark
  name: 'MFCS: Mathematical Foundations of Computer Science (SG)'
  start_date: 2017-08-21
date_created: 2018-12-11T11:49:26Z
date_published: 2017-06-01T00:00:00Z
date_updated: 2023-02-23T12:35:50Z
day: '01'
ddc:
- '004'
department:
- _id: ToHe
doi: 10.4230/LIPIcs.MFCS.2017.37
file:
- access_level: open_access
  checksum: f55eaf7f3c36ea07801112acfedd17d5
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T10:14:10Z
  date_updated: 2020-07-14T12:48:18Z
  file_id: '5059'
  file_name: IST-2017-829-v1+1_mfcs-cr.pdf
  file_size: 369730
  relation: main_file
file_date_updated: 2020-07-14T12:48:18Z
has_accepted_license: '1'
intvolume: '        83'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
project:
- _id: 25F5A88A-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: S11402-N23
  name: Moderne Concurrency Paradigms
publication_identifier:
  issn:
  - '18688969'
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '6438'
pubrep_id: '829'
quality_controlled: '1'
related_material:
  record:
  - id: '6005'
    relation: later_version
    status: public
scopus_import: 1
status: public
title: Timed network games with clocks
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: 83
year: '2017'
...