[1] S. Abiteboul . Querying semi-structured data, Lecture Notes in Computer Science, In F. Afrati, P. Kolaitis(Eds.) Proceedings of ICDT'97. Springer-Verlag. 1186. 1997. 1–18.

[2] S. Abiteboul, O. Duschka. Complexity of answering queries using materialized views, In Proceedings of the Seventeenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems. ACM-Press. 1998. 254–263.

[3] S. Abiteboul, V. Vianu. Foundations of Databases. Addison-Wesley. 1995.

[4] L. Addario-Berry, B. Chor, M. Hallett, J.Lagergren, A. Panconesi, T. Wareham . Ancestral Maximum Likelihood of Phylogenetic Trees is Hard. Lecture Notes in Bioinformatics. 2812. 2003. 202–215.

[5] R. G. Addie, M. Zukerman, T. Neame. Broadband Traffic Modeling: Simple Solutions to Hard Problems. IEEE Communications Magazine. 36(8). 1998. 88–95.

[6] A. Aho, C. Beeri, J. D. Ullman. The theory of joins in relational databases. ACM Transactions on Database Systems. 4(3). 1979. 297–314.

[7] R. K. Ahuja, T. L. Magnanti, J. B. Orlin . Network Flows: Theory, Algorithms, and Applications. Prentice Hall. 1993.

[8] T. Akutsu . Dynamic programming algorithms for RNA secondary prediction with pseudoknots. Discrete Applied Mathematics. 104. 2000. 45–62.

[9] E. Althaus, A. Caprara, H. Lenhof, K. Reinert . Multiple sequence alignment with arbitrary gap costs: Computing an optimal solution using polyhedral combinatorics. Bioinformatics. 18. 2002. S4–S16.

[10] I. Althöfer . 13 Jahre 3-Hirn. Published by the author . 1998.

[11] I. Althöfer . Improved game play by multiple computer hints. Theoretical Computer Science. 313. 2004. 315–324.

[12] I. Althöfer . List-3-Hirn vs. Grandmaster Yussupov – report on a very experimental match. ICCA Journal. 21. 1998. 52–60 and 131–134.

[13] I. Althöfer, F. Berger, S. Schwarz. Generating True Alternatives with a Penalty Method. . 2002.

[14] I. Althöfer, J. de Koning, J. Lieberum, S. Meyer-Kahlen, T. Rolle, J. Sameith. Five visualisations of the -best mode. ICCA Journal. 26. 2003. 182–189.

[15] G. M. Amdahl. Validity of the single-processor approach to achieving large-scale computer capabilities, In AFIPS Conference Proceedings. 30. 1967. 483–485.

[16] AND Software GmbH. Car routing program Route Germany. 1997.

[17] D. Anick, D. Mitra, M. Sondhi. Stochastic theory of a data handling system with multiple sources. The Bell System Technical Journal. 61. 1982. 1871–1894.

[18] M. Arenas, L. Libkin . A normal form for XML documents, In Proceedings of the 21st Symposium on Principles of Database Systems. 2002. 85–96.

[19] V. Arlazanov, E. A. Dinic, M. Kronrod, I. Faradzev. On economic construction of the transitive closure of a directed graph. Doklady Academii Nauk SSSR. 194. 1970. 487–488.

[20] W. Armstrong. Dependency structures of database relationships, In Proceedings of IFIP Congress. North Holland. 1974. 580–583.

[21] J. Aspnes, C. Busch, S. Dolev, F. Panagiota, C. Georgiou, A. Shvartsman, P. Spirakis, R. Wattenhofer . Eight open problems in distributed computing. Bulletin of European Association of Theoretical Computer Science of EATCS . 90. 2006. 109–126.

[22] K. Atteson. The performance of the neighbor-joining method of phylogeny reconstruction. Algorithmica . 25(2/3). 1999. 251–278.

[23] H. Attiya, C. Dwork, N. A. Lynch, L. J. Stockmeyer. Bounds on the time to reach agreement in the presence of timing uncertainty. Journal of the ACM . 41. 1994. 122–142.

[24] H. Attiya, J. Welch . Distributed Computing, Fundamentals, Simulations and Advanced Topics. McGraw-Hill. 1998.

[25] B. Awerbuch. Complexity of network synchronization. Journal of the ACM . 32(4). 1985. 804–823.

[26] M. Bader, E. Ohlebusch. Sorting by weighted reversals, transpositions and inverted transpsitions. Lecture Notes in Bioinformatics. 3909. 2006. 563–577.

[27] B. Baker. A tight asymptotic bound for next-fit decreasing bin-packing. SIAM Journal on Algebraic and Discrete Methods. 2(2). 1981. 147–152.

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

[29] J. Banks, J. Carson, B. Nelson. Discrete-Event Simulation. Discrete-Event Simulation. 1996.

[30] W. Banzhaf . Interactive evolution, In T. Back, D. B. Fogel, Z. Michalewicz, T. Baeck (Eds.) Handbook of Evolutionary Computation. IOP Press. 1997.

[31] C. Beeri. On the membership problem for functional and multivalued dependencies in relational databases. ACM Transactions on Database Systems. 5. 1980. 241–259.

[32] C. Beeri, P. Bernstein. Computational problems related to the design of normal form relational schemas. ACM Transactions on Database Systems. 4(1). 1979. 30–59.

[33] C. Beeri, M. Dowd. On the structure of Armstrong relations for functional dependencies. Journal of ACM . 31(1). 1984. 30–46.

[34] C. Beeri, R. Fagin, J. Howard. A complete axiomatization for functional and multivalued dependencies, In ACM SIGMOD Symposium on the Management of Data. 1977. 47–61.

[35] R. Bello, K. Dias, A. Downing, J. Freenan, T. Finnerty, W. D. Norcott, H. Sun, A. Witkowski, M. Ziauddin. Materialized views in Oracle, In Proceedings of Very Large Data Bases'98. 1998. 659–664.

[36] S. A. Benner, M. A. Cohen, H. G. H. Gonnet. Empirical and structural models for insertions and deletions in the divergent evolution of proteins. Journal of Molecular Biology. 229(4). 1993. 1065–1082.

[37] J. Beran. Statistics for Long-Memory Processes, Monographs on Statistics and Applied Probability. Chapman & Hall. 1986.

[38] J. Beran, R. Sherman, M. Taqqu, W. Willinger. Long-range dependence in variable-bit-rate video traffic. IEEE Transactions on Communications . 43. 1995. 1566–1579.

[39] F. Berger. alternatives instead of shortest path. Master's thesis, Friedrich Schiller University, Jena, Faculty of Mathematics and Informatics. 2000.

[40] P. Berman, J. Garay. Cloture votes: $n/4$-resilient distributed consensus in $t+1$ rounds. Mathematical Systems Theory. 26(1). 1993. 3–19.

[41] K. A. Berman, J. L. Paul. Sequential and Parallel Algorithms. PWS Publishing Company. 1996.

[42] A. Békéssy, J. Demetrovics . Contribution to the theory of data base relations. Discrete Mathematics. 27(1). 1979. 1–10.

[43] L. A. Bélády, R. Nelson, G. S. Shedler. An anomaly in space-time characteristics of certain programs running in paging machine. Communications of the ACM . 12(1). 1969. 349–353.

[44] J. Blinn. A generalization of algebraic surface drawing. ACM Transactions on Graphics . 1(3). 1982. 135–256.

[45] J. Bloomenthal. Introduction to Implicit Surfaces. Morgan Kaufmann Publishers. 1997.

[46] A. Blum, T. Yiang, M. Li, J. Tromp, M. Yannakis. Linear approximation of shortest superstrings, In Proceedings of the 23rd ACM Symposium on Theory of Computing. 1991. 328–336.

[47] R. P. Brent. The Parallel Evaluation of General Arithmetic Expressions. Journal of the ACM . 21. 1974. 201–206.

[48] J. E. Bresenham. Algorithm for Computer Control of a Digital Plotter. IBM Systems Journal. 4(1). 1965. 25–30.

[49] P. Buneman . Semistructured data, In Proceedings of the Sixteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems. ACM-Press. 1997. 117–121.

[50] P. Buneman, M. Fernandez, D. Suciu . UnQL: a query language and algebra for semistructured data based on structural recursion. The International Journal on Very Large Data Bases . 9(1). 2000. 76–110.

[51] J. E. Burns. A formal model for message passing systems. Technical reports91, Indiana University. (91). 1980.

[52] J. E. Burns, N. A. Lynch . Bounds on shared memory for mutual exclusion. Information and Computation. 107(2). 1993. 171–184.

[53] CACI . COMNET III. CACI Products Co.. 1997.

[54] D. Calvanese, D. De Giacomo, M. Lenzerini, M. Varni. Answering regular path queries using views, In Proceedings of the Sixteenth International Conference on Data Engineering. 2000. 190–200.

[55] A. Caprara. Formulations and complexity of multiple sorting by reversals, In RECOMB-99. ACM-Press. 1999. 84–93.

[56] A. Caprara. Sorting Permutations by Reversals and Eulerian Cycle Decompositions. SIAM Journal on Discrete Mathematics. 12(1). 1999. 91–110.

[57] H. Carillo, D. Lipman. The multiple sequence alignment problem in biology. SIAM Journal on Applied Mathematics. 48. 1988. 1073–1082.

[58] H. Casanova, A. Legrand, Y. Robert . Parallel Algorithms. Chapman & Hall. 2009.

[59] E. Catmull, J. Clark. Recursively generated B-spline surfaces on arbitrary topological meshes. Computer-Aided Design . 10. 1978. 350–355.

[60] R. Chandra, L. Dagum, D. Kohr, D. Maydan, J. McDonald, R. Menon. Parallel Programming in OpenMP. Morgan Kaufmann Publishers. 2000.

[61] S. Chaudhury, R. Krishnamurty, S. Potomianos, K. Shim. Optimizing queries with materialized views, In Proceedings of the Eleventh International Conference on Data Engineering. 1995. 190–200.

[62] B. Chazelle. Triangulating a Simple Polygon in Linear Time. Discrete and Computational Geometry . 6(5). 1991. 353–363.

[63] Q. Chen, A. Lim, K. W. Ong. An adaptive structural summary for graph-structured data, In Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data. 2003. 134–144.

[64] B. Chor, T. Tuller. Maximum likelihood of evolutionary trees: hardness and approximation. Bioinformatics. 21. 2005. i97–i106.

[65] D. Christie. Sorting permutations by block-interchanges. Information Processing Letters. 60(4). 1996. 165–169.

[66] E. F. Codd . A relational model of large shared data banks. Communications of the ACM . 13(6). 1970. 377–387.

[67] E. F. Codd . Further normalization of the data base relational model, In R. Rustin Courant Computer Science Symposium 6: Data Base Systems. Prentice Hall. 1972. 33–64.

[68] E. F. Codd . Normalized database structure: A brief tutorial, In ACM SIGFIDET Workshop on Data Description, Access and Control. 1971. 24–30.

[69] E. F. Codd . Recent investigations in relational data base systems, In Information Processing 74. North-Holland . 1974. 1017–1021.

[70] E. F. Codd . Relational completeness of database sublanguages, In R. Rustin(Ed.) Courant Computer Science Symposium 6: Data Base Systems. Prentice Hall. 1972. 65–98.

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

[72] T. H. Cormen, C. E. Leiserson, R. L. Rivest . Introduction to Algorithms. The MIT Press/McGraw-Hill. 1990.

[73] 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.

[74] D. G. Corneil, C. Gotlieb . An efficient algorithm for graph isomorphism. Journal of the ACM . 17(1). 1970. 51–64.

[75] F. Corpet. Multiple sequence alignment with hierarchical clustering. Nucleic Acids Research. 16. 1988. 10881–10890.

[76] H. S. M. Coxeter. Projective Geometry. University of Toronto Press. 1974 (2nd edition).

[77] M. Crovella, A. Bestavros. Self-Similarity in World Wide Web Traffic: Evidence and Possible Causes. IEEE/ACM Transactions on Networking . 5(6). 1997. 835–846.

[78] D. E. Culler, R. M. Karp, D. Patterson, A. Sahay, E. E. Santos, K. E. Schauser, R. Subramonian, T. von Eicken. LogP: A practical model of parallel computation. Communication of the ACM . 39(11). 1996. 78–85.

[79] A. Darte, Y. Robert, F. Vivien . Scheduling and Automatic Parallelization. Birkhuser Boston. 2000.

[80] M. O. Dayhoff, R. M. Schwartz, B. Orcutt. A model of evolutionary change in proteins. Atlas of Protein Sequence and Structure. 5. 1978. 345–352.

[81] M. de Berg. Efficient Algorithms for Ray Shooting and Hidden Surface Removal. 1992.

[82] M. de Berg, M. van Kreveld, M. Overmars, O. Schwarzkopf. Computational Geometry: Algorithms and Applications. Springer-Verlag. 2000.

[83] C. Delobel. Normalization and hierarchical dependencies in the relational data model. ACM Transactions on Database Systems. 3(3). 1978. 201–222.

[84] J. Demetrovics, Gy. O. H. Katona, A. Sali . Minimal Representations of Branching Dependencies. Discrete Applied Mathematics. 40. 1992. 139–153.

[85] J. Demetrovics, Gy. O. H. Katona, A. Sali . Minimal Representations of Branching Dependencies. Acta Scientiarum Mathematicorum (Szeged). 60. 1995. 213–223.

[86] J. Demetrovics, Gy. O. H. Katona, A. Sali . Design type problems motivated by database theory. Journal of Statistical Planning and Inference. 72. 1998. 149–164.

[87] P. Denning. Virtual memory. Computing Surveys . 2(3). 1970. 153–189.

[88] A. Deutsch, M. Fernandez, D. Suciu . Storing semistructured data with STORED, In Proceedings of SIGMOD'99. 1999. 431–442.

[89] A. Deutsch, L. Popa, D. Tannen. Physical data independence, constraints and optimization with universal plans, In Proceedings of VLDB'99. 1999. 459–470.

[90] D. Dolev, R. Strong. Authenticated algorithms for Byzantine agreement. SIAM Journal on Computing. 12(4). 1983. 656–666.

[91] N. Duffield, N. Oconnell. Large deviation and overflow probabilities for the general single-server queue, with applications. Mathematical Proceedings of the Cambridge Philosophical Society. 118. 1995. 363–374.

[92] D. Duffy, A. McIntosh, M. Rosenstein, W. Willinger. Statistical analysis of CCSN/SS7 traffic data from working CCS subnetworks. IEEE Journal on Selected Areas Communications. 12. 1994. 544–551.

[93] O. Duschka, M. Genesereth. Answering recursive queries using views, In Proceedings of the Sixteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems. ACM-Press. 1997. 109–116.

[94] O. Duschka, M. Genesereth. Query planning in infomaster, In Proceedings of ACM Symposium on Applied Computing. ACM-Press. 1997. 109–111.

[95] N. Dyn, J. Gregory, D. Levin. A butterfly subdivision scheme for surface interpolation with tension control. ACM Transactions on Graphics . 9. 1990. 160–169.

[96] I. Elias, T. Hartman. A 1.375 approximation algorithm for sorting by transpositions. Lecture Notes in Bioinformatics. 3692. 2005. 204–215.

[97] I. Elias, J. Lagergren. Fast Neighbor Joining. Lecture Notes in Computer Science. 3580. 2005. 1263–1274.

[98] P. L. Erdős, M. Steel, L. Székely, T. Warnow . Local quartet splits of a binary tree infer all quartet splits via one dyadic inference rule. Computers and Artificial Intelligence. 16(2). 1997. 217–227.

[99] A. Erramilli, O. Narayan, W. Willinger. Experimental queueing analysis with long-range dependent packet-traffic. IEEE/ACM Transactions on Networking . 4(2). 1996. 209–223.

[100] R. Fagin . Armstrong databases, In Proceedings of IBM Symposium on Mathematical Foundations of Computer Science. 1982. 24 pages.

[101] R. Fagin. Horn clauses and database dependencies. Journal of ACM . 29(4). 1982. 952–985.

[102] R. Fagin. Multivalued dependencies and a new normal form for relational databases. ACM Transactions on Database Systems. 2. 1977. 262–278.

[103] G. Farin. Curves and Surfaces for Computer Aided Geometric Design. Morgan Kaufmann Publishers. 2002 (2nd revised edition).

[104] J. Felsenstein. Evolutionary trees from DNA sequences: a maximum likelihood approach. Journal of Molecular Evolution . 17. 1981. 368–376.

[105] D. Feng, R. F. Doolittle. Progressive sequence alignment as a prerequisite to correct phylogenetic trees. Journal of Molecular Evolution . 25. 1987. 351–360.

[106] R. Fernando. GPUGems: Programming Techniques, Tips, and Tricks for Real-Time Graphics. Addison-Wesley. 2004.

[107] J. W. Fickett. Fast optimal alignment. Nucleid Acids Research . 12. 1984. 175–180.

[108] M. J. Fischer, N. A. Lynch, M. S. Paterson. Impossibility of distributed consensus with one faulty proces. Journal of the ACM . 32(2). 1985. 374–382.

[109] W. M. Fitch. Toward defining the course of evolution: minimum change for a specified tree topology. Systematic Zoology . 20. 1971. 406–416.

[110] D. D. Florescu . Search spaces for object-oriented query optimization. 1996.

[111] D. Florescu, A. Halevy, A. O. Mendelzon. Database techniques for the world-wide web: a survey. SIGMOD Record. 27(3). 1998. 59–74.

[112] D. Florescu, L. Raschid, P. Valduriez . Answering queries using OQL view expressions, In Workshop on Materialized views, in cooperation with ACM SIGMOD. 1996. 627–638.

[113] M. J. Flynn . Very high-speed computer systems. Proceedings of the IEEE . 5(6). 1966. 1901–1909.

[114] J. D. Fooley, A. van Dam, S. K. Feiner, J. F. Hughes. Computer Graphics: Principles and Practice. Addison-Wesley. 1990.

[115] P. Fornai, A. Iványi . Bélády's anomaly is unbounded In E. Kovács, Z. Winkler (Eds.) 5th International Conference on Applied Informatics. Molnár és társa. 2002. 65–72.

[116] S. Fortune, J. Wyllie. Parallelism in Random Access Machines, In Proceedings of the Tenth Annual ACM Symposium on Theory of Computing. 1978. 114–118.

[117] I. Foster, C. Kesselman . The Grid: Blueprint for a New Computing Infrastructure. Morgan Kaufman Publisher. 2004 (2nd edition).

[118] I. Foster, C. Kesselman, J. M. Nick, S. Tuecke. The Physiology of the Grid: An Open Grid Services Architecture for Distributed Systems Integration. Available at . 2002.

[119] L. Foulds, R. L. Graham . The Steiner problem in phylogeny is NP-complete. Advances in Applied Mathematics. 3. 1982. 43–49.

[120] M. Friedman, D. S. Weld. Efficient execution of information gathering plans, In Proceedings International Joint Conference on Artificial Intelligence. 1997. 785–791.

[121] H. Fuchs, Z. M. Kedem, B. F. Naylor. On Visible Surface Generation by A Priory Tree Structures, Computer Graphics (SIGGRAPH '80 Proceedings). 1980. 124–133.

[122] A. Fujimoto, T. Takayuki, I. Kansey. ARTS: Accelerated Ray-Tracing System. IEEE Computer Graphics and Applications. 6(4). 1986. 16–26.

[123] T. Gal, T. Stewart, T. Hanne (Eds.). Multicriteria Decision Making. Kluwer Academic Publisher. 1999.

[124] Z. Galil, R. Giancarlo. Speeding up dynamic programming with applications to molecular biology. Theoretical Computer Science. 64. 1989. 107–118.

[125] J. Gallant, D. Maier, J. Storer. On finding minimal length superstrings. Journal of Computer and System Sciences. 20(1). 1980. 50–58.

[126] W. Gararch, E. Evan, C. Kruskal . Proofs that yield nothing but their validity or all languages in NP. Journal of the ACM. 38(3). 1991. 691–729.

[127] H. Garcia-Molina, J. Seiferas. Elections in a distributed computing systems. IEEE Transactions on Computers. C-31(1). 1982. 47–59.

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

[129] W. H. Gates, C. H. Papadimitriou . Bounds for sorting by prefix reversals. Discrete Mathematics. 27. 1979. 47–57.

[130] P. Gács . Compatible sequences and a slow Winkler percolation. Combinatorics Probability and Computing. 13(6). 2004. 815–856.

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

[132] P. B. Gibbons, Y. Matias, V. Ramachandran . Can a shared-memory model serve as a bridging model for parallel computation. Theory of Computing Systems. 32(3). 1999. 327–359.

[133] A. Glassner. An Introduction to Ray Tracing. Academic Press. 1989.

[134] D. E. Goldberg. Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley. 1989.

[135] N. Goldman, J. Thorne, D. Jones. Using evolutionary trees in protein secondary structure prediction and other comparative sequence analyses. Journal of Molecular Biology. 263(2). 1996. 196–208.

[136] J. Goldstein, P. A. Larson. Optimizing queries using materialized views: a practical, scalable solution, In Optimizing queries using materialized views: a practical, scalable solution. 2001. 331–342.

[137] H. G. H. Gonnet, M. A. Cohen, S. A. Benner . Exhaustive matching of the entire protein sequence database. Science. 256. 1992. 1443–1445.

[138] O. Gotoh . An improved algorithm for matching biological sequences. Journal of Molecular Biology. 162. 1982. 705–708.

[139] G. Gottlob, C. Koch, R. Pichler . The complexity of XPath query evaluation, In Proceedings of the 22nd Symposium on Principles of Database Systems. 2003. 179–190.

[140] G. Grahne, A. Mendelzon . Tableau techniques for querying information sources through global schemas, Lecture Notes in Computer Science., In Proceedings of ICDT'99. Springer-Verlag. 1540. 1999. 332–347.

[141] A. Grama, A. Gupta, G. Karypis, V. Kumar . Introduction to Parallel Computing. Addison-Wesley. 2003 (2nd edition).

[142] J. Grant, J. Minker. Inferences for numerical dependencies. Theoretical Computer Science. 41. 1985. 271–287.

[143] J. Grant, J. Minker. Normalization and axiomatization for numerical dependencies. Information and Control. 65. 1985. 1–17.

[144] J. N. Gray. Notes on database operating system, In R. Bayer, R. M. Graham, G. Seegmuller (Eds.) Operating Systems: An Advanced Course, Lecture Notes in Computer Science . Springer-Verlag. 60. 1978. 393–481.

[145] W. Gropp, M. Snir, B. Nitzberg, E. Lusk. MPI: The Complete Reference, Scientific and Engineering Computation Series. The MIT Press. 1998.

[146] Q-P. Gu, S. Peng, H. Sudborough. A 2-Approximation Algorithm for Genome Rearrangements by Reversals and Transpositions. Theoretical Computer Science. 210(2). 1999. 327–339.

[147] R. Gusella. A measurement study of diskless workstation traffic on an Ethernet. IEEE Transactions on Communications . 38. 1990. 1557–1568.

[148] D. M. Gusfield . Algorithms on Strings, Trees and Sequences. Cambridge University Press. 1997.

[149] D. M. Gusfield . Efficient methods for multiple sequence alignment with guaranteed error bounds. Bulletin of Mathematical Biology. 55. 1993. 141–154.

[150] J. L. Gustafson. Reevaluating Amdahl's law. Communications of ACM . 28(1). 1988. 532–535.

[151] T. Gyires . Simulation of the Harmful Consequences of Self-Similar Network Traffic. The Journal of Computer Information Systems. 42(4). 2002. 94–111.

[152] T. Gyires . Extension of multiprotocol label switching for long-range dependent traffic: QoS routing and performance in IP networks. Computer Standards and Interfaces. 27. 2005. 117–132.

[153] A. Halevy . Answering queries using views: A survey. The VLDB Journal. 10. 2001. 270–294.

[154] A. Halevy . Logic based techniques in data integration, In J. Minker Logic-based Artificial Intelligence. Kluwer Academic Publishers. 2000. 575–595.

[155] A. Halevy, A. Mendelzon, Y. Sagiv, D. Srivastava. Answering queries using views, In Proceedings of the Fourteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems. ACM-Press. 1995. 95–104.

[156] A. Halevy, A. Rajaraman, J. J. Ordille, D. Srivastava. Querying heterogeneous information sources using source descriptions, In Proceedings of Very Large Data Bases. 1996. 251–262.

[157] S. Hannenhalli . Polynomial-time algorithm for computing translocation distance between genomes. Discrete Applied Mathematics. 71. 1996. 137–151.

[158] V. Havran. Heuristic Ray Shooting Algorithms. 2001.

[159] H. He, J. Yang . Multiresolution indexing of XML for frequent queries, In Proceedings of the 20th International Conference on Data Engineering. 2004. 683–694.

[160] H. Hefles, D. Lucantoni. A Markov modulated characterization of packetized voice and data traffic and related statistical multiplexer performance. IEEE Journal on Selected Areas in Communication. 4. 1986. 856–868.

[161] E. A. Heinz. Algorithmic Enhancements and Experiments at High Search Depths. Algorithmic Enhancements and Experiments at High Search Depths. 2000.

[162] M. R. Henzinger, T. A. Henzinger, P. Kopke. Computing simulations on finite and infinite graphs, In Proceedings of the 36th Annual Symposium on Foundations of Computer Science. IEEE Computer Society Press. 1995. 453–462.

[163] I. Herman. The Use of Projective Geometry in Computer Graphics. Springer-Verlag. 1991.

[164] F. Heylighen . Principia Cybernetica Project. . 2004.

[165] D. S. Hirschberg . A linear space algorithm for computing maximal common subsequences. Communications of the ACM . 18. 1975. 341–343.

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

[167] E. Horowitz, S. Sahni, S. Rajasekaran . Computer Algorithms. Computer Science Press. 1998.

[168] M. Höchsman, T. Töller, R. Giegerich, S. Kurtz. Local similarity in RNA secondary structure, In Proceedings of IEEE Bioinformatics Conference 2003. 2003. 159–168.

[169] T. J. P. Hubbard, A. M. Lesk, A. Tramontano. Gathering them into the fold. Nature Structural Biology. 4. 1996. pages 313.

[170] R. Hughey, A. Krogh. Hidden Markov models for sequence analysis: Extension and analysis of the basic method. CABIOS. 12(2). 1996. 95–107.

[171] J. Hunt, T. Szymanski. A fast algorithm for computing longest common subsequences. Communications of the ACM . 20(5). 1977. 350–353.

[172] K. Hwang, Z. Xu. Scalable Parallel Computing. McGraw-Hill . 1998.

[173] Interoute . . 2004.

[174] A. Iványi . Density of safe matrices. Acta Universitatis Sapientiae . 1(2). 2009. 121–142.

[175] A. Iványi . On dumpling-eating giants, Colloquia of Mathematical Society János Bolyai, In Finite and Infinite Sets (Eger, 1981). North-Holland . 37. 1984. 279–390.

[176] A. Iványi . Párhuzamos algoritmusok (Parallel Algorithms). ELTE Eötvös Kiadó. 2003.

[177] 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.

[178] A. Iványi . Tight worst-case bounds for bin packing algorithms, Colloquia of Mathematical Society János Bolyai, In Theory of Algorithms (Pécs, 1984). North-Holland . 44. 1985. 233–240.

[179] A. Iványi, R. Szmeljánszkij. Elements of Theoretical Programming (in Russian). Moscow State University. 1985.

[180] R. Jain, S. Routhier. Packet trains: Measurements and a new model for computer network traffic. IEEE Journal on Selected Areas in Communication. 4. 1986. 986–995.

[181] M. R. Jerrum. The complexity of finding minimum-length generator sequences. Theoretical Computer Science. 36. 1986. 265–289.

[182] T. Jiang, M. Li. Towards a DNA sequencing theory (learning strings). (91-08). 1991.

[183] P. Jiménez, F. Thomas, C. Torras. 3D Collision Detection: A Survey. Computers and Graphics . 25(2). 2001. 269–285.

[184] D. S. Johnson . Near-Optimal Bin Packing Algorithms. MIT Department of Mathematics . 1973.

[185] 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.

[186] K. Jones. Consultant's Guide to COMNET III. CACI Product Company. 1997.

[187] G. A. Jones, J. Jones. Information and Coding Theory. Springer-Verlag. 2000.

[188] M. Kandemir, J. Ramanujam, A. Choudhary . Compiler algorithms for optimizing locality and parallelism on shared and distributed-memory machines. Journal of Parallel and Distributed Computing. 60. 2000. 924–965.

[189] S. Karlin, M. T. Taylor. A First Course in Stochastic Processes. Academic Press. 1975.

[190] R. M. Karp, R. E. Miller, S. Winograd. The organization of computations for uniform recurrence equations. Journal of the ACM . 14. 1967. 563–590.

[191] R. Kaushik, P. Bohannon, J. F. Naughton, H. Korth . Covering indexes for branching path queries, In Proceedings of the 2002 ACM SIGMOD International Conference on Management of Data. 2002. 133–144.

[192] R. Kaushik, P. Bohannon, J. F. Naughton, H. Korth, P. Shenoy . Updates for structure indexes, In Proceedings of Very Large Data Bases. 2002. 239–250.

[193] R. Kaushik, R. Krishnamurthy, J. F. Naughton, R. Ramakrishnan . Exploiting local similarity for indexing paths in graph-structured data, In Proceedings of the 18th International Conference on Data Engineering. 2002. 129–140.

[194] R. Kaushik, R. Shenoy, P. F. Bohannon, E. Gudes . On the integration of structure indexes and inverted lists, In Proceedings of the 2004 ACM SIGMOD International Conference on Management of Data. 2004. 779–790.

[195] J. Kececioglu, H. Lenhof, K. Mehlhorn, P. Mutzel, K. Reinert, M. Vingron. A polyhedral approach to sequence alignment problems. Discrete Applied Mathematics. 104(1-3). 2000. 143–186.

[196] D. Kececioglu, E. Myers . Combinatorial algorithms for DNA sequence assembly. 1993.

[197] K. Kennedy, R. Allen. Optimizing Compilers for Modern Architectures. Morgan Kaufman Publishers. 2001.

[198] M. Khosrow-Pour . Encyclopedia of Information Science and Technology, Vol. 1, Vol. 2, Vol. 3, Vol. 4, Vol. 5. Idea Group Inc.. 2005.

[199] S. Kleiman, D. Shah, B. Smaalders. Programming with Threads. Prentice Hall. 1996.

[200] L. Kleinrock . Queueing Systems. John Wiley & Sons. 1975.

[201] B. Knudsen, J. Hein. Pfold: RNA secondary structure prediction using stochastic context-free grammars. Nucleic Acids Researchs. 31(13). 2003. 3423–3428.

[202] B. Knudsen, J. Hein. RNA secondary structure prediction using stochastic context free grammars and evolutionary history. Bioinformatics. 15(6). 1999. 446–454.

[203] D. E. Knuth, J. Morris, V., R. Pratt. Fast pattern matching in strings. SIAM Journal on Computing. 6(2). 1977. 323–350.

[204] C. H. Koelbel, D. B. Loveman, R. S. Schreiber, G. Steele Jr., M. E. Zosel. The High Performance Fortran Handbook. The MIT Press. 1994.

[205] G. Krammer. Notes on the Mathematics of the PHIGS Output Pipeline. Computer Graphics Forum. 8(8). 1989. 219–226.

[206] A. D. Kshemkalyani, M. Singhal . Distributed Computing. Cambridge University Press. 2008.

[207] H. T. Kung, C. E. Leiserson . Systolic arrays (for VLSI), In I. S. Duff, G. W. Stewart (Eds.) Sparse Matrix Proceedings. SIAM . 1978. 256–282.

[208] C. T. Kwok, D. Weld. Planning to gather information, In Proceedings of AAAI 13th National Conference on Artificial Intelligence. 1996. 32–39.

[209] T. Lai, S. Sahni. Anomalies in parallel branch and bound algorithms. Communications of ACM . 27(6). 1984. 594–602.

[210] E. T. Lambrecht, S. Kambhampati, S. Gnanaprakasam. Optimizing recursive information gathering plans, In Proceedings of 16th International Joint Conference on Artificial Intelligence. 1999. 1204–1211.

[211] J. Lamperti. Stochastic Processes. Springer-Verlag. 1972.

[212] L. Lamport . A new solution of Dijkstra's concurrent programming problem. Communications of the ACM. 18(8). 1974. 453–455.

[213] L. Lamport . A fast mutual exclusion algorithm. ACM Transactions on Computers. 5(1). 1987. 1–11.

[214] L. Lamport, R. Shostak, M. Pease. The Byzantine generals problem. ACM Transactions on Programming Languages and Systems. 4(3). 1982. 382–401.

[215] G. Lancia. Integer programming models for computational biology problems. Journal of Computer Science and Technology. 19(1). 2004. 60–77.

[216] G. Landau, U. Vishkin. Eficient string matching with mismatches. Theoretical Computer Science. 43. 1986. 239–249.

[217] A. Law, W. Kelton . Simulation Modeling and Analysis. 3rd edition, McGraw-Hill Higher Education. 1976.

[218] F. T. Leighton . Introduction to Parallel Algorithms and Architectures: Arrays-Trees-Hypercubes. Morgan Kaufman Publishers. 1992.

[219] F. T. Leighton . Introduction to Parallel Algorithms and Architectures: Algorithms and VSLI. Morgan Kaufman Publishers. 2001.

[220] W. Leland, M. Taqqu, D. Wilson. On the self-similar nature of Ethernet traffic. Computer Communication Reviews. 23. 1993. 183–193.

[221] C. Leopold . Parallel and Distributed Computing, Wiley Series on Parallel and Distributed Computing. John Wiley & Sons. 2001.

[222] B. Lewis, D. J. Berg. Multithreaded Programming with Phtreads. Prentice Hall. 1998.

[223] D. Lipman, S. J. Altshuland, J. Kecioglu . A tool for multiple sequence alignment. Proc. Natl. Academy Science. 86. 1989. 4412–4415.

[224] M. Listanti, V. Eramo, R. Sabella. Architectural and Technological Issues for Future Optical Internet Networks. IEEE Communications Magazine. 8(9). 2000. 82–92.

[225] C. Lucchesi. Candidate keys for relations. Journal of of Computer and System Sciences. 17(2). 1978. 270–279.

[226] G. Lunter, I. Miklós, A. Drummond, J. L. Jensen, J. Hein. Bayesian phylogenetic inference under a statistical indel model. Lecture Notes in Bioinformatics. 2812. 2003. 228–244.

[227] G. Lunter, I. Miklós, Y. Song, J. Hein. An efficient algorithm for statistical multiple alignment on arbitrary phylogenetic trees. Journal of Computational Biology . 10(6). 2003. 869–889.

[228] N. A. Lynch . Distributed Algorithms. Morgan Kaufman Publisher. 2001 (5th edition).

[229] N. A. Lynch, M. J. Fischer. On describing the behavior and implementation of distributed systems. Theoretical Computer Science. 13(1). 1981. 17–43.

[230] R. Lyngso, C. N. S. Pedersen. RNA Pseudoknot Prediction in Energy Based Models. Journal of Computational Biology . 7(3/4). 2000. 409–428.

[231] R. Lyngso, M. Zuker, C. Pedersen. Fast evaluation of internal loops in RNA secondary structure prediction. Bioinformatics. 15(6). 1999. 440–445.

[232] D. Maier. Minimum covers in the relational database model. Journal of the ACM . 27(4). 1980. 664–674.

[233] D. Maier, A. O. Mendelzon, Y. Sagiv. Testing implications of data dependencies. ACM Transactions on Database Systems. 4(4). 1979. 455–469.

[234] B. Mandelbrot. The Fractal Geometry of Nature. W. H. Freeman . 1982.

[235] B. Mandelbrot, J. W. Van Ness . Fractional Brownian Motions, Fractional Noises and Applications. SIAM Review. 10. 1968. 422–437.

[236] R. L. Mattson, J. Gecsei, D. R. Slutz, I. Traiger. Evaluation Techniques for Storage Hierarchies. IBM Systems Journal. 9(2). 1970. 78–117.

[237] E. A. Maxwell. General Homogenous Coordinates in Space of Three Dimensions. Cambridge University Press. 1951.

[238] E. A. Maxwell. Methods of Plane Projective Geometry Based on the Use of General Homogenous Coordinates. Cambridge . 1946.

[239] McAfee . Sniffer Technologies. . 2004.

[240] J. S. McCaskill. The equilibrium partition function and base pair binding probabilities for RNA secondary structure. Biopolymers. 29. 1990. 1105–1119.

[241] B. Melamed . An overview of TES processes and modeling methodology, Lecture Notes in Computer Science, In L. Donatiello and A. R. Nelson (Eds.) Models and Techniques for Performance Evaluation of Computer and Communications Systems. Springer-Verlag. 1993. 359–393.

[242] I. M. Meyer, R. Durbin. Comparative ab initio prediction of gene structures using pair HMMs. Bioinformatics. 18(10). 2002. 1309–1318.

[243] I. M. Meyer, R. Durbin. Gene structure conservation aids similarity based gene prediction. Nucleic Acids Research. 32(2). 2004. 776–783.

[244] Sz. Mihnovskiy, N. Shor. Estimation of the page fault number in paged memory (in Russian). Kibernetika (Kiev). 1(5). 1965. 18–20.

[245] W. Miller, E. Myers . A file comparison program. Software – Practice and Experience. 15(11). 1985. 1025–1040.

[246] W. Miller, E. W. Myers . Sequence comparison with concave weighting functions. Bulletin of Mathematical Biology. 50. 1988. 97–120.

[247] T. Milo, D. Suciu . Index structures for path expressions, Lecture Notes in Computer Science, In 7th International Conference on Data Bases. Springer-Verlag. 1540. 1999. 277–295.

[248] S. Molnár, A. Vidács, A. Nilsson. Bottlenecks on the way towards characterization of network traffic: Estimation and interpretation of the Hurst parameter. (Conference papers). 1997.

[249] B. Morgenstern . DIALIGN 2: improvement of the segment-to-segment approach to multiple sequence alignment. Bioinformatics . 15. 1999. 211–218.

[250] B. Morgenstern, A. Dress, T. Werner. Multiple DNA and protein sequence alignment based on segment-to-segment comparison. Proc. Natl. Academy Science. 93. 1996. 12098–12103.

[251] B. Morgenstern, K. Frech, A. Dress, T. Werner. DIALIGN: Finding local similarities by multiple sequence alignment. Bioinformatics . 14. 1998. 290–294.

[252] S. N. Needleman, C. Wunch. A general method applicable to the search for similarities in the amino acid sequence of two proteins. Journal of Molecular Biology. 48. 1970. 443–453.

[253] M. F. Neuts. A versatile Markovian point process. Journal of Applied Probability . 18. 1979. 764–779.

[254] M. F. Neuts . Structured Stochastic Matrices of M/G/1 Type and Their Applications. Marcel Dekker . 1989.

[255] M. E. Newell, R. G. Newell, T. L. Sancha. A New Approach to the Shaded Picture Problem, In Proceedings of the ACM National Conference. 1972. 443–450.

[256] R. Nussinov, G. Pieczenk, J. Griggs, D. Kleitman. Algorithms for loop matching. SIAM Journal of Applied Mathematics. 35. 1978. 68–82.

[257] S. Oaks, H. Wong. Java Threads. O'Reilly. 1999.

[258] OpenMP Website. . 2007.

[259] OPNET . OPNET Modeler Documentation. . 2007.

[260] J. O'Rourke. Art Gallery Theorems and Algorithms. Oxford University Press. 1987.

[261] S. Owicki, D. Gries . An axiomatic proof technique for parallel programs I.. Acta Informatica . 6(4). 1976. 319–340.

[262] S. Owicki, L. Lamport . Proving liveness properties of concurrent programs. ACM Transactions on Programming Languages and Systems. 4(3). 1982. 455–495.

[263] L. Pachter, B. Sturmfels (Eds.). Algebraic Statistics for Computational Biology. Cambridge University Press. 2005.

[264] R. Page, E. Holmes. Molecular Evolution: a Phylogenetic Approach. Blackwell . 1998.

[265] R. Paige, R. Tarjan . Three partition refinement algorithms. SIAM Journal on Computing. 16(6). 1987. 973–989.

[266] C. Partridge. The end of simple traffic models. IEEE Network . 7(9). 1993.

[267] V. Paxson, S. Floyd. Wide-area traffic: The failure of Poisson modeling. IEEE/ACM Transactions on Networking . 3. 1995. 226–244.

[268] M. Pease, R. Shostak, L. Lamport . Reaching agreement in the presence of faults. Journal of the ACM . 27(2). 1980. 228–234.

[269] J. S. Pedersen, J. Hein. Gene finding with a hidden Markov model of genome structure and evolution. Bioinformatics. 19(2). 2003. 219–227.

[270] G. Peterson, J. Fischer. Economical solutions for the critical section problem in distributed Systems, In Proceedings of the 9th ACM Symposium on Theory of Computing. IEEE Computer Society Press. 1977. 91–97.

[271] S. Petrov. Finite axiomatization of languages for representation of system properties. Information Sciences. 47. 1989. 339–372.

[272] P. A. Pevzner, N. Jones . Bioinformatics Algorithms. The MIT Press. 2004.

[273] G. F. Pfister. In Search of Clusters. Prentice Hall. 1998 (2nd edition).

[274] N. Pisanti, M. Sagot. Further thoughts on the syntenic distance between genomes. Algorithmica . 34(2). 2002. 157–180.

[275] N. Polyzotis, M. N. Garofalakis . Statistical synopses for graph-structured XML databases, In Proceedings of the 2002 ACM SIGMOD international Conference on Management of Data. 2002. 358–369.

[276] R. Pottinger. MinCon: A scalable algorithm for answering queries using views. The VLDB Journal. 10(2). 2001. 182–198.

[277] R. Pottinger, A. Halevy . A scalable algorithm for answering queries using views, In Proceedings of Very Large Data Bases'00. 2000. 484–495.

[278] F. P. Preparata, M. I. Shamos. Computational Geometry: An Introduction. Springer-Verlag. 1985.

[279] T. Pupko, I. Peer, R. Shamir, D. Graur. A Fast Algorithm for Joint Reconstruction of Ancestral Amino Acid Sequences. Molecular Biology and Evolution. 17. 2000. 890–896.

[280] X. Qian. Query folding, In Proceedings of International Conference on Data Engineering. 1996. 48–55.

[281] P. Quinton . Automatic synthesis of systolic arrays from uniform recurrent equations. Proceedings of the 11th Annual International Symposium on Computer Architecture . 1984. 208–214.

[282] S. K. Rao . Regular iterative algorithms and their implementations on processor arrays. Doktori értekezés, Stanford University. 1985.

[283] R. Ravi, J. D. Kececioglu . Approximation algorithms for multiple sequence alignment under a fixed evolutionary tree. Discrete Applied Mathematics. 88(1-3). 1998. 355–366.

[284] K. Räihä, E. Ukkonen. The shortest common supersequence problem over binary alphabet is NP-complete. Theoretical Computer Science. 16. 1981. 187–198.

[285] P. Resnick, H. R. Varian. Recommender Systems. Communications of the ACM . 40(3). 1997. 56–58.

[286] A. Rényi. Probability Theory. Akadémiai Kiadó/North Holland Publ. House. 1970.

[287] E. Rivas, S. Eddy. A dynamic programming algorithm for RNA structure prediction including pseudoknots. Journal of Molecular Biology. 285(5). 1999. 2053–2068.

[288] S. Roch. A Short Proof that Phylogenetic Tree Reconstruction by Maximum Likelihood Is Hard. EEE Transactions on Computational Biology and Bioinformatics. 3(1). 2006. 92–94.

[289] D. F. Rogers, J. Adams. Mathematical Elements for Computer Graphics. McGraw-Hill Book Co.. 1989.

[290] S. H. Roosta. Parallel Processing and Parallel Algorithms. Springer-Verlag. 1999.

[291] S. N. Ross. Simulation. Academic Press. 2006.

[292] A. Sali, Sr., A. Sali . Generalized Dependencies in Relational Databases. Acta Cybernetica . 13. 1998. 431–438.

[293] J. Sameith. On the Generation of Alternative Solutions for Discrete Optimization Problems with Uncertain Data – An Experimental Analysis of the Penalty Method. . 2004.

[294] D. Sankoff. Minimal mutation trees of sequences. SIAM Journal of Applied Mathematics. 28. 1975. 35–42.

[295] L. A. Santaló. Integral Geometry and Geometric Probability. Addison-Wesley. 1976.

[296] N. Santoro. Design and Analysis of Distributed Algorithms. John Wiley & Sons, New York. 2006.

[297] A. Segall. Distributed network protocols. IEEE Transactions on Information Theory. IT-29(1). 1983. 23–35.

[298] R. Seidel. A Simple and Fast Incremental Randomized Algorithm for Computing Trapezoidal Decompositions and for Triangulating Polygons. Computational Geometry: Theory and Applications. 1(1). 1991. 51–64.

[299] P. H. Sellers. On the theory and computation of evolutionary distances. SIAM Journal of Applied Mathematics. 26. 1974. 787–793.

[300] B. Sharp. Implementing Subdivision Surface Theory. Game Developer. 7(2). 2000. 40–45.

[301] B. Sharp. Subdivision Surface Theory. Game Developer. 7(1). 2000. 34–42.

[302] I. Shindyalov, P. Bourne. Protein structure alignment by incremental combinatorial extension (CE) of the optimal path. Protein Engineering. 11(9). 1998. 739–747.

[303] A. Silberschatz, P. Galvin, G. Gagne . Applied Operating System Concepts. John Wiley & Sons. 2000.

[304] D. Sima, T. Fountain, P. Kacsuk . Advanced Computer Architectures: a Design Space Approach. Addison-Wesley Publishing Company. 1998 (2nd edition).

[305] T. F. Smith, M. S. Waterman . Identification of common molecular subsequences. Journal of Molecular Biology. 147. 1981. 195–197.

[306] J. L. Spouge. Fast optimal alignment. CABIOS. 7. 1991. 1–7.

[307] J. L. Spouge. Speeding up dynamic programming algorithms for finding optimal lattice paths. SIAM Journal of Applied Mathematics. 49. 1989. 1552–1566.

[308] L. J. Stockmeyer, A. R. Meyer . Word problems requiring exponential time, In Proceedings of the 28th Annual ACM Symposium on Theory of Computing. ACM Press. 1973. 1–9.

[309] I. Sutherland, G. Hodgeman. Reentrant Polygon Clipping. Communications of the ACM . 17(1). 1974. 32–42.

[310] L. Szécsi. An Effective kd-tree Implementation, In J. Lauder (Ed.) Graphics Programming Methods. Charles River Media. 2003. 315–326.

[311] L. Szirmay-Kalos (editor). Theory of Three Dimensional Computer Graphics . Akadémiai Kiadó. 1995.

[312] L. Szirmay-Kalos, G. Márton. Worst-case versus average-case complexity of ray-shooting. Computing . 61(2). 1998. 103–131.

[313] A. S. Tanenbaum . Computer Networks. Prentice Hall. 2004.

[314] A. S. Tanenbaum . Modern Operating Systems. Prentice Hall. 2001.

[315] A. S. Tanenbaum, M. van Steen . Distributed Systems. Principles and Paradigms. Prentice Hall. 2002.

[316] A. S. Tanenbaum, A. Woodhull. Operating Systems. Design and Implementation. Prentice Hall. 1997.

[317] M. Taqqu, W. Teverovsky, W. Willinger. Estimators for long-range dependence: an empirical study. Fractals . 3(4). 1995. 785–788.

[318] J. Tarhio, E. Ukkonen. A greedy approximation algorithm for constructing shortest common superstrings. Theoretical Computer Science. 57. 1988. 131–145.

[319] J. Teich, L. Thiele . Control generation in the design of processor arrays. International Journal of VLSI and Signal Processing. 3(2). 1991. 77–92.

[320] G. Tel . Introduction to Distributed Algorithms. Cambridge University Press. 2000 (2nd edition).

[321] B. Thalheim. Dependencies in Relational Databases. B. G. Teubner . 1991.

[322] J. D. Thompson, D. G. Higgins, T. J. Gibson. CLUSTAL W: improving the sensitivity of progressive multiple sequence alignment through sequence weighting, position-specific penalties and weight matrix choice. Nucleic Acids Research. 22. 1994. 4673–4680.

[323] I. Tinoco, O. Uhlenbeck, M. Levine. Estimation of secondary structure in ribonucleic acids. Nature. 230. 1971. 362–367.

[324] Top 500 Supercomputer Sites. . 2007.

[325] A. Tucker . Handbook of Computer Science. Chapman & Hall/CRC . 2004.

[326] Trusoft Intl Inc. . Benoit 1.1. Trusoft Intl Inc.. 2007.

[327] O. G. Tsatalos, M. C. Solomon, Y. Ioannidis. The GMAP: a versatile tool for physical data independence. The VLDB Journal. 5(2). 1996. 101–118.

[328] D. M. Tsou, P. C. Fischer. Decomposition of a relation scheme into Boyce–Codd normal form. SIGACT News. 14(3). 1982. 23–29.

[329] Y. Uemura, A. Hasegawa, Y. Kobayashi, T. Yokomori. Tree adjoining grammars for RNA structure prediction. Theoretical Computer Science. 210. 1999. 277–303.

[330] J. D. Ullman . Information integration using logical views, Lecture Notes in Computer Science, In Proceedings of ICDT'97. Springer-Verlag. 1186. 1997. 19–40.

[331] J. D. Ullman . Principles of Database and Knowledge Base Systems. Vol. 1. Computer Science Press. 1989 (2nd edition).

[332] E. Ukkonen . Algorithms for approximate string matching. Information and Control. 64. 1985. 100–118.

[333] E. Ukkonen . On approximate string matching. Lecture Notes in Computer Science. 158. 1984. 487–495.

[334] L. G. Valiant . A bridging model for parallel computation. Communications of the ACM . 33(8). 1990. 103–111.

[335] T. Várady, R. R. Martin, J. Cox. Reverse Engineering of Geometric Models - An Introduction. Computer-Aided Design . 29(4). 1997. 255–269.

[336] V. Vianu . A Web Odyssey: from Codd to XML, In Proceedings of the 20th Symposium on Principles of Database Systems. 2001. 1–5.

[337] L. Wang, T. Jiang. On the complexity of multiple sequence alignment. Journal of Computational Biology. 1. 1994. 337–348.

[338] J. Warren, H. Weimer. Subdivision Methods for Geometric Design: A Constructive Approach. Morgan Kaufmann Publishers. 2001.

[339] M. S. Waterman, T. F. Smithand, W. A. Beyer. Some biological sequence metrics. Advances in Mathematics. 20. 1976. 367–387.

[340] Web Dictionary of Cybernetics and Systems. . 2007.

[341] J. W. Weber, E. Myers . Human Whole Genome Shotgun Sequencing. Genome Research. 7. 1997. 401–409.

[342] W. Willinger, V. Paxson. Discussion of ''Heavy Tail Modeling and Teletraffic Data'' by S. R. Resnick. The Annals of Statistics . 25(5). 1997. 1805–1869.

[343] W. Willinger, M. Taqqu, R. Sherman, D. Wilson. Self-similarity through high-variability: statistical analysis of Ethernet LAN traffic at the source level. IEEE/ACM Transactions on Networking . 5. 1997. 71–86.

[344] W. Willinger, D. Wilson, W. Leland, M. Taqqu . On traffic measurements that defy traffic models (and vice versa): self-similar traffic modeling for high-speed networks. Connections. 8(11). 1994. 14–24.

[345] W. Winkler . Dependent percolation and colliding random walks. Random Structures & Algorithms. 16(1). 2000. 58–84.

[346] M. J. Wolfe. High Performance Compilers for Parallel Computing. Addison Wesley Longman. 1996.

[347] G. Wyvill, C. McPheeters, B. Wyvill. Data structure for soft objects. The Visual Computer. 4(2). 1986. 227–234.

[348] S. Wu, E. W. Myers, U. Manber, W. Miller. An Sequence Comparison Algorithm. Information Processing Letters. 35(6). 1990. 317–323.

[349] J. Wu, S.. On cost-optimal merge of two intransitive sorted sequences. International Journal of Foundations of Computer Science. 1(14). 2003. 99–106.

[350] J. Yang, K. Karlapalem, Q. Li. Algorithms for materialized view design in data warehousing environment, In Proceedings of Very Large Data Bases'97. 1997. 136–145.

[351] H. Z. Yang, P. A. Larson. Query transformation for PSJ-queries, In Proceedings of Very Large Data Bases'87. 1987. 245–254.

[352] K. Yi, H. He, I. Stanoi, J. Yang . Incremental maintenance of XML structural indexes, In Proceedings of the 2004 ACM SIGMOD International Conference on Management of Data. 2004. 491–502.

[353] C. Yu, D. Johnson. On the complexity of finding the set of candidate keys for a given set of functional dependencies, In Information Processing 74. North-Holland . 1974. 580–583.

[354] M. Zaharioudakis, R. Cochrane, G. Lapis, H. Pirahesh, M. Urata. Answering complex SQL queries using automatic summary tables, In Proceedings of SIGMOD'00. 2000. 105–116.

[355] B. Zalik, G. Clapworthy. A Universal Trapezoidation Algorithms for Planar Polygons. Computers and Graphics . 23(3). 1999. 353–363.

[356] C. Zaniolo. Analysis and Design of Relational Schemata for Database Systems. UCLA-Eng-7669. 1976.

[357] C. Zaniolo. A new normal form for the design of relational database schemata. ACM Transactions on Database Systems. 7. 1982. 489–499.

[358] E. Zehendner . Entwurf systolischer Systeme: Abbildung regulärer Algorithmen auf synchrone Prozessorarrays. B. G. Teubner Verlagsgesellschaft. 1996.