|
Journal Of Automata, Languages And Combinatorics
The ''Journal of Automata, Languages and Combinatorics'' (JALC) is a peer-reviewed scientific journal of computer science. It was established in 1965 as the ''Journal of Information Processing and Cybernetics'' (German: ''Elektronische Informationsverarbeitung und Kybernetik'') and obtained its current title in 1996 with volume numbering reset to 1. The main focus of the journal is on automata theory, formal language theory, and combinatorics. The editor-in-chief of the journal was, until 2015, Jürgen Dassow of the Otto von Guericke University of Magdeburg. From 2016, the editors in chief are Markus Holzer and Martin Kutrib, and the publication is handled by the Institute of Informatics at the University of Giessen. Bibliographic databases indexing the journal include the ACM Guide to Computing Literature, the Digital Bibliography & Library Project, the MathSciNet database, and the Zentralblatt MATH. Most cited articles According to Google Scholar, the following articles h ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Computer Science
Computer science is the study of computation, automation, and information. Computer science spans theoretical disciplines (such as algorithms, theory of computation, information theory, and automation) to Applied science, practical disciplines (including the design and implementation of Computer architecture, hardware and Computer programming, software). Computer science is generally considered an area of research, academic research and distinct from computer programming. Algorithms and data structures are central to computer science. The theory of computation concerns abstract models of computation and general classes of computational problem, problems that can be solved using them. The fields of cryptography and computer security involve studying the means for secure communication and for preventing Vulnerability (computing), security vulnerabilities. Computer graphics (computer science), Computer graphics and computational geometry address the generation of images. Progr ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
ACM Guide To Computing Literature
ACM Guide to Computing Literature is a database, published by the Association for Computing Machinery (ACM), that categorizes and abstracts most computing literature. It contains citations to all ACM publications, as well as literature from other publishers. The Guide was also published in print from 1977 until 1997. All of the citations included in the printed Guide from 1987 through 1997 are included in the online database; citations from print issues of the Guide published prior to 1987 are not necessarily found in the online version. The Guide is not to be confused with the ACM Digital Library. The Digital Library provides complete texts of journals, magazines and conferences sponsored or published by ACM. See also * Association for Computing Machinery * ACM Digital Library * ''ACM Computing Reviews ''ACM Computing Reviews'' (''CR'') is a scientific journal that reviews literature in the field of computer science. It is published by the Association for Computing Machinery ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Publications Established In 1996
To publish is to make content available to the general public.Berne Convention, article 3(3) URL last accessed 2010-05-10.Universal Copyright Convention, Geneva text (1952), article VI . URL last accessed 2010-05-10. While specific use of the term may vary among countries, it is usually applied to text, images, or other audio-visual content, including paper ( |
Theoretical Computer Science
Theoretical computer science (TCS) is a subset of general computer science and mathematics that focuses on mathematical aspects of computer science such as the theory of computation, lambda calculus, and type theory. It is difficult to circumscribe the theoretical areas precisely. The Association for Computing Machinery, ACM's ACM SIGACT, Special Interest Group on Algorithms and Computation Theory (SIGACT) provides the following description: History While logical inference and mathematical proof had existed previously, in 1931 Kurt Gödel proved with his incompleteness theorem that there are fundamental limitations on what statements could be proved or disproved. Information theory was added to the field with a 1948 mathematical theory of communication by Claude Shannon. In the same decade, Donald Hebb introduced a mathematical model of Hebbian learning, learning in the brain. With mounting biological data supporting this hypothesis with some modification, the fields of n ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Computer Science Journals
A computer is a machine that can be programmed to carry out sequences of arithmetic or logical operations (computation) automatically. Modern digital electronic computers can perform generic sets of operations known as programs. These programs enable computers to perform a wide range of tasks. A computer system is a nominally complete computer that includes the hardware, operating system (main software), and peripheral equipment needed and used for full operation. This term may also refer to a group of computers that are linked and function together, such as a computer network or computer cluster. A broad range of industrial and consumer products use computers as control systems. Simple special-purpose devices like microwave ovens and remote controls are included, as are factory devices like industrial robots and computer-aided design, as well as general-purpose devices like personal computers and mobile devices like smartphones. Computers power the Internet, which links ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Gheorghe Păun
Gheorghe Păun (; born December 6, 1950, in Cicănești, Argeș County) is a computer scientist from Romania, prominent for work on membrane computing and the P system. Păun studied mathematics at the University of Bucharest, obtaining an MSc. in 1974 and a PhD in 1977 under the direction of Solomon Marcus. He has been a researcher at the Institute of Mathematics of the Romanian Academy since 1990. Păun was elected a member of the Academia Europaea The Academia Europaea is a pan-European Academy of Humanities, Letters, Law, and Sciences. The Academia was founded in 1988 as a functioning Europe-wide Academy that encompasses all fields of scholarly inquiry. It acts as co-ordinator of Europea ... in 2006, and a titular member of the Romanian Academy in 2012. He supervised the PhD thesis of 5 students. In 2016, he was awarded the title of ''Doctor Honoris Causa Scientiarum''. References External links Gheorghe Paun's webpage Theoretical computer scientists Romanian bioi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Shortest-distance Problems
In graph theory, the shortest path problem is the problem of finding a path between two vertices (or nodes) in a graph such that the sum of the weights of its constituent edges is minimized. The problem of finding the shortest path between two intersections on a road map may be modeled as a special case of the shortest path problem in graphs, where the vertices correspond to intersections and the edges correspond to road segments, each weighted by the length of the segment. Definition The shortest path problem can be defined for graphs whether undirected, directed, or mixed. It is defined here for undirected graphs; for directed graphs the definition of path requires that consecutive vertices be connected by an appropriate directed edge. Two vertices are adjacent when they are both incident to a common edge. A path in an undirected graph is a sequence of vertices P = ( v_1, v_2, \ldots, v_n ) \in V \times V \times \cdots \times V such that v_i is adjacent to v_ for 1 \leq i ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Mehryar Mohri
Mehryar Mohri is a Professor and theoretical computer scientist at the Courant Institute of Mathematical Sciences. He is also a Research Director at Google Research where he heads the Learning Theory team. Career Prior to joining the Courant Institute, Mohri was a Research Department Head and later Technology Leader at AT&T Bell Labs, where he was a Member of the Technical Staff for about ten years. Mohri has also taught as an Assistant Professor at the University of Paris 7 (1992-1993) and Ecole Polytechnique (1992-1994). Research Mohri's main area of research is machine learning, in particular learning theory. He is also an expert in automata theory and algorithms. He is the author of several core algorithms that have served as the foundation for the design of many deployed speech recognition and natural language processing systems. Publications Mohri is the author of the reference book Foundations of Machine Learning used as a textbook in many graduate-level machine learni ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Google Scholar
Google Scholar is a freely accessible web search engine that indexes the full text or metadata of scholarly literature across an array of publishing formats and disciplines. Released in beta in November 2004, the Google Scholar index includes peer-reviewed online academic journals and books, conference papers, theses and dissertations, preprints, abstracts, technical reports, and other scholarly literature, including court opinions and patents. Google Scholar uses a web crawler, or web robot, to identify files for inclusion in the search results. For content to be indexed in Google Scholar, it must meet certain specified criteria. An earlier statistical estimate published in PLOS One using a mark and recapture method estimated approximately 80–90% coverage of all articles published in English with an estimate of 100 million.''Trend Watch'' (2014) Nature 509(7501), 405 – discussing Madian Khabsa and C Lee Giles (2014''The Number of Scholarly Documents on the Public Web'' ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Zentralblatt MATH
zbMATH Open, formerly Zentralblatt MATH, is a major reviewing service providing reviews and abstracts for articles in pure and applied mathematics, produced by the Berlin office of FIZ Karlsruhe – Leibniz Institute for Information Infrastructure GmbH. Editors are the European Mathematical Society, FIZ Karlsruhe, and the Heidelberg Academy of Sciences. zbMATH is distributed by Springer Science+Business Media. It uses the Mathematics Subject Classification codes for organising reviews by topic. History Mathematicians Richard Courant, Otto Neugebauer, and Harald Bohr, together with the publisher Ferdinand Springer, took the initiative for a new mathematical reviewing journal. Harald Bohr worked in Copenhagen. Courant and Neugebauer were professors at the University of Göttingen. At that time, Göttingen was considered one of the central places for mathematical research, having appointed mathematicians like David Hilbert, Hermann Minkowski, Carl Runge, and Felix Klein, the great ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
MathSciNet
MathSciNet is a searchable online bibliographic database created by the American Mathematical Society in 1996. It contains all of the contents of the journal ''Mathematical Reviews'' (MR) since 1940 along with an extensive author database, links to other MR entries, citations, full journal entries, and links to original articles. It contains almost 3.6 million items and over 2.3 million links to original articles. Along with its parent publication ''Mathematical Reviews'', MathSciNet has become an essential tool for researchers in the mathematical sciences. Access to the database is by subscription only and is not generally available to individual researchers who are not affiliated with a larger subscribing institution. For the first 40 years of its existence, traditional typesetting was used to produce the Mathematical Reviews journal. Starting in 1980 bibliographic information and the reviews themselves were produced in both print and electronic form. This formed the basis of ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Digital Bibliography & Library Project
DBLP is a computer science bibliography website. Starting in 1993 at Universität Trier in Germany, it grew from a small collection of HTML files and became an organization hosting a database and logic programming bibliography site. Since November 2018, DBLP is a branch of Schloss Dagstuhl – Leibniz-Zentrum für Informatik (LZI). DBLP listed more than 5.4 million journal articles, conference papers, and other publications on computer science in December 2020, up from about 14,000 in 1995 and 3.66 million in July 2016. All important journals on computer science are tracked. Proceedings papers of many conferences are also tracked. It is mirrored at three sites across the Internet. For his work on maintaining DBLP, Michael Ley received an award from the Association for Computing Machinery (ACM) and the VLDB Endowment Special Recognition Award in 1997. Furthermore, he was awarded the ACM Distinguished Service Award for "creating, developing, and curating DBLP" in 2019. ''DBLP'' ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
