default search action
Theoretical Computer Science, Volume 593
Volume 593, August 2015
- Bruce M. Kapron, Lior Malka, S. Venkatesh:
A framework for non-interactive instance-dependent commitment schemes (NIC). 1-15 - David J. Rosenbaum, Fabian Wagner:
Beating the generator-enumeration bound for p-group isomorphism. 16-25 - Carla Negri Lintzmayer, Guillaume Fertin, Zanoni Dias:
Approximation algorithms for sorting by length-weighted prefix and suffix operations. 26-41 - Jaroslaw Byrka, Andreas Karrenbauer, Laura Sanità:
The interval constrained 3-coloring problem. 42-50 - Sandy Heydrich, Rob van Stee:
Dividing connected chores fairly. 51-61 - Ching-Lueh Chang, Yuh-Dauh Lyuu:
Triggering cascades on strongly connected directed graphs. 62-69 - Minghui Jiang, Pedro J. Tejada, Haitao Wang:
Quell. 70-78 - Gunjan Kumar, Saswata Shannigrahi:
New online algorithm for dynamic speed scaling with sleep state. 79-87 - Florian Greinecker:
On the 2-abelian complexity of the Thue-Morse word. 88-105 - Yuke Huang, Zhiying Wen:
The sequence of return words of the Fibonacci sequence. 106-116 - Peng Zhang, Angsheng Li:
Algorithmic aspects of homophyly of networks. 117-131 - Stephen T. Hedetniemi, David Pokrass Jacobs, K. E. Kennedy:
A theorem of Ore and self-stabilizing algorithms for disjoint minimal dominating sets. 132-138 - Wenming Zhang, E. Zhang, Feifeng Zheng:
Online (J, K)-search problem and its competitive analysis. 139-145 - Mi-Mi Zhang, Jin-Xin Zhou:
On g-extra connectivity of folded hypercubes. 146-153
- Chen Yuan, Haibin Kan:
Revisiting a randomized algorithm for the minimum rainbow subgraph problem. 154-159 - Przemyslaw Gordinowicz:
Planar graph is on fire. 160-164 - Sudip Biswas, Manish Patil, Rahul Shah, Sharma V. Thankachan:
Succinct indexes for reporting discriminating and generic words. 165-173
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.