default search action
Theoretical Computer Science, Volume 714
Volume 714, March 2018
- Koko K. Kayibi, Shariefuddin Pirzada:
T-tetrominoes tiling's Markov chain mixes fast. 1-14 - Jianchang Lai, Yi Mu, Fuchun Guo, Rongmao Chen, Sha Ma:
Efficient k-out-of-n oblivious transfer scheme with the ideal communication cost. 15-26 - Huabin Cao, Bicheng Zhang, Zhiheng Zhou:
One-to-one disjoint path covers in digraphs. 27-35 - Janosch Döcker, Simone Linz:
On the existence of a cherry-picking sequence. 36-50 - Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani:
Drawing subcubic planar graphs with four slopes and optimal angular resolution. 51-73 - Petr Gregor, Torsten Mütze:
Trimming and gluing Gray codes. 74-95
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.