Please log in to take part in the discussion (add own reviews or comments).
Cite this publication
More citation styles
- please select -
%0 Conference Paper
%1 diekert2015amenability
%A Diekert, Volker
%A Myasnikov, Alexei G.
%A Weiß, Armin
%B ISSAC'15 : proceedings of the 40th International Symposium on Symbolic and Algebraic Computation
%C New York, NY
%D 2015
%E Yokoyama, Kazuhiro
%E Linton, Steve
%E Robertz, Daniel
%I ACM
%K
%P 141-148
%R 10.1145/2755996.2756644
%T Amenability of Schreier graphs and strongly generic algorithms for the conjugacy problem
%@ 978-1-4503-3435-8
@inproceedings{diekert2015amenability,
added-at = {2023-08-31T16:35:09.000+0200},
address = {New York, NY},
author = {Diekert, Volker and Myasnikov, Alexei G. and Weiß, Armin},
biburl = {https://puma.ub.uni-stuttgart.de/bibtex/27acc5396a1f6b98fad0beb040a3c2985/puma-wartung},
booktitle = {ISSAC'15 : proceedings of the 40th International Symposium on Symbolic and Algebraic Computation},
doi = {10.1145/2755996.2756644},
editor = {Yokoyama, Kazuhiro and Linton, Steve and Robertz, Daniel},
eventdate = {2015-07-06/2015-06-09},
eventtitle = {40th International Symposium on Symbolic and Algebraic Computation},
interhash = {d14e913e29c0470017792a0454b0aee1},
intrahash = {7acc5396a1f6b98fad0beb040a3c2985},
isbn = {978-1-4503-3435-8},
keywords = {},
language = {eng},
pages = {141-148},
publisher = {ACM},
timestamp = {2023-08-31T14:35:09.000+0200},
title = {Amenability of Schreier graphs and strongly generic algorithms for the conjugacy problem},
venue = {Bath, United Kingdom},
year = 2015
}