STACS-CONF.ORG

stacs2014.sciencesconf.org

Symposium on Theoretical Aspects of Computer Science 2014 - Sciencesconf.org

https://stacs2014.sciencesconf.org/page/customizable_page_4

Miniworkshop on Arithmetic Circuit Complexity. STACS 2014 CALL FOR PAPERS. 31st International Symposium on Theoretical Aspects of Computer Science. March 5 - March 8, 2014, Lyon, France. Submission Deadline: Sep 20, 2013 (23:59:59 GMT/UTC). Http:/ stacs2014.sciencesconf.org/. 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):. Automata and formal languages, games;. Joachim Niehren,...

fb-ginf.gi.de

FA Theoretische Informatik - Fachbereich Grundlagen der Informatik

http://fb-ginf.gi.de/fa-theoretische-informatik.html

Skip to the navigation. Skip to the content. Hauptseite der Gesellschaft für Informatik. Fachbereich Grundlagen der Informatik. Sie befinden sich hier:. Sprecher: Prof. Dr. Martin Dietzfelbinger. Gewählt bis zum 24.02.2019). Stellvertretender Sprecher: Prof. Dr. Thomas Schwentick. Gewählt bis zum 24.02.2019). Der Fachausschuss Theoretische Informatik ist ein Zusammenschluss der Fachgruppen. Automaten und Formale Sprachen (AFS),. Logik in der Informatik (LogInf).

stacs.loria.fr

Stacs 2010 - CFP

http://stacs.loria.fr/sponsors.html

27th International Symposium on Theoretical Aspects of Computer Science.

fg-afs.gi.de

Symposium on Theoretical Aspects of Computer Science - Fachgruppe Automaten und Formale Sprachen

http://fg-afs.gi.de/konferenzen/stacs.html

Skip to the navigation. Skip to the content. Hauptseite der Gesellschaft für Informatik. Symposium on Theoretical Aspects of Computer Science. Fachgruppe Automaten und Formale Sprachen. Sie befinden sich hier:. Der Fachausschuss Theoretische Informatik, zu dem die Fachgruppe Automaten und Formale Sprachen gehört, bildet gemeinsam mit einem analogen französischen Ausschuss das Lenkungskomitee der Tagung STACS.

stacs.loria.fr

Stacs 2010 - CFP

http://stacs.loria.fr/CFP.html

27th International Symposium on Theoretical Aspects of Computer Science. STACS 2010 will be held at LORIA. In Nancy, France, 4th-6th March 2010. Http:/ www.stacs-conf.org. Deadline for submissions : September, 22nd, 2009. Notification to authors : November, 26th 2009. Final Version : December, 18th 2009. STACS 2010 : March, 4th-6th 2010. Algorithms and data structures, including: parallel and distributed algorithms, computational geometry, cryptography, algorithmic learning theory;. The call for papers c...

cohenwang.com

Edith Cohen (Research Page)

http://www.cohenwang.com/edith

Edith Cohen's Research Page. I am a computer scientist. My research is motivated by challenges in managing and mining massive data sets, networks, and information systems. I am interested in modeling and in designing solutions which enhance performance and functionality. I prefer a principled approach and apply and develop tools from algorithms design, statistics, and optimization. I am always looking to learn more, do more, and expand my horizons. Publications and Research Overview. Scalable Mining of M...

cstheory.blogoverflow.com

TCS Conferences and Workshops « Stack Exchange Theoretical Computer Science Blog

http://cstheory.blogoverflow.com/theoretical-computer-science-conferences-and-workshops

Theoretical Computer Science Meta. Explore other Stack Exchange communities. TCS Conferences and Workshops. TCS Conferences and Workshops. Theoretical Computer Science Conferences and Workshops. The following is a list of conferences and workshops in theoretical computer science that were considered important to the CSTheory community. We will update this page periodically; in the meantime, please feel free to add to, or modify, the original community wiki question. On CSTheory about this topic. FCT, Fun...

stacs.loria.fr

Stacs 2010

http://stacs.loria.fr/AcceptedPapers.html

27th International Symposium on Theoretical Aspects of Computer Science. Rustem Takhanov. Dichotomy theorem for general Minimum Cost Homomorphisms Problem. Is Ramsey's theorem omega-automatic? Weakening Assumptions for Deterministic Subexponential Time Non-Singular Matrix Completion. And Csaba Toth. Long non-crossing configurations in the plane. Shiri Chechik and David Peleg. Fault Tolerant uncapacitated facility location. Alternation-Trading Proofs, Linear Programming, and Lower Bounds. Branching-time m...