default search action
Theoretical Computer Science, Volume 895
Volume 895, December 2021
- Neeldhara Misra, Harshil Mittal:
Imbalance parameterized by twin cover revisited. 1-15 - Andrea Clementi, Emanuele Natale, Isabella Ziccardi:
Parallel Load Balancing on constrained client-server topologies. 16-33 - Ugo Dal Lago, Francesco Gavazzo:
Differential logical relations, part II increments and derivatives. 34-47 - Daniel Silva Graça, Ning Zhong:
The set of hyperbolic equilibria and of invertible zeros on the unit ball is computable. 48-54 - Ioana O. Bercea, Guy Even:
Upper tail analysis of bucket sort and random tries. 55-67 - Bi Li, Jingfen Lan, Wantao Ning, Yongcui Tian, Xin Zhang, Qiang Zhu:
h-extra r-component connectivity of interconnection networks with application to hypercubes. 68-74 - Steven Chaplick, Magnús M. Halldórsson, Murilo S. de Lima, Tigran Tonoyan:
Query minimization under stochastic uncertainty. 75-95 - Frank Fuhlbrück, Johannes Köbler, Ilia Ponomarenko, Oleg Verbitsky:
The Weisfeiler-Leman algorithm and recognition of graph properties. 96-114 - Suthee Ruangwises, Toshiya Itoh:
Physical zero-knowledge proof for Ripple Effect. 115-123 - Sayan Bandyapadhyay, Aritra Banik, Sujoy Bhore, Martin Nöllenburg:
Geometric planar networks on bichromatic collinear points. 124-136 - Janka Chlebíková, Clément Dallard:
Colourful components in k-caterpillars and planar graphs. 137-150 - Vincenzo Auletta, Diodato Ferraioli, Ashutosh Rai, Giannicola Scarpa, Andreas J. Winter:
Belief-invariant and quantum equilibria in games of incomplete information. 151-177 - Olivier Blazy, Laura Brouilhet, Céline Chevalier, Patrick Towa, Ida Tucker, Damien Vergnaud:
Hardware security without secure hardware: How to decrypt with a password and a server. 178-211
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.