


default search action
Theoretical Computer Science, Volume 841
Volume 841, November 2020
- Yijie Li, Shuguang Li:

Scheduling jobs with sizes and delivery times on identical parallel batch machines. 1-9 - Gerth Stølting Brodal

, Spyros Sioutas, Konstantinos Tsakalidis, Kostas Tsichlas:
Fully persistent B-trees. 10-26 - Zhong Huang, Xueliang Li:

Hardness results for three kinds of colored connections of graphs. 27-38 - Franz J. Brandenburg:

On fan-crossing graphs. 39-49 - David Ilcinkas, Ahmed Mouhamadou Wade:

Exploration of carrier-based time-varying networks: The power of waiting. 50-61 - Kaichi Suzuki, Atsushi Takayasu

, Noboru Kunihiro:
Extended partial key exposure attacks on RSA: Improvement up to full size decryption exponents. 62-83 - Gail Gilboa-Freedman, Rann Smorodinsky:

On the behavioral implications of differential privacy. 84-93 - Georgios Amanatidis

, Evangelos Markakis, Apostolos Ntokos:
Multiple birds with one stone: Beating 1/2 for EFX and GMMS via envy cycle elimination. 94-109 - Maria Kyropoulou, Warut Suksompong, Alexandros A. Voudouris

:
Almost envy-freeness in group resource allocation. 110-123 - Bart M. P. Jansen, Astrid Pieterse:

Polynomial kernels for hitting forbidden minors under structural parameterizations. 124-166 - Yuval Emek

, Shay Kutten, Ron Lavi
, Yangguang Shi:
Bayesian generalized network design. 167-185 - Sherry H. F. Yan, Yao Yu:

Pattern-avoiding inversion sequences and open partition diagrams. 186-197

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.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














