![]() |
||
When: Apr 22, 2023 - Apr 23, 2023 Submission Deadline: Feb 16, 2023 | ||
CALL FOR PAPERS • 8th International Conference on Complexity, Future Information Systems and Risk COMPLEXIS • website: https://complexis.scitevents.org • April 22 - 23, 2023 Prague,... | ||
INFORMATION TECHNOLOGY COMPUTATIONAL INTELLIGENCE COMPLEXITY COMPUTER SCIENCE | ||
![]() |
||
When: May 24, 2022 - Jul 31, 2023 Submission Deadline: Aug 31, 2022 | ||
We are seeking contributors for an edited collection of scholarly essays on these recent changes in the complexity of time-travel media (film, television, gaming, or literature). Submissions that are... | ||
HUMANITIES INTERDISCIPLINARY FILM POPULAR CULTURE | ||
![]() FUN 2022 : Fun with AlgorithmsSicily, Italy |
||
When: May 30, 2022 - Jun 3, 2022 Submission Deadline: Feb 18, 2022 | ||
FUN is a series of conferences dedicated to the use, design, and analysis of algorithms and data structures, focusing on results that provide amusing, witty but nonetheless original and scientificall... | ||
ALGORITHMS COMPLEXITY THEORY GAMES | ||
![]() |
||
When: Jul 4, 2022 - Jul 4, 2022 Submission Deadline: May 20, 2022 | ||
**************************************** • STRUCTURE MEETS POWER 2022 • (an ICALP workshop) • Call for Contributions • **************************************** • Worksho... | ||
FINITE MODEL THEORY SEMANTICS DESCRIPTIVE COMPLEXITY MATHEMATICAL LOGIC | ||
![]() LearnAut 2022 : Learning & Automata 2022Paris, France |
||
When: Jul 4, 2022 - Jul 4, 2022 Submission Deadline: Apr 7, 2022 | ||
Learning models defining recursive computations, like automata and formal grammars, are the core of the field called Grammatical Inference (GI). The expressive power of these models and the complexit... | ||
MACHINE LEARNING FORMAL METHODS COMPLEXITY PROGRAMMING LANGUAGES | ||
![]() CCCG 2022 : 34th Canadian Conference on Computational GeometryToronto, Ontario, Canada |
||
When: Aug 25, 2022 - Aug 27, 2022 Submission Deadline: May 1, 2022 | ||
The Canadian Conference on Computational Geometry (CCCG) is a forum to disseminate and discuss new theoretical and applied results in discrete and computational geometry. CCCG focuses on the design o... | ||
GEOMETRY ALGORITHMS COMPLEXITY THEORY | ||
![]() ESA 2022 : European Symposium on AlgorithmsPotsdam, Germany |
||
When: Sep 5, 2022 - Sep 9, 2022 Submission Deadline: Apr 21, 2022 | ||
Scope • The European Symposium on Algorithms (ESA) is one of the premier conferences on algorithms. It is organized in collaboration with the European Association for Theoretical Computer Scien... | ||
ALGORITHMS COMPLEXITY ANALYSIS OF ALGORITHMS ALGORITHM ENGINEERING | ||
![]() SWAT 2022 : Scandinavian Workshop on Algorithm TheoryFaroe Islands |
||
When: Jun 27, 2022 - Jun 29, 2022 Submission Deadline: Feb 14, 2022 | ||
SWAT 2022: • 18th Scandinavian Symposium and Workshops on Algorithm Theory • Vestarabryggja 15, Torshavn, Faroe Islands, June 27-29, 2022 • (Read about the 2020 event here: https://... | ||
ALGORITHMS THEORY COMPLEXITY COMPUTATION | ||
![]() CCCG 2021 : Canadian Conference on Computational GeometryHalifax, Nova Scotia, Canada |
||
When: Aug 10, 2021 - Aug 12, 2021 Submission Deadline: May 07, 2021 | ||
The Canadian Conference on Computational Geometry (CCCG) is a forum to disseminate and discuss new theoretical and applied results in discrete and computational geometry. CCCG focuses on the... | ||
GEOMETRY THEORY ALGORITHMS COMPLEXITY | ||
![]() |
||
When: Jun 21, 2021 - Jun 24, 2021 Submission Deadline: Feb 15, 2021 | ||
DCFS is an annual international working conference concerning the descriptional complexity of formal systems and structures (and its applications). Topics of interest are related to all aspects of des... | ||
COMPUTER SCIENCE NLP | ||
![]() |
||
When: Dec 07, 2020 - Dec 09, 2020 Submission Deadline: Nov 15, 2020 | ||
AQIS ’20 will focus on quantum information processing, communication and cryptography, an interdisciplinary field bridging quantum physics, computer science, mathematics, and information technol... | ||
COMPUTATION & SIMULATION ALGORITHMS & COMPLEXITY QUANTUM INFORMATION THEORY QUANTUM CRYPTOGRAPHY | ||
![]() STACS 2021 : Symposium on Theoretical Aspects of Computer ScienceSaarbrücken, Germany |
||
When: Mar 16, 2021 - Mar 19, 2021 Submission Deadline: Oct 05, 2020 | ||
... | ||
ALGORITHMS COMPLEXITY THEORY | ||
![]() |
||
Submission Deadline: Jun 15, 2020 | ||
The 22nd International Conference on Descriptional Complexity of Formal Systems (DCFS 2020) was expected to be organized by Rudolf Freund at the TU Wien as part of the Summer of Formal Languages 2020 ... | ||
FORMAL SYSTEMS | ||
![]() |
||
When: Jun 22, 2020 - Jun 24, 2020 Submission Deadline: Feb 14, 2020 | ||
SWAT 2020 conference registrations and additional services including accommodation and excursion are handled by GreenGate here. The Scandinavian Symposium and Workshops on Algorithm Theory (SW... | ||
ALGORITHMS THEORY COMPLEXITY | ||
![]() |
||
When: Nov 16, 2020 - Nov 19, 2020 Submission Deadline: Apr 09, 2020 | ||
... | ||
ALGORITHMS THEORY COMPLEXITY | ||
![]() |
||
When: May 22, 2020 - May 27, 2020 Submission Deadline: Feb 15, 2020 | ||
The series of International Conferences on Logic for Programming, Artificial Intelligence and Reasoning (LPAR) is a forum where, year after year, some of the most renowned researchers in the... | ||
ARTIFICIAL INTELLIGENCE LOGIC PROGRAMMING COMPUTATIONAL COMPLEXITY SYSTEMS ENGINEERING | ||
![]() CCCG 2020 : Canadian Conference on Computational GeometrySaskatchewan, Canada |
||
When: Aug 05, 2020 - Aug 07, 2020 Submission Deadline: Apr 20, 2020 | ||
The 32nd Canadian Conference on Computational Geometry (CCCG 2020) will be held in Saskatoon, Saskatchewan, Canada on August 5-7, 2020, at the University of Saskatchewan. The Canadian Conference on Co... | ||
GEOMETRY ALGORITHMS COMPLEXITY THEORY | ||
![]() |
||
When: Mar 02, 2020 - Mar 06, 2020 Submission Deadline: Oct 18, 2019 | ||
AIMS: • LATA is a conference series on theoretical computer science and its applications. LATA 2020 will reserve significant room for young scholars at the beginning of their career. It will aim ... | ||
AUTOMATA FORMAL LANGUAGES THEORETICAL COMPUTER SCIENCE COMPUTATIONAL COMPLEXITY | ||
![]() |
||
When: Mar 10, 2020 - Mar 13, 2020 Submission Deadline: Sep 30, 2019 | ||
Authors are invited to submit papers presenting original and unpublished research on theoretical aspects of computer science. • Typical areas include (but are not limited to): • Algorithms... | ||
ALGORITHMS COMPLEXITY THEORY | ||
![]() |
||
When: Sep 6, 2019 - Sep 8, 2019 Submission Deadline: Jun 28, 2019 | ||
The series of the Japan Conference on Discrete and Computational Geometry, Graphs, and Games (JCDCG3) has been held annually since 1997, except for 2008. The 22nd conference JCDCG3 2019 will be held o... | ||
ALGORITHMS COMPLEXITY GAMES GEOMETRY | ||
![]() |
||
When: Dec 13, 2019 - Dec 15, 2019 Submission Deadline: Aug 7, 2019 | ||
The 13th Annual International Conference on Combinatorial Optimization and Applications (COCOA 2019) will be held during December 13-15, 2019 in Xiamen, FuJian, China. Original research papers in the ... | ||
THEORY ALGORITHMS COMPLEXITY COMBINATORICS | ||
![]() |
||
When: Dec 8, 2019 - Dec 11, 2019 Submission Deadline: Jun 30, 2019 | ||
• About ISAAC • The 30th International Symposium on Algorithms and Computation (ISAAC 2019) will take place in Shanghai, China on December 8-11, 2019. The symposium is intended to provide ... | ||
ALGORITHMS THEORY COMPLEXITY | ||
![]() |
||
When: Jan 5, 2020 - Jan 8, 2020 Submission Deadline: Jul 5, 2019 | ||
... | ||
ALGORITHMS THEORY COMPLEXITY | ||
![]() |
||
When: Aug 7, 2019 - Aug 10, 2019 Submission Deadline: Apr 26, 2019 | ||
Authors are invited to submit papers describing original research of theoretical or practical significance in computational, combinatorial and discrete geometry, as well as related areas. Submissions ... | ||
GEOMETRY ALGORITHMS COMPLEXITY THEORY | ||
![]() Complexity and Model Theory 2019 : Russian Workshop on Complexity and Model Theory9 Institutskiy per., Dolgoprudny, Moscow |
||
When: Jun 9, 2019 - Jun 11, 2019 Submission Deadline: Mar 1, 2019 | ||
The workshop will take place at the Moscow Institute of Physics and Technology. • The aim of the workshop is to bring together specialists in computational complexity, communication complexity, ... | ||
COMMUNICATION COMPLEXITY COMPUTATIONAL COMPLEXITY DESCRIPTIVE COMPLEXITY CRYPTOGRAPHY | ||
![]() |
||
When: Sep 5, 2021 - Sep 8, 2021 Submission Deadline: TBD | ||
... | ||
THEORETICAL COMPUTER SCIENCE ALGORITHMS COMPLEXITY FORMAL METHODS | ||
![]() |
||
When: Jun 3, 2019 - Jun 7, 2019 Submission Deadline: Jan 14, 2019 | ||
• Aim and scope • The International Conference on Unconventional Computation and Natural Computation (UCNC) is a meeting where scientists from many different backgrounds are united in thei... | ||
ALGORITHMS COMPLEXITY MOLECULAR COMPUTING BIOLOGY | ||
![]() |
||
When: Apr 29, 2019 - May 3, 2019 Submission Deadline: Jan 7, 2019 | ||
The International Frontiers of Algorithmics Workshop (FAW) provides a focused forum on current trends of research on algorithms, discrete structures, operation research, combinatorial optimization and... | ||
ALGORITHMICS COMPLEXITY OPERATION RESEARCH COMBINATORIAL OPTIMIZATION | ||
![]() |
||
When: Jul 18, 2019 - Jul 20, 2019 Submission Deadline: Feb 19, 2019 | ||
CCC'19: Call for Papers • Submission Deadline: Tuesday, February 19, 2019, 5:00pm EST • Scope • The conference seeks original research papers in all areas of computational complexity... | ||
THEORY COMPLEXITY ALGORITHMS | ||
![]() |
||
When: Jul 29, 2019 - Jul 31, 2019 Submission Deadline: Feb 28, 2019 | ||
8th International Conference on Simulation and Modeling Methodologies, Technologies and Applications SIMULTECH • website: http://www.simultech.org/ • July 29 - 31, 2019 Prague, Czech Repub... | ||
SIMULATION ENERGY FORMAL METHODS COMPLEXITY | ||
Find and Compare Upcoming Complexity Events. Check Important Dates, Venue, Speaker, Location, Address, Exhibitor Information, Timing, Schedule, Discussion Topics, Agenda, Visitors Profile, and Other Important Details.