The International Journal of Foundations of Computer Science is a computer science journal published by World Scientific. It was founded in 1990, covering...
2 KB (118 words) - 10:23, 14 March 2025
e-Collaboration International Journal of Foundations of Computer Science International Journal of High Performance Computing Applications International Journal of Image...
12 KB (1,065 words) - 05:25, 26 July 2025
Theoretical computer science is a subfield of computer science and mathematics that focuses on the abstract and mathematical foundations of computation...
42 KB (4,803 words) - 23:57, 1 June 2025
Computer Science and International Journal of Foundations of Computer Science. Every year a best paper award is presented. Since the focus of the conference...
10 KB (311 words) - 20:27, 15 April 2024
issues of the International Journal of Foundations of Computer Science, the Journal of Automata, Languages and Combinatorics, of Theoretical Computer Science...
12 KB (535 words) - 12:29, 30 August 2024
international journals, such as Theoretical Computer Science and International Journal of Foundations of Computer Science. Typical topics include: grammars, acceptors...
6 KB (550 words) - 12:22, 9 September 2024
Chaitin's constant (redirect from Omega (computer science))
In the computer science subfield of algorithmic information theory, a Chaitin constant (Chaitin omega number) or halting probability is a real number that...
18 KB (2,319 words) - 08:25, 6 July 2025
Depth-first search (redirect from Applications of depth-first search)
Rosenstiehl, P. (2006), "Trémaux Trees and Planarity", International Journal of Foundations of Computer Science, 17 (5): 1017–1030, arXiv:math/0610935, Bibcode:2006math...
20 KB (2,447 words) - 04:09, 23 July 2025
"Nondeterministic descriptional complexity of regular languages". International Journal of Foundations of Computer Science (Submitted manuscript). 14 (6): 1087–1102...
26 KB (3,375 words) - 06:31, 14 April 2025
"Hierarchies of generalized Kolmogorov complexities and nonenumerable universal measures computable in the limit". International Journal of Foundations of Computer...
48 KB (6,014 words) - 14:51, 27 July 2025
Znám's problem (section Number of solutions)
(2005), "Non-uniqueness and radius of cyclic unary NFAs", International Journal of Foundations of Computer Science, 16 (5): 883–896, doi:10.1142/S0129054105003352...
12 KB (1,476 words) - 10:45, 30 June 2025
Hypercomputation (redirect from Hyper-computer)
"Hierarchies of generalized Kolmogorov complexities and nonenumerable universal measures computable in the limit". International Journal of Foundations of Computer...
30 KB (3,369 words) - 19:26, 13 May 2025
techniques: an interesting algorithmic tool kit", International Journal of Foundations of Computer Science, 10 (2): 147–170, doi:10.1142/S0129054199000125...
11 KB (1,350 words) - 01:37, 19 June 2025
Symposium on Foundations of Computer Science in 2008, and the Presburger Award from the European Association for Theoretical Computer Science in 2012, for...
7 KB (521 words) - 12:24, 17 October 2024
Giorgio Ausiello (category Italian computer scientists)
the International Journal of Foundations of Computer Science, member of the editorial board of Computer Science Review. He has been elected member of Academia...
6 KB (623 words) - 19:48, 4 March 2025
nonenumerable universal measures computable in the limit". International Journal of Foundations of Computer Science. 13 (4): 587–612. arXiv:quant-ph/0011122. Bibcode:2000quant...
19 KB (2,308 words) - 05:24, 13 July 2025
FCT – International Symposium on Fundamentals of Computation Theory FOCS – IEEE Symposium on Foundations of Computer Science ICALP – International Colloquium...
15 KB (1,407 words) - 17:19, 24 July 2025
Non-monotonic logic (section Proof-theoretic versus model-theoretic formalizations of non-monotonic logics)
Theorems to the theory of minimal models.", International Journal of Foundations of Computer Science, 01 (1), World Scientific: 49–59, doi:10.1142/S0129054190000059...
11 KB (1,191 words) - 20:09, 24 May 2025
Computer graphics is a sub-field of computer science which studies methods for digitally synthesizing and manipulating visual content. Although the term...
14 KB (1,273 words) - 16:40, 15 March 2025
(Dec 2003). "A Formal Study of Practical Regular Expressions". International Journal of Foundations of Computer Science. 14 (6): 1007–1018. doi:10...
97 KB (8,871 words) - 08:15, 24 July 2025
History of software List of computer science awards List of computer science journals List of computer scientists List of Internet pioneers List of people...
68 KB (1,583 words) - 02:56, 21 July 2025
Computation in the limit (category Theory of computation)
nonenumerable universal measures computable in the limit", International Journal of Foundations of Computer Science, 2002, doi:10.1142/S0129054102001291. R. Soare...
9 KB (1,678 words) - 02:57, 26 July 2024
theoretical computer science. In essence, Solomonoff's induction derives the posterior probability of any computable theory, given a sequence of observed...
17 KB (2,113 words) - 12:48, 24 June 2025
This glossary of computer science is a list of definitions of terms and concepts used in computer science, its sub-disciplines, and related fields, including...
215 KB (23,980 words) - 18:58, 14 June 2025
Paul Vitányi (category Dutch computer scientists)
Letters; the International journal of Foundations of Computer Science; the Entropy; the Information; the SN Computer Science; the Journal of Computer and Systems...
7 KB (571 words) - 05:08, 28 May 2025
This list of computer science awards is an index to articles on notable awards related to computer science. It includes lists of awards by the Association...
34 KB (859 words) - 07:35, 25 May 2025
Logical framework (category Logic in computer science)
the λ Π {\displaystyle \lambda \Pi } -calculus. International Journal of Foundations of Computer Science 3(3), 333-378, 1992. Specific Logical Frameworks...
7 KB (965 words) - 21:53, 4 November 2023
Planar graph (redirect from Planar embedding of the graph)
Rosenstiehl, P. (2006), "Trémaux trees and planarity", International Journal of Foundations of Computer Science, 17 (5): 1017–1029, arXiv:math/0610935, doi:10...
36 KB (4,589 words) - 21:30, 18 July 2025
Carl Herbert Smith (category American computer scientists)
National Science Foundation's theoretical computer science program, and editor of the International Journal of the Foundations of Computer Science, Theoretical...
2 KB (166 words) - 05:36, 7 November 2024
Distance-hereditary graph (category Intersection classes of graphs)
Udi (2000), "On the clique-width of some perfect graph classes", International Journal of Foundations of Computer Science, 11 (3): 423–443, doi:10.1142/S0129054100000260...
19 KB (2,290 words) - 21:19, 17 October 2024