activity
20162018
most citedHanabi is NP-hard, Even for Cheaters who Look at Their Cards

2 citations · 2 across the 2 of their papers we have counts for

collaborators
Showing cs.DSShow all

1 paper · 1 filter

cs.DS2017

Experimental Study of Compressed Stack Algorithms in Limited Memory Environments

Jean-François Baffier, Yago Diez, Matias Korman

The {\em compressed stack} is a data structure designed by Barba {\em et al.} (Algorithmica 2015) that allows to reduce the amount of memory needed by an algorithm (at the cost of…