[1] R. P. Agarwal . Difference Equations and Inequalities. Marcel Dekker, New York. 2000.

[2] M. Agrawal, N. Kayal, N. Saxena. PRIMES is in P. Annals of Mathematics. 160(2). 2004. 781–793.

[3] M. Agrawal, N. Kayal, N. Saxena. PRIMES is in P. . 2002.

[4] R. Ahlswede, B. Balkenhol, L. Khachatrian. Some properties of fix-free codes, In Proceedings of the 1st International Seminarium on Coding Theory and Combinatorics. 1996 (Thahkadzor, Armenia). 20–23.

[5] A. V. Aho, J. D. Ullman . The Theory of Parsing, Translation and Compiling Vol. I.. Prentice-Hall. 1972.

[6] A. V. Aho, J. D. Ullman . The Theory of Parsing, Translation and Compiling Vol. II.. Prentice-Hall. 1973.

[7] A. V. Aho, R. Sethi, J. D. Ullman . Compilers, Principles, Techniques and Tools. Addison-Wesley. 1986.

[8] M. Ajtai . The Shortest Vector Problem in is NP-hard for Randomized Reduction, In Proceedings of the 30th Annual ACM Symposium on Theory of Computing. 1998. 10–18.

[9] M. Ajtai, J. Komlós, E. Szemerédi . Sorting in parallel steps. Combinatorica . 3(1). 1983. 1–19.

[10] A. G. Akritas. Elements of Computer Algebra with Applications. John Wiley & Sons. 1989.

[11] S. Albers, H. Bals. Dynamic TCP acknowledgement, penalizing long delays, In Proceedings of the 25th ACM-SIAM Symposium on Discrete Algorithms. Volume. 2003. 47–55.

[12] V. Arvind, P. Kurur. Graph isomorphism is in SPP, In Proceedings of the 43rd IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press. 2002. 743–750.

[13] J. Aspnes, Y. Azar, A. Fiat, S. Plotkin, O. Waarts. On-line load balancing with applications to machine scheduling and virtual circuit routing. Journal of the ACM . 44. 1997. 486–504.

[14] A. Asteroth, C. Christel. Theoretische Informatik. Pearson Studium. 2002.

[15] J-P. Aubin. Mathematical Methods of Game and Economic Theory. North-Holland . 1979.

[16] B. Awerbuch, Y. Azar, S. Plotkin . Throughput-competitive online routing, In Proceedings of the 34th Annual Symposium on Foundations of Computer Science. 1993. 32–40.

[17] Y. Azar . On-line load balancing, Lecture Notes in Computer Science . Springer-Verlag. 1442. 1998. 178–195.

[18] L. Babai . Trading group theory for randomness, In Proceedings of the 17th ACM Symposium on Theory of Computing. ACM Press. 1985. 421–429.

[19] L. Babai, S. Moran. Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes. Journal of Computer and Systems Sciences. 36(2). 1988. 254–276.

[20] B. S. Baker, J. S. Schwartz. Shelf algorithms for two dimensional packing problems. SIAM Journal on Computing. 12. 1983. 508–525.

[21] B. Balkenhol, S. Kurtz. Universal data compression based on the Burrows-Wheeler transform: theory and practice. IEEE Transactions on Computers. 49(10). 2000. 1043–1053–953.

[22] Á. Balogh, A. Iványi . Memory Management, In A. Iványi (Ed.) Algorithms of Informatics. Mondat Kiadó. 2. 2007. 799–850.

[23] R. Barett, M. Berry, T. F. Chan, J. Demmel, J. Donato, J. Dongarra, V. Eijkhout, R. Pozzo, C. Romine, H. van der Vorst. Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods. SIAM . 1994.

[24] S. Batterson. Convergence of the shifted QR algorithm on normal matrices. Numerische Mathematik. 58. 1990. 341–352.

[25] T. C. Bell, I. H. Witten, J. G. Cleary. Modeling for text compression. Communications of the ACM . 21. 1989. 557–591.

[26] T. C. Bell, I. H. Witten, J. G. Cleary. Text Compression. Prentice Hall. 1990.

[27] E. Bender, R. Canfield. The asymptotic number of labeled graphs with given degree sequences. Combinatorial Theory Series A. 24. 1978. 296–307.

[28] A. Beygelzimer, L. A. Hemaspaandra, C. Homan, J. Rothe . One-way functions in worst-case cryptography: Algebraic and security properties are on the house. SIGACT News. 30(4). 1999. 25–40.

[29] D. Boneh . Twenty years of attacks on the RSA cryptosystem. Notices of the AMS . 46(2). 1999. 203–213.

[30] B. Borchert, L. A. Hemaspaandra, J. Rothe . Restrictive acceptance suffices for equivalence problems. London Mathematical Society Journal of Computation and Mathematics. 86. 2000. 86–95.

[31] A. Borodin, R. El-Yaniv . Online computation and competitive analysis. University Press. 1998.

[32] J. G. Brookshear . Theory of Computation - Formal Langauges, Automata, and Complexity. The Benjamin/Cummings Publishing Company. 1989.

[33] L. E. J. Brouwer. Über Abbildung von Manningfaltigkeiten. Mathematische Annalen. 82(3-4). 1921. 286–292.

[34] T. Brueggemann, W. Kern. An Improved Deterministic Local Search Algorithm for 3-SAT. Theoretical Computer Science. 329(1-3). 2004. 303–313.

[35] B. Buchberger. Ein Algorithmus zum Auffinden der Basiselemente des Restklassenringes nach einem nulldimensionalen Polynomidealitle. PhD dissertation, Leopold-Franzens-Universität, Innsbruc. 1965.

[36] M. Burrows, D. J. Wheeler. A block-sorting lossless data compression algorithm. Research Report 124, . 1994.

[37] Calgary . The Calgary/Canterbury Text Compression. . 2004.

[38] Canterbury . The Canterbury Corpus. . 2004.

[39] M. Capalbo, O. Reingold, S. Vadhan, A. Widgerson. Randomness conductors and constant-degree lossless expanders, In Proceedings of the 34th ACM Symposium on Theory of Computing. IEEE Computer Society. 2001. 443–452.

[40] J. Carroll, D. Long . Theory of Finite Automata. Prentice Hall, Englewood Cliffs, New Jersey. 1989.

[41] J. L. Carter, M. N. Wegman. Universal Classes of Hash Functions. Journal of Computer and System Sciences. 18(2). 1979. 143–154.

[42] B. F. Caviness. Computer algebra: past and future. Journal of Symbolic Computations. 2. 1986. 217–263.

[43] Y. Cho, S. Sahni . Bounds for list schedules on uniform processors. SIAM Journal on Computing. 9(1). 1980. 91–103.

[44] S. M. Christensen. Resources for Computer Algebra. Computers in Physics . 8. 1984. 308–315.

[45] M. Chrobak, H. J. Karloff, T. Payne, S. Vishwanathan . New results on the server problem. SIAM Journal on Discrete Mathematics. 4. 1991. 172–181.

[46] M. Chrobak, L. Larmore . An optimal algorithm for -servers on trees. SIAM Journal on Computing. 20. 1991. 144–148.

[47] M. Chrobak, L. Larmore . The server problem and on-line games, DIMACS Series in Discrete Mathematics and Theoretical Computer Science. American Mathematical Society. 7. 1992. 11–64.

[48] E. Coffman . Computer and Job Shop Scheduling. John Wiley & Sons. 1976.

[49] A. M. Cohen . Computer Algebra for Industry: Problem Solving in Practice. John Wiley & Sons. 1993.

[50] A. M. Cohen, L. van Gasten, S. Lunel. Computer Algebra for Industry 2, Problem Solving in Practice. John Wiley & Sons. 1995.

[51] S. Cook. The Complexity of Theorem Proving Procedures, In Proceedings of the 3th Annual ACM Symposium on Theory of Computing. ACM Press. 1971. 151–158.

[52] K. D. Cooper, L. Torczon. Engineering a Compiler. Morgan Kaufman Publisher. 2004.

[53] D. Coppersmith . Small solutions to polynomial equations, and low exponent RSA vulnerabilities. Journal of Cryptology. 10(4). 1997. 233–260.

[54] T. H. Cormen, C. E. Leiserson, R. L. Rivest, C. Stein . Introduction to Algorithms (3rd edition, second corrected printing). The MIT Press/McGraw-Hill. 2010.

[55] T. M. Cover, J. A. Thomas. Elements of Information Theory. John Wiley & Sons. 1991.

[56] J. Csirik, G. Woeginger . On-line packing and covering problems, Lecture Notes in Computer Science . Springer-Verlag. 1442. 1998. 147–177.

[57] J. Csirik, G. J. Woeginger . Shelf algorithms for on-line strip packing. Information Processing Letters. 63. 1997. 171–175.

[58] I. Csiszár, J. Körner. Coding Theorems for Discrete Memoryless Systems. Akadémiai Kiadó. 1981.

[59] E. Dantsin, A. Goerdt, R. Kannan, J. Kleinberg, C. Papadimitriou, P. Raghavan, U. Schöning . A deterministic algorithm for -SAT based on local search. Theoretical Computer Science. 289(1). 2002. 69–83.

[60] J. Davenport, Y. Siret, E. Tournier. Computer Algebra: Systems and Algorithms for Algebraic Computation. Academic Press. 2000.

[61] J. Demmel, D. Malajovich. On the complexity of computing error bounds. Foundations of Computational Mathematics. 1. 2001. 101–125.

[62] R. Dobrushin, S. Ortyukov. Lower bound for the redundancy of self-correcting arrangements of unreliable functional elements. Problems of Information Transmission (translated from Russian). 13(1). 1977. 59–65.

[63] R. Dobrushin, S. Ortyukov. Upper bound for the redundancy of self-correcting arrangements of unreliable elements. Problems of Information Transmission (translated from Russian). 13(3). 1977. 201–208.

[64] D. R. Dooly, S. A. Goldman, S. D. Scott . On-line analysis of the TCP acknowledgement delay problem. Journal of the ACM . 48. 2001. 243–273.

[65] Gy. Dósa, Y. He. Better online algorithms for scheduling with machine cost. SIAM Journal on Computing. 33(5). 2004. 1035–1051.

[66] Gy. Dósa, Z. Tan . New upper and lower bounds for online scheduling with machine cost. Discrete Optimization . 7(3). 2010. 125–135.

[67] M. Drmota . Random Trees. SpringerWienNewYork . 2009.

[68] D.-Z. Du, K-I. Ko. Problem Solving in Automata, Languages, and Complexity. John Wiley & Sons. 2001.

[69] S. N. Elaydi . An Introduction to Difference Equations. Springer-Verlag. 1999 (2nd edition).

[70] M. Effros, K. Viswesvariah, S. Kulkarni, S. Verdú. Universal lossless source coding with the Burrows-Wheeler transform. IEEE Transactions on Information Theory. 48(5). 2002. 1061–1081.

[71] S. Fenner, L. Fortnow, S. Kurtz. Gap-definable counting classes. Journal of Computer and System Sciences. 48(1). 1994. 116–148.

[72] A. Fiat, Y. Rabani, Y. Ravid. Competitive -server algorithms. Journal of Computer and System Sciences. 48. 1994. 410–428.

[73] A. Fiat, G. Woeginger . Online Algorithms. The State of Art. Springer-Verlag. 1998.

[74] C. N. Fischer, R. LeBlanc (Eds.). Crafting a Compiler. The Benjamin/Cummings Publishing Company. 1988.

[75] P. Flajolet, R. Sedgewick . Analytic Combinatorics. Addison-Wesley. 2009.

[76] R. Fleischer, M. Wahl. On-line scheduling revisited. Journal of Scheduling . 3(6). 2000. 343–353.

[77] F. Forgó, J. Szép, F. Szidarovszky . Introduction to the Theory of Games: Concepts, Methods and Applications. Kluwer Academic Publishers. 1999.

[78] A. Frommer. Lösung linearer Gleichungssysteme auf Parallelrechnern. Vieweg Verlag. 1990.

[79] I. Gaál . Diophantine Equations and Power Integral Bases: New Computational Methods. Birkhäuser Boston. 2002.

[80] R. Gallager . Low-density Parity-check Codes. The MIT Press. 1963.

[81] M. R. Garey, D. S. Johnson . Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman . 1979.

[82] J. Gathen von zur . Modern Computer Algebra (first edition). Cambridge University Press. 1993.

[83] J. Gathen von zur, J. Gerhard . Modern Computer Algebra (second edition). Cambridge University Press. 2003.

[84] P. Gács . Reliable cellular automata with self-organization. Journal of Statistical Physics. 103(1-2). 2001. 45–267, See also and The Proceedings of the 1997 Symposium on the Theory of Computing.

[85] P. Gács, A. Gál . Lower bounds for the complexity of reliable Boolean circuits with noisy gates. IEEE Transactions on Information Theory. 40(2). 1994. 579–583.

[86] P. Gács, J. Reif. A simple three-dimensional real-time reliable cellular array. Journal of Computer and System Sciences. 36(2). 1988. 125–147.

[87] F. Gécseg, I. Peák. Algebraic Theory of Automata. Akadémiai Kiadó, Budapest. 1972.

[88] K. O. Geddes, S. Czapor, G. Labahn. Algorithms for Computer Algebra. Kluwer Academic Publishers. 1992.

[89] D. Giammarresi, R. Montalbano. Deterministic Generalized Automata. Theoretical Computer Science. 215(1-2). 1999. 191–208.

[90] O. Goldreich . Randomness, interactive proofs, and zero-knowledge - A survey, In R. Herken The Universal Turing Machine: A Half-Century Survey. Oxford University Press. 1988. 377–405.

[91] O. Goldreich, S. Micali, A. Wigderson . Proofs that yield nothing but their validity or all languages in NP. Journal of the ACM. 38(3). 1991. 691–729.

[92] O. Goldreich . Foundations of Cryptography. Cambridge University Press. 2001.

[93] S. Goldwasser . Interactive proof systems, In J. Hartmanis (Ed.) Computational Complexity Theory, AMS Short Course Lecture Notes: Introductory Survey Lectures. Proceedings of Symposia in Applied Mathematics. American Mathematical Society. 38. 1989. 108–128.

[94] S. Goldwasser, S. Micali, C. Rackoff. The knowledge complexity of interactive proof systems. SIAM Journal on Computing. 18(1). 1989. 186–208.

[95] S. Goldwasser, M. Sipser. Private coins versus public coins in interactive proof systems, In S. Micali (Ed.), Randomness and Computation, Advances in Computing Research. JAI Press. 5. 1989. 73–90, A preliminary version appeared in Proc. 18th Ann. ACM Symp. on Theory of Computing, 1986.

[96] G. Gonnet, D. Gruntz, L. Bernardin. Computer Algebra Systems, In A. Ralston, E. D. Reilly, D. Hemmendinger (Eds.) Encyclopedia of Computer Science. Nature Publishing Group. 4th edition, 2000. 287–301.

[97] R. L. Graham . Bounds for certain multiprocessor anomalies. The Bell System Technical Journal. 45. 1966. 1563–1581.

[98] R. L. Graham, D. E. Knuth, O. Patashnik. Concrete Mathematics. Addison-Wesley. 1994 (2nd edition).

[99] D. H. Greene, D. E. Knuth . Mathematics for the Analysis of Algorithms. Birkhäuser . 1990 (3rd edition).

[100] D. Gries . Compiler Construction for Digital Computers. John Wiley & Sons. 1971.

[101] R. Grossman. Symbolic Computation: Applications to Scientific Computing, Frontiers in Applied Mathematics, Vol. 5. SIAM . 1989.

[102] D. Grune, H. Bal, C. J. H. Jacobs, K. Langendoen. Modern Compiler Design. John Wiley & Sons. 2000.

[103] L. Hageman, D. Young . Applied Iterative Methods. Academic Press. 1981.

[104] T. S. Han, K. Kobayashi. Mathematics of Information and Coding. American Mathematical Society. 2002.

[105] G. Hadley. Nonlinear and Dynamic Programming. Addison-Wesley. 1964.

[106] D. Hankerson, G. A. Harris, P. D. Johnson. Introduction to Information Theory and Data Compression. Chapman & Hall. 2003 (2nd edition).

[107] D. Harper, C. Wooff, D. Hodginson. A Guide to Computer Algebra Systems. John Wiley & Sons. 1991.

[108] M. A. Harrison . Introduction to Formal Language Theory. Addison-Wesley. 1978.

[109] J. Hastad. Solving simultaneous modular equations of low degree. SIAM Journal on Computing. 17(2). 1988. 336–341, Special issue on cryptography.

[110] A. C. Hearn. Future Directions for Research in Symbolic Computation, SIAM Reports on Issues in the Mathematical Sciences. SIAM . 1990.

[111] L. A. Hemaspaandra, J. Rothe, A. Saxena. Enforcing and defying associativity, commutativity, totality, and strong noninvertibility for one-way functions in complexity theory, In M. Coppo, M. Coppo et al. (Eds.) ICTCS 2005, Lecture Notes in Computer Science . Springer Verlag. 117. 2005. 265–279.

[112] L. A. Hemaspaandra, M. Ogihara. The Complexity Theory Companion, EATCS Texts in Theoretical Computer Science. Springer-Verlag. 2002.

[113] L. A. Hemaspaandra, K. Pasanen, J. Rothe . If PNP then Some Strongly Noninvertible Functions are Invertible. Theoretical Computer Science. 362(1-3). 2006. 54–62.

[114] L. A. Hemaspaandra, J. Rothe . Creating strong, total, commutative, associative one-way functions from any one-way function in complexity theory. Journal of Computer and Systems Sciences. 58(3). 1999. 648–659.

[115] C. Hoffman (Ed.). Group-Theoretic Algorithms and Graph Isomorphism, Lecture Notes in Computer Science . Springer-Verlag. 136. 1982.

[116] C. Homan. Tight lower bounds on the ambiguity in strong, total, associative, one-way functions. Journal of Computer and System Sciences. 68(3). 2004. 657–674.

[117] J. E. Hopcroft, R. Motwani, J. D. Ullman . Introduction to Automata Theory, Languages, and Computation. Addison-Wesley. 2006 (in German: Einführung in Automatentheorie, Formale Sprachen und Komplexitätstheorie, Pearson Studium, 2002). 3rd edition.

[118] J. E. Hopcroft, J. D. Ullman . Introduction to Automata Theory, Languages, and Computation. Addison-Wesley. 1979.

[119] D. Huffman. A Method for the Construction of Minimum-Redundancy Codes. Proceedings of the IRE. 40(9). (1952). 1098–1101.

[120] T. W. Hungerford. Abstract Algebra: An Introduction. Saunders College Publishers. 1990.

[121] R. W. Hunter. Compilers, Their Design and Construction using Pascal. John Wiley& Sons. 1985.

[122] Cs. Imreh . Online strip packing with modifiable boxes. Operations Research Letters. 66. 2001. 79–86.

[123] Cs. Imreh . Online scheduling with general machine cost functions. Discrete Applied Mathematics. 157(9). 2009. 2070–2077.

[124] Cs. Imreh, T. Németh . On time lookahead algorithms for the online data acknowledgement problem, In Proceedings of MFCS 2007 32nd International Symposium on Mathematical Foundations of Computer Science, Lecture Notes in Computer Science . Springer-Verlag. 4708. 2007. 288–297.

[125] Cs. Imreh, J. Noga . Scheduling with machine cost, In Proceedings of APPROX'99, Lecture Notes in Computer Science . 1540. 1999. 168–176.

[126] A. Iványi . Performance bounds for simple bin packing algorithms. Annales Universitatis Scientiarum Budapestinensis de Rolando Eötvös Nominatae, Sectio Computarorica . 5. 1984. 77–82.

[127] A. Iványi (ed.). Informatikai algoritmusok 1 (Algorithms of Informatics, Vol. 1). ELTE Eötvös Kiadó. 2004. Elektronic version: ELTE Informatikai Kar, 2005.

[128] A. Iványi (ed.). Informatikai algoritmusok 2 (Algorithms of Informatics, Vol. 2). ELTE Eötvös Kiadó. 2005.

[129] A. Iványi (ed.). Algorithms of Informatics, Vol. 1. mondAt Kiadó. 2007. Elektronic version: AnTonCom, Budapest, 2010.

[130] A. Iványi (ed.). Algorithms of Informatics, Vol. 2. mondAt Kiadó. 2007. Elektronic version: AnTonCom, Budapest, 2010.

[131] K. Iwama, S. Tamaki. Improved Upper Bounds for 3-SAT, In J. Munro (Ed.) Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 328–329. Society for Industrial and Applied Mathematics. 2004.

[132] D. S. Johnson . Near-Optimal Bin Packing Algorithms. PhD thesis, MIT Department of Mathematics . 1973.

[133] D. S. Johnson . Fast algorithms for bin packing. Journal of Computer and System Sciences. 8. 1974. 272–314.

[134] D. S. Johnson, A. Demers, J. D. Ullman, M. R. Garey, R. L. Graham . Worst-case performance-bounds for simple one-dimensional bin packing algorithms. SIAM Journal on Computing. 3. 1974. 299–325.

[135] S. Kakutani. A generalization of Brouwer's fixed point theorem. Duke Mathematical Journal. 8. 1941. 457–459.

[136] B. Kaliski, M. Robshaw. The secure use of RSA. CryptoBytes . 1(3). 1995. 7–13.

[137] S. Karamardian. The nonlinear complementarity problems with applications. I, II.. Journal of Optimization Theory and Applications. 4. 1969. 87–98 and 167–181.

[138] Z. Karian, A. Starrett. Use of Symbolic Computation in Probability and Statistics, In Z. Karian (Ed.) Symbolic Computation in Undergraduate Mathematics Education. Mathematical Association of America, Number 24 in Notes of Mathematical Association of America. 1992.

[139] A. R. Karlin, C. Kenyon, D. Randall . Dynamic TCP acknowledgement and other stories about , In Proceedings of the 31st Annual ACM Symposium on Theory of Computing. 2001. 502–509.

[140] R. M. Karp . Reducibility Among Combinatorial Problems, In R. E. Miller, J. W. Thatcher Complexity of Computer Computations. Plenum Press. 1972. 85–103.

[141] Z. Kása . Combinatorica cu aplicatii (Combinatorics with Applications). Presa Universitara Clujeana. 2003.

[142] D. Kelley. Automata and Formal Languages. Prentice Hall. 1995.

[143] J. Kim, V. Vu. Generating random regular graphs, In Proceedings of the Thirty Fifth ACM Symposium on Theory of Computing. 2003. 213–222.

[144] D. E. Knuth . Fundamental Algorithms, The Art of Computer Programming, Vol. 1.. Addison-Wesley. 1968 (3rd updated edition).

[145] D. E. Knuth . Seminumerical Algorithms, The Art of Computer Programming, Vol. 2.. Addison-Wesley. 1969 (3rd corrected edition).

[146] D. E. Knuth . Sorting and Searching, The Art of Computer Programming, Vol. 3.. Addison-Wesley. 1973 (3rd corrected edition).

[147] E. Koutsoupias, C. Papadimitriou . On the -server conjecture. Journal of the ACM . 42. 1995. 971–983.

[148] A. Kovács . Computer Algebra: Impact and Perspectives. Nieuw Archief voor Wiskunde . 17(1). 1999. 29–55.

[149] D. C. Kozen . Automata and Computability. Springer-Verlag. 1995.

[150] J. Köbler, U. Schöning, S. Toda, J. Torán. Turing machines with few accepting computations and low sets for PP. Journal of Computer and System Sciences. 44(2). 1992. 272–286.

[151] J. Köbler, U. Schöning, J. Torán. Graph isomorphism is low for PP. Computational Complexity. 2. 1992. 301–330.

[152] J. Köbler, U. Schöning, J. Torán. The Graph Isomorphism Problem: Its Structural Complexity. Birkhäuser . 1993.

[153] R. Krichevsky, V. Trofimov. The performance of universal encoding. IEEE Transactions on Information Theory. 27. 1981. 199–207.

[154] H. W. Kuhn, A. Tucker. Contributions to the Theory of Games. II. Princeton University Press. 1953.

[155] S. Kurtz, B. Balkenhol . Space efficient linear time computation of the Burrows and Wheeler transformation, In I. Althöfer, N. Cai, G. Dueck, L. Khachatrian, M. Pinsker, A. Sárközy, I. Wegener, Z. Zhang (Eds.): Numbers, Information and Complexity. Kluwer Academic Publishers. 2000. 375–383.

[156] A. V. Kuznetsov. Information storage in a memory assembled from unreliablecomponents. Problems of Information Transmission (translated from Russian). 9(3). 1973. 254–264.

[157] R. Ladner, N. A. Lynch, A.Selman. A comparison of polynomial time reducibilities. Theoretical Computer Science. 1(2). 1975. 103–124.

[158] G. Langdon. An introduction to arithmetic coding. IBM Journal of Research and Development. 28. 1984. 135–149.

[159] M. V. Lawson . Finite Automata. Chapman & Hall/CRC . 2004.

[160] A. Lenstra, H. Lenstra. The Development of the Number Field Sieve, Lecture Notes in Mathematics. Springer-Verlag. 1554. 1993.

[161] A. K. Lenstra, H. W. Lenstra, Jr., L. Lovász . Factoring polynomials with integer coefficients. Mathematische Annalen. 261. 1982. 513–534.

[162] S. Leonardi . On-line network routing, Lecture Notes in Computer Science . Springer-Verlag. 1442. 1998. 242–267.

[163] R. Lidl, H. Niederreiter . Introduction to Finite Fields and Their Applications. Cambridge University Press. 1986.

[164] P. Linz. An Introduction to Formal Languages and Automata. Jones and Barlett Publishers. 2001.

[165] P. Linz . An Introduction to Formal Language and Automata. Jones and Bartlett Publishers, Inc.. 2006. 4th edition.

[166] M. Lothaire. Algebraic Combinatorics on Words. Cambridge University Press. 2002.

[167] L. Lovász . Combinatorial Problems and Exercises. Akadémiai Kiadó/North Holland Publ. House. 1979.

[168] L. Lovász, P. Gács . Algoritmusok (Algorithms). Műszaki Könyvkiadó és Tankönyvkiadó, Budapest. 1978 and 1987.

[169] K. Louden . Compilers and interpreters, A. B. Tucker (ed.) Computer Science Handbook, pages 99/1–99/30. Chapman & Hall/CRC . 2004.

[170] O. B. Lupanov . On a method of circuit synthesis. Izvestia VUZ (Radiofizika). 1958. 120–140.

[171] R. Mak. Writing Compilers and Interpreters. Addison-Wesley. 1991.

[172] M. Manasse, L. McGeoch, D. Sleator . Competitive algorithms for server problems. Journal of Algorithms . 11. 1990. 208–230.

[173] O. Mangasarian, H. Stone. Two-person zero-sum games and quadratic programming. Journal of Mathematical Analysis and its Applications. 9. 1964. 348–355.

[174] Z. Manna . Mathematical Theory of Computation. McGraw-Hill Book Co.. 1974.

[175] B. Martos. Nonlinear Programming Theory and Methods. Akadémiai Kiadó. 1975.

[176] R. Mathon. A note on the graph isomorphism counting problem. Information Processing Letters. 8(3). 1979. 131–132.

[177] A. Meduna . Automata and Languages: Theory and Applications. Springer-Verlag. 2000.

[178] A. Meyer, L. J. Stockmeyer. The equivalence problem for regular expressions with squaring requires exponential space, In Proceedings of the 13th IEEE Symposium on Switching and Automata Theory. 1972. 129–129.

[179] D. Micciancio, S. Goldwasser. Complexity of Lattice Problems: A Cryptographic Perspective, The Kluwer International Series in Engineering and Computer Science. Kluwer Academic Publishers. 671. 2002.

[180] R. E. Mickens . Difference Equations. Theory and Applications. Van Nostrand Reinhold. 1990.

[181] M. E. Mignotte. Mathematics for Computer Algebra. Springer . 1992.

[182] G. L. Miller. Riemann's Hypothesis and Tests for Primality. Journal of Computer and Systems Sciences. 13(3). 1976. 300–317.

[183] H. Mills. Equilibrium points of finite games. SIAM Journal of Applied Mathematicsiadó. 8. 1976. 397–402.

[184] B. E. Mishra. Algorithmic Algebra. Springer . 1993.

[185] R. N. Moll, M. A. Arbib, A. J. Kfoury. An Introduction to Formal Language Theory. Springer-Verlag. 1988.

[186] B. Monien, E. Speckenmeyer. Solving satisfiability in less than steps. Discrete Applied Mathematics. 10. 1985. 287–295.

[187] J. Moore. Protocol failures in cryptosystems, In G. Simmons Contemporary Cryptology: The Science of Information Integrity. IEEE Computer Society Press. 1992. 541–558.

[188] R. Motwani, P. Raghavan. Randomized Algorithms. Cambridge University Press. 1995.

[189] S. Muchnick. Advanced Compiler Design and Implementation. Morgan Kaufman Publisher. 1997.

[190] J. Nash. Noncooperative games. Annals of Mathematics. 54. 1951. 286–295.

[191] M. Nelson, J. L. Gailly. The Data Compression Book. M&T Books. 1996.

[192] J. Neumann. Probabilistic logics and the synthesis of reliable organisms from unreliable components, In C. Shannon, P. J. McCarthy (Eds.) Automata Studiess. Princeton University Press. 1956. 43–98.

[193] J. Neumann, O. Morgenstern. Theory of Games and Economical Behaviour. Princeton University Press. 1947 (2nd edition).

[194] H. Nikaido, K. Isoda. Note on noncooperative games. Pacific Journal of Mathematics. 5. 1955. 807–815.

[195] A. Odlyzko. Applications of Symbolic Mathematics to Mathematics. Kluwer Academic Publishers. 1985.

[196] K. Okuguchi . Expectation and Stability of Oligopoly Models. Springer . 1976.

[197] K. Okuguchi, F. Szidarovszky . The Theory of Oligopoly with Multi-Product Firms. Springer . 1999 (2nd edition).

[198] C. H. Papadimitriou . Computational Complexity. Addison-Wesley. 1994.

[199] R. Pasco. Source Coding Algorithms for Fast Data Compression. Stanford University. 1976.

[200] R. Paturi, P. Pudlák, M. Saks, F. Zane. An improved exponential-time algorithm for -SAT, In Proceedings of the 39th IEEE Symposium on Foundations of Computer Science, pages 628–637. IEEE Computer Society Press. 1998.

[201] R. Pavelle, M. Rothstein. Computer Algebra. Scientific American . 245(12). 1981. 102–113.

[202] M. Pinsker. On the complexity of a concentrator. International Teletraffic Congr.. 7. 1973. 318/1–318/4.

[203] N. Pippenger, G. Staomulis, J. N. Tsitsiklis . On a lower bound for the redundancy of reliable networks with noisy gates. IEEE Transactions on Information Theory. 37(3). 1991. 639–643.

[204] N. Pippenger . Analysis of error correction by majority voting, In S. Micali (Ed.) Randomness in Computationitle. JAI Press. 1989. 171–198.

[205] N. Pippenger . On networks of noisy gates, In Proceeding of the 26th IEE FOCS Symposiums. 1985. 30–38.

[206] T. Pittman. The Art of Compiler Design, Theory and Practice. Prentice Hall. 1992.

[207] J. M. Pollard. Theorems on factorization and primality testing. Proceedings of the Cambridge Philosophical Society. 76. 1974. 521–528.

[208] M. Rabi, A. Sherman. An observation on associative one-way functions in complexity theory. Information Processing Letters. 64(5). 1997. 239–244.

[209] M. O. Rabin . Probabilistic Algorithms for Testing Primality. Journal of Number Theory. 12(1). 1980. 128–138.

[210] R. Rao, J. Rothe, O. Watanabe. Upward separation for FewP and related classes. Information Processing Letters. 52. 1994. 175–180, (Corrigendum appears in the same journal,74(1-2):89, 2000).

[211] R. Reischuk, B. Schmelz. Reliable computation with noisy circuits and decision trees-a general lower bound, In Proceedings of the 32-nd IEEE FOCS Symposium. 1991. 602–611.

[212] J. J. Rissanen. Generalized Kraft inequality and arithmetic coding. IBM Journal of Research and Development. 20. 1976. 198–203.

[213] J. Ritt. Integration in Finite Terms. Columbia University Press. 1948.

[214] R. L. Rivest, A. Shamir, L. M. Adleman. A Method for Obtaining Digital Signatures and Public-Key Cryptosystems. Communications of the ACM . 21(2). 1978. 120–126.

[215] J. Robinson. An iterative method of solving a game. Annals of Mathematics. 154. 1951. 296–301.

[216] J. Rosen. Existence and uniqueness of equilibrium points for concave -person games. Econometrica . 33. 1965. 520–534.

[217] J. Rothe . Some Facets of Complexity Theory and Cryptography: A Five-Lecture Tutorial. ACM Computing Surveys. 34(4). 2002. 504–549.

[218] J. Rothe . A promise class at least as hard as the polynomial hierarchy. Journal of Computing and Information. 1(1). 1995. 92–107.

[219] J. Rothe . Complexity Theory and Cryptology. An Introduction to Cryptocomplexity, EATCS Texts in Theoretical Computer Sciencey. Springer-Verlag. 2005.

[220] G. Rozenberg, A. Salomaa . Handbook of Formal Languages, Volumes I-III.. Springer-Verlag. 1997.

[221] A. Salomaa . Theory of Automata. Pergamon Press. 1969.

[222] A. Salomaa . Formal Languages. Academic Press. 1987 (2nd updated edition).

[223] A. Salomaa . Public-Key Cryptography, EATCS Monographs on Theoretical Computer Science, Vol. 23. Springer-Verlag. 1996 (2nd edition).

[224] D. Salomon. Data Compression. Springer-Verlag. 2004 (3rd edition).

[225] K. Sayood. Introduction to Data Compression. Morgan Kaufman Publisher. 2000 (2nd edition).

[226] U. Schöning . A low and a high hierarchy within NP. Journal of Computer and System Sciences. 27. 1983. 14–28.

[227] U. Schöning . Graph isomorphism is in the low hierarchy. Journal of Computer and System Sciences. 37. 1987. 312–323.

[228] U. Schöning . A probabilistic algorithm for -SAT based on limited local search and restart, In Proceedings of the 40th IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press. 1999. 410–414.

[229] U. Schöning . Algorithmik. Spektrum Akademischer Verlag. 2001.

[230] R. Sedgewick, P. Flajolet . An Introduction to the Analysis of Algorithms. Addison-Wesley. 1996.

[231] A. Selman. Polynomial time enumeration reducibility. SIAM Journal on Computing . 7(4). 1978. 440–457.

[232] A. Shamir. TIP=PSPACE. Journal of the ACM . 39(4). 1992. 869–877.

[233] A. Shamir. RSA for paranoids. CryptoBytes. 1(3). 1995. 1–4.

[234] C. Shannon . The synthesis of two-terminal switching circuits. The Bell Systems Technical Journal. 28. 1949. 59–98.

[235] H. N. Shapiro. Note on a computation method in the theory of games. Communications on Pure and Applied Mathematics. 11. 1958. 587–593.

[236] D. B. Shmoys, J. Wein, D. P. Williamson . Scheduling parallel machines online. SIAM Journal on Computing. 24. 1995. 1313–1331.

[237] I. E. Shparlinski . Finite Fields: Theory and Computation The Meeting Point of Number Theory, Computer Science, Coding Theory, and Cryptography. Kluwer Academic Publishers. 1999.

[238] M. Simon. Automata Theory. World Scientific Publishing Company. 1999.

[239] J. Sgall . On-line scheduling, Lecture Notes in Computer Science . Springer-Verlag. 1442. 1998. 196–231.

[240] D. A. Simovoci, R. L. Tenney. Theory of Formal Languages with Applications. World Scientific Publishing Company. 1999.

[241] S. Singh . The Code Book. The Secret History of Codes and Code Breaking. Fourth Estate. 1999.

[242] M. Sipser. Introduction to the Theory of Computation. PWS Publishing Company. 1997.

[243] M. Sipser, D. A. Spielman. Expander codes. IEEE Transactions on Information Theory. 42(6). 1996. 1710–1722.

[244] D. Sleator, R. E. Tarjan . Amortized efficiency of list update and paging rules. Communications of the ACM . 28. 1985. 202–208.

[245] N. P. Smart . The Algorithmic Resolution of Diophantine Equations, In London Mathematical Society Student Text. Cambridge University Press. 41. 1998.

[246] R. Solovay, V. Strassen . A fast Monte Carlo test for primality. SIAM Journal on Computing. 6. 1977. 84–85.

[247] D. Spielman . Linear-time encodable and decodable error-correcting codes, In Proceedings of the 27th ACM STOC Symposium. 1995. 387–397 (further IEEE Transactions on Information Theory 42(6): 1723–1732).

[248] D. Spielman . Highly fault-tolerant parallel computation, In Proceedings of the 37th IEEE Foundations of Computer Science Symposium. 1996. 154–163.

[249] D. Stinson . Cryptography: Theory and Practice. CRC Press. 2002 (2nd edition).

[250] L. J. Stockmeyer. The polynomial-time hierarchy. Theoretical Computer Science. 3(1). 1977. 1–22.

[251] H. Straubing . Finite Automata, Formal Logic, and Circuit Complexity. Birkhäuser . 1994.

[252] T. A. Sudkamp . Languages and Machines. Addison-Wesley. 1997.

[253] F. Szidarovszky, C. Chiarella. Dynamic oligopolies, stability and bifurcation. Cubo Mathemática Educational. 3(2). 2001. 267–284.

[254] F. Szidarovszky, S. Yakowitz. Principles and Procedures of Numerical Analysis. Plenum Press. 1998.

[255] A. Tarski. A lattice-theoretical fixpoint theorem and its application. Pacific Journal of Mathematics. 5. 1955. 285–308.

[256] D. S. Taubman, M. W. Marcelin. JPEG 2000 - Image Compression, Fundamentals, Standards and Practice. Society for Industrial and Applied Mathematics. 1983.

[257] M. G. Taylor. Reliable information storage in memories designed from unreliable components. The Bell Systems Technical Journal. 47(10). 1968. 2299–2337.

[258] J-P. Tremblay, P. Sorenson. Compiler Writing. McGraw-Hill Book Co.. 1985.

[259] A. Turing. On computable numbers, with an application to the Entscheidungsproblem. Proceedings of the London Mathematical Society, ser. 2. 2. 1936.

[260] J. J. Uhl. Mathematica and Me. Notices of AMS. 35. 1988. 1345–1345.

[261] L. G. Valiant . The relative complexity of checking and evaluating. Information Processing Letters. 5(1). 1976. 20–23.

[262] A. Vestjens. On-line machine scheduling. Phd thesis, Eindhoven University of Technology. 1997.

[263] N. J. Vilenkin. Combinatorial Mathematics for Recreation. Mir. 1972.

[264] A. van Vliet. An improved lower bound for on-line bin packing algorithms. Information Processing Letters. 43. 1992. 277–284.

[265] A. van Vliet. Lower and upper bounds for on-line bin packing and scheduling heuristics. PhD thesis, Erasmus University, Rotterdam. 1995.

[266] K. Wagner, G. Wechsung . Computational Complexity. D. Reidel Publishing Company. 1986 (and Kluwer Academic Publishers, 2001).

[267] W. Waite, G. Goos . Compiler Construction. Springer-Verlag. 1984.

[268] G. Wallace. The JPEG still picture compression standard. Communications of the ACM . 34. 1991. 30–44.

[269] D. Watkins. Bulge exchanges in algorithms of QR type. SIAM Journal on Matrix Analysis and Application. 19(4). 1998. 1074–1096.

[270] A. B. Webber . Formal Language: A Practical Introduction. Franklin, Beedle & Associates, Inc.. 2008.

[271] G. Wechsung . Vorlesungen zur Komplexitätstheorie. B. G. Teubner Verlagsgesellschaft. 2000.

[272] D. Welsh. Codes and Cryptography. Oxford University Press. 1988.

[273] J. Wilkinson. Convergence of the LR, QR, and related algorithms. The Computer Journal. 8(1). 1965. 77–84.

[274] F. M. J. Willems, Y. M. Shtarkov, T. J. Tjalkens. The context-tree weighting method: basic properties. IEEE Transactions on Information Theory. 47. 1995. 653–664.

[275] F. M. J. Willems, Y. M. Shtarkov, T. J. Tjalkens. The context-tree weighting method: basic properties. IEEE Information Theory Society Newsletter. 1. 1997. 1 and 20–27.

[276] F. Winkler . Polynomial Algorithms in Computer Algebra. Springer-Verlag. 1990.

[277] I. H. Witten, R. M. Neal, J. G. Cleary. Arithmetic coding for sequential data compression. Communications of the ACM . 30. 1987. 520–540.

[278] A. C. C. Yao . New algorithms for bin packing. Journal of the ACM . 27. 1980. 207–227.

[279] D. M. Young . Iterative Solution of Large Linear Systems. Academic Press. 1971.

[280] N. Young . On-line file caching. Algorithmica . 33. 2002. 371–383.

[281] J. Ziv, A. Lempel . A universal algorithm for sequential data compression. IEEE Transactions on Information Theory. 23. 1977. 337–343.

[282] J. Ziv, A. Lempel . Compression of individual sequences via variable-rate coding. IEEE Transactions on Information Theory. 24. 1978. 530–536.

[283] S. I. Zuhovitsky, R. A. Polyak, M. E. Primak. Concave -person games (numerical methods). Ékonomika i Matematicheskie Methody. 7. 1971 (in Russian). 888–900.