Memoryless computation: New results, constructions, and extensions

@article{Gadouleau2015MemorylessCN,
  title={Memoryless computation: New results, constructions, and extensions},
  author={Maximilien Gadouleau and S\oren Riis},
  journal={Theor. Comput. Sci.},
  year={2015},
  volume={562},
  pages={129-145}
}
In this paper, we are interested in memoryless computation, a modern paradigm to compute functions which generalises the famous XOR swap algorithm to exchange the contents of two variables without using a buffer. In memoryless computation, programs are only allowed to update one variable at a time. We first consider programs which do not use any memory. We study the maximum and average number of updates required to compute functions without memory. We then derive the exact number of… CONTINUE READING
Recent Discussions
This paper has been referenced on Twitter 4 times over the past 90 days. VIEW TWEETS
7 Citations
19 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 19 references

Mazorchuk, Classical finite transformation semigroups: An introduction

  • Olexandr Ganyushkin, Volodymyr
  • Algebra and Applications,
  • 2009
1 Excerpt

Graph theory

  • J. A. Bondy, U.S.R. Murty
  • Graduate Texts in Mathematics, vol. 244, Springer
  • 2008
2 Excerpts

Kschischang , Coding for errors and erasures in random network coding

  • Ralf Kötter, R. Frank
  • IEEE Transactions on Information Theory
  • 2004

The mathematical theory of nonblocking switching networks

  • F. K. Hwang
  • World Scientific Publishing Co.
  • 2004
2 Excerpts

Similar Papers

Loading similar papers…