Our Group organises 3000+ Global Conferenceseries Events every year across USA, Europe & Asia with support from 1000 more scientific societies and Publishes 700+ Open Access Journals which contains over 50000 eminent personalities, reputed scientists as editorial board members.
Institute of Theoretical Computer Science is considers theoretical fundamentals of computer science. In this instate mainly focus on following topics. Computability and Complexity Theory, Graph Theory, Algorithmics and Records Arrangements, Logic, especially SAT-Solving, Arrangement Analysis and Data Compression, Bioinformatics, Quantum Computing, Cryptology. Institute of Theoretical Computer Science is also interested on other aspects of theoretical computer science. It is located in to Institut for Theoretische Informatik.This institute is affiliated from ULM university. Three types of staff are working for Institute of Theoretical Computer Science. Institute Staff, Research at the institute, Teaching at the institute. Institute staff: In this institute have 3 Proffessors, 1 Secretary, 8 Scientific Staff, 1Technical staff, 21 Former employees. Research at the institute: 11 Projects Funded by Research Grants Eg: Causality: an algorithmic framework and a computational complexity perspective, Complexity of Haplotyping Problems, Information Hiding: Complexity-theoretic Modelling and Analysis, Robust Inference and Compression, Average-case and Precision Complexity, Parallel Computing, Data Mining Tutor, Average-Case Analysis of Learning Problems, Robust Basic Routines for Efficient Parallel Processing, Clock Synchronization, Highly Available Services for Scalable Distributed Systems. Teaching at the institute : In the teaching institute 2 types of thesis. • Bachelor Thesis and Master thesis. Bachelor’s thesis Titles: Randomised Algorithms for Discrete Optimization Problems. Dynamic Stream Networks Exact Algorithms for Discrete Optimization Problems Construction of Severe Problem Instances for Combinatorial Algorithms Evolutionary / Genetic Algorithms for Discrete Optimization Problems Algorithms for analysis website traffic and generated web-tracking graphs Embedding Secret Information in Fax-Documents User privacy and anonymity in Bitcoin system Experimental Research of Solution Set of NAE-SAT Tools for analysis of the Bitcoin transaction graph Retrieval Strategy at Incomplete Information. Master’s thesis: The following topics and field of research for a Master Thesis. Authenticity Verification of Printed Documents Differential Privacy/ Private Computing Secret Telecommunication (Steganography) Error-Resistant Algorithms Efficient algorithms for learning causal structures / Bayesian networks Private Preserving Data Mining Algorithms for Discrete Optimization Problems at Incomplete Information Smoothed Analysis Private preserving causal inference Dynamic Algorithms for the Dominating-Set-Problem Realization and Test of a Randomised Algorithm to evaluate the Reliability of a Network Realization and Test of fast Techniques to evaluate the Editing-Distance Learning finite automata with membership and equivalence queries with applications in model checking Strongly undetectable algorithm-substitution attacks Algorithm-substitution attacks against signature schemes and symmetric encryption. Institute of Theoretical Computer Science Publications in 2017: Journal articles, Conference papers, PhD theses, Bachelors theses. Journal articles: Article on Epidimology. It is published in Oxford academic journal. Conference papers: AAAI Publications, Thirty-First AAAI Conference on Artificial Intelligence. This institute have following groups: Information Security and Cryptography Professor of Ueli Maurer Combinatorial Structures and Algorithms Professor of Angelika Steger Theory of Combinatorial Algorithms Professor of Emo Welzl Algorithms, Data Structures, and Applications Professor of Peter Widmayer.
Spanish 
Chinese 
Russian 
German 
French 
Japanese 
Portuguese 
Hindi