Go to the corresponding LIPIcs Volume Portal 
Diekert, Volker ; Laun, Jürn ; Ushakov, Alexander
pdfformat: 

@InProceedings{diekert_et_al:LIPIcs:2012:3420, author = {Volker Diekert and J{\"u}rn Laun and Alexander Ushakov}, title = {{Efficient algorithms for highly compressed data: The Word Problem in Higman's group is in P}}, booktitle = {29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)}, pages = {218229}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783939897354}, ISSN = {18688969}, year = {2012}, volume = {14}, editor = {Christoph D{\"u}rr and Thomas Wilke}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3420}, URN = {urn:nbn:de:0030drops34204}, doi = {http://dx.doi.org/10.4230/LIPIcs.STACS.2012.218}, annote = {Keywords: Algorithmic group theory, Data structures, Compression, Word Problem} }
Keywords:  Algorithmic group theory, Data structures, Compression, Word Problem  
Seminar:  29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)  
Issue Date:  2012  
Date of publication:  24.02.2012 