Information and Computation, Volume 293

Volume 293, August 2023

Selected papers of the 13th International Conference on Security and Cryptography for Networks (SCN 2022)

• 
  Sina Shiehian:
  mrNISC from LWE with polynomial modulus. 105043

Regular papers

• 
  Richard Garner:
  Hypernormalisation in an abstract setting. 105044

Selected papers of the 13th International Conference on Security and Cryptography for Networks (SCN 2022)

• 
  Elena Kirshanova, Alexander May:
  Breaking Goppa-based McEliece with hints. 105045

Regular papers

• 
  Zhaohua Chen, Xiaotie Deng, Wenhan Huang, Hanyu Li, Yuhao Li:
  On tightness of Tsaknakis-Spirakis descent methods for approximate Nash equilibria. 105046
• 
  Antonio Bucciarelli, Delia Kesner, Alejandro Ríos, Andrés Viso:
  The bang calculus revisited. 105047
• 
  Alice Raffaele, Matteo Zavatteri:
  Reducing the number of disjuncts in DTPs. 105048
• 
  Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos:
  Can Romeo and Juliet meet? Or rendezvous games with adversaries on graphs. 105049

Selected papers from TIME 2021, the 28th International Symposium on Temporal Representation and Reasoning

• 
  Alexis Bédard, Sylvain Hallé:
  Formal verification for event stream processing: Model checking of BeepBeep stream processing pipelines. 105058

Regular papers

• 
  Chloé Cachet, Sohaib Ahmad, Luke Demarest, Serena Riback, Ariel Hamlin, Benjamin Fuller:
  Multi random projection inner product encryption, applications to proximity searchable encryption for the iris biometric. 105059

Selected papers of the 13th International Conference on Security and Cryptography for Networks (SCN 2022)

• 
  Chloé Hébant, David Pointcheval:
  Traceable constant-size multi-authority credentials. 105060

Regular papers

• 
  Vera Koponen, Felix Weitkämper:
  Asymptotic elimination of partially continuous aggregation functions in directed graphical models. 105061
• 
  Mo Liu, Anantha Padmanabha, R. Ramanujam, Yanjing Wang:
  Are bundles good deals for first-order modal logic? 105062

Selected papers from TIME 2021, the 28th International Symposium on Temporal Representation and Reasoning

• 
  Luke Hunsberger, Roberto Posenato:
  A faster algorithm for converting simple temporal networks with uncertainty into dispatchable form. 105063

Regular papers

• 
  Jin-Yi Cai, Zhiguo Fu:
  Complexity classification of the eight-vertex model. 105064