|
List Of Computer Science Conferences
This is a list of academic conferences in computer science. Only conferences with separate articles are included; within each field, the conferences are listed alphabetically by their short names. General * FCRC – Federated Computing Research Conference Algorithms and theory Conferences accepting a broad range of topics from theoretical computer science, including algorithms, data structures, computability, computational complexity, automata theory and formal languages: * CCC - Computational Complexity Conference * FCT – International Symposium on Fundamentals of Computation Theory * FOCS – IEEE Symposium on Foundations of Computer Science * ICALP – International Colloquium on Automata, Languages and Programming * ISAAC – International Symposium on Algorithms and Computation * MFCS – International Symposium on Mathematical Foundations of Computer Science * STACS – Symposium on Theoretical Aspects of Computer Science * STOC – ACM Symposium on Theor ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Academic Conference
An academic conference or scientific conference (also congress, symposium, workshop, or meeting) is an Convention (meeting), event for researchers (not necessarily academics) to present and discuss their scholarly work. Together with academic journal, academic or scientific journals and preprint archives, conferences provide an important channel for exchange of information between researchers. Further benefits of participating in academic conferences include learning effects in terms of presentation skills and "academic Habitus (sociology), habitus", receiving feedback from peers for one's own research, the possibility to engage in informal communication with peers about work opportunities and collaborations, and getting an overview of current research in one or more Academic discipline, disciplines. The first international academic conferences and congresses appeared in 19th century. Overview Conferences usually encompass various presentations. They tend to be short and conci ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Symposium On Theory Of Computing
The Annual ACM Symposium on Theory of Computing (STOC) is an academic conference in the field of theoretical computer science. STOC has been organized annually since 1969, typically in May or June; the conference is sponsored by the Association for Computing Machinery special interest group SIGACT. Acceptance rate of STOC, averaged from 1970 to 2012, is 31%, with the rate of 29% in 2012. As writes, STOC and its annual IEEE counterpart FOCS (the Symposium on Foundations of Computer Science) are considered the two top conferences in theoretical computer science, considered broadly: they “are forums for some of the best work throughout theory of computing that promote breadth among theory of computing researchers and help to keep the community together.” includes regular attendance at STOC and FOCS as one of several defining characteristics of theoretical computer scientists. Awards The Gödel Prize for outstanding papers in theoretical computer science is presented alternate ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
International Conference On Developments In Language Theory
DLT, the International Conference on Developments in Language Theory is an academic conference in the field of computer science held annually under the auspices of the European Association for Theoretical Computer Science. Like most theoretical computer science conferences its contributions are strongly peer-reviewed; the articles appear in proceedings published in Springer Lecture Notes in Computer Science. Extended versions of selected papers of each year's conference appear in international journals, such as Theoretical Computer Science and International Journal of Foundations of Computer Science. Topics of the conference Typical topics include: * grammars, acceptors and transducers for words, trees and graphs * algebraic theories of automata * algorithmic, combinatorial and algebraic properties of words and languages * variable length codes * symbolic dynamics * cellular automata * polyominoes and multidimensional patterns * decidability questions * image manipulation an ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
International Workshop On Descriptional Complexity Of Formal Systems
DCFS, the International Workshop on Descriptional Complexity of Formal Systems is an annual academic conference in the field of computer science. Beginning with the 2011 edition, the proceedings of the workshop appear in the series Lecture Notes in Computer Science. Already since the very beginning, extended versions of selected papers are published as special issues of the International Journal of Foundations of Computer Science, the Journal of Automata, Languages and Combinatorics, of Theoretical Computer Science, and of Information and Computation In 2002 DCFS was the result of the merger of the workshops DCAGRS (Descriptional Complexity of Automata, Grammars and Related Structures) and FDSR (Formal Descriptions and Software Reliability). The workshop is often collocated with international conferences in related fields, such as ICALP, DLT and CIAA. Topics of the workshop Typical topics include: * various measures of descriptional complexity of automata, grammars, langua ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
International Conference On Implementation And Application Of Automata
CIAA, the International Conference on Implementation and Application of Automata is an annual academic conference in the field of computer science. Its purpose is to bring together members of the academic, research, and industrial community who have an interest in the theory, implementation, and application of automata and related structures. There, the conference concerns research on all aspects of implementation and application of automata and related structures, including theoretical aspects. In 2000, the conference grew out of the Workshop on Implementation of Automata (WIA). Like most theoretical computer science conferences its contributions are strongly peer-reviewed; the articles appear in proceedings published in Springer Lecture Notes in Computer Science. Extended versions of selected papers of each year's conference alternatingly appear in the journals Theoretical Computer Science and International Journal of Foundations of Computer Science. Every year a best paper awa ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
International Conference On Rewriting Techniques And Applications
Rewriting Techniques and Applications (RTA) is an annual international academic conference on the topic of rewriting. It covers all aspects of rewriting, including termination, equational reasoning, theorem proving, higher-order rewriting, unification and the lambda calculus. The conference consists of peer-reviewed papers with the proceedings published by Springer in the LNCS series until 2009, and since then in the LIPIcs series published by the Leibniz-Zentrum für Informatik. Several rewriting-related workshops are also affiliated with RTA. The first RTA was held in Dijon, France France, officially the French Republic, is a country located primarily in Western Europe. Overseas France, Its overseas regions and territories include French Guiana in South America, Saint Pierre and Miquelon in the Atlantic Ocean#North Atlan ... in September 1983. RTA took part in the federated conferences Federated Logic Conference (FLoC) and Rewriting, Deduction, and Programming (RDP). ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Symposium On Logic In Computer Science
The ACM–IEEE Symposium on Logic in Computer Science (LICS) is an annual academic conference on the theory and practice of computer science in relation to mathematical logic. Extended versions of selected papers of each year's conference appear in renowned international journals such as Logical Methods in Computer Science and ACM Transactions on Computational Logic. History LICS was originally sponsored solely by the IEEE, but as of the 2014 founding of the ACM Special Interest Group on Logic and Computation LICS has become the flagship conference of SIGLOG, under the joint sponsorship of ACM and IEEE. From the third installment in 1988 until 2013, the cover page of the conference proceedings has featured an artwork entitled ''Irrational Tiling by Logical Quantifiers'', by Alvy Ray Smith. Since 1995, each year the '' Kleene award'' is given to the best student paper. In addition, since 2006, the ''LICS Test-of-Time Award'' is given annually to one among the twenty-year-old L ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Symposium On Computational Geometry
The International Symposium on Computational Geometry (SoCG) is an academic conference in computational geometry. Today its acronym is pronounced "sausage." It was founded in 1985, with the program committee consisting of David Dobkin, Joseph O'Rourke, Franco Preparata, and Godfried Toussaint; O'Rourke was the conference chair. The symposium was originally sponsored by the SIGACT and SIGGRAPH Special Interest Groups of the Association for Computing Machinery (ACM). It dissociated from the ACM in 2014, motivated by the difficulties of organizing ACM conferences outside the United States and by the possibility of turning to an open-access system of publication. Since 2015 the conference proceedings have been published by the Leibniz International Proceedings in Informatics Dagstuhl is a computer science research center in Germany, located in and named after a district of the town of Wadern, Merzig-Wadern, Saarland. Location Following the model of the mathematical center at Mathema ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
International Symposium On Graph Drawing
The International Symposium on Graph Drawing (GD) is an annual academic conference in which researchers present peer reviewed papers on graph drawing, information visualization of Network theory, network information, geometric graph theory, and related topics. Significance The Graph Drawing symposia have been central to the growth and development of graph drawing as a research area: as Herman et al. write, "the Graph Drawing community grew around the yearly Symposia." Nguyen lists Graph Drawing as one of "several good conferences which directly or indirectly concern with information visualization", and Wong et al. report that its proceedings "provide a wealth of information". In a 2003 study the symposium was among the top 30% of computer science research publication venues, ranked by impact factor. History The first symposium was held in Marino, near Rome, Italy, in 1992, organized by Giuseppe Di Battista, Peter Eades, Pierre Rosenstiehl, and Roberto Tamassia. The first two sympo ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Graph Drawing
Graph drawing is an area of mathematics and computer science combining methods from geometric graph theory and information visualization to derive two-dimensional depictions of graph (discrete mathematics), graphs arising from applications such as social network analysis, cartography, linguistics, and bioinformatics. A drawing of a graph or network diagram is a pictorial representation of the vertex (graph theory), vertices and edge (graph theory), edges of a graph. This drawing should not be confused with the graph itself: very different layouts can correspond to the same graph., p. 6. In the abstract, all that matters is which pairs of vertices are connected by edges. In the concrete, however, the arrangement of these vertices and edges within a drawing affects its understandability, usability, fabrication cost, and aesthetics. The problem gets worse if the graph changes over time by adding and deleting edges (dynamic graph drawing) and the goal is to preserve the user's men ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
SWAT And WADS Conferences
WADS, the Algorithms and Data Structures Symposium, is an international academic conference in the field of computer science, focusing on algorithms and data structures.WADS web page WADS is held every second year, usually in and always in . It is held in alternation with its sister conference, the Scandinavian Symposium and Workshops on Algorithm Theory (SWAT), which is usually held in and always in |
