P. Beame, M. Saks, Xiaodong Sun, E. Vee, Proceedings 41st Annual Symposium on Foundations of Computer Science, 2000, 169
Jordan Gergov, “Time–space tradeoffs for integer multiplication on various types of input oblivious sequential machines”, Information Processing Letters, 51, № 5, 1994, 265
Kazuo Iwama, Yasuo Okabe, Toshiro Takase, 2108, Computing and Combinatorics, 2001, 28
Alexander E. Andreev, Juri L. Baskakov, Andrea E. F. Clementi, José D. P. Rolim, 1644, Automata, Languages and Programming, 1999, 179
M. Ajtai, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039), 1999, 60
Pavol Ďuriš, Juraj Hromkovič, Stasys Jukna, Martin Sauerhoff, Georg Schnitger, “On multi-partition communication complexity”, Information and Computation, 194, № 1, 2004, 49
Martin Sauerhoff, Ausgezeichnete Informatikdissertationen 1999, 2000, 203
Xin Li, Yu Zheng, 14422, Computing and Combinatorics, 2024, 29
Nandakishore Santhi, Alexander Vardy, 2006 IEEE International Symposium on Information Theory, 2006, 1490
Stephen Cook, Pierre McKenzie, Dustin Wehr, Mark Braverman, Rahul Santhanam, “Pebbles and Branching Programs for Tree Evaluation”, ACM Trans. Comput. Theory, 3, № 2, 2012, 1