theory.cs.uni-bonn.de theory.cs.uni-bonn.de

theory.cs.uni-bonn.de

University of Bonn, CS Dept., Chair V: Homepage

Department of Computer Science. Welcome to the Homepage of Chair V. We are part of the Department of Computer Science. At the University of Bonn. Our research program is concerned with "Efficient Algorithms". Parallel and Distributed Computing". And "Combinatorial and Geometric Optimization". Members of Chair V. Special Year on Computational Complexity. Bonn Research Platform on Algorithmics. 3D Gale-Berlekamp Game (Demo). Sorting by Reversals (Demo). How to reach us. Compendium on Steiner Tree Problems.

http://theory.cs.uni-bonn.de/

WEBSITE DETAILS
SEO
PAGES
SIMILAR SITES

TRAFFIC RANK FOR THEORY.CS.UNI-BONN.DE

TODAY'S RATING

>1,000,000

TRAFFIC RANK - AVERAGE PER MONTH

BEST MONTH

January

AVERAGE PER DAY Of THE WEEK

HIGHEST TRAFFIC ON

Sunday

TRAFFIC BY CITY

CUSTOMER REVIEWS

Average Rating: 2.9 out of 5 with 8 reviews
5 star
1
4 star
1
3 star
4
2 star
0
1 star
2

Hey there! Start your review of theory.cs.uni-bonn.de

AVERAGE USER RATING

Write a Review

WEBSITE PREVIEW

Desktop Preview Tablet Preview Mobile Preview

LOAD TIME

0.5 seconds

FAVICON PREVIEW

  • theory.cs.uni-bonn.de

    16x16

CONTACTS AT THEORY.CS.UNI-BONN.DE

Login

TO VIEW CONTACTS

Remove Contacts

FOR PRIVACY ISSUES

CONTENT

SCORE

6.2

PAGE TITLE
University of Bonn, CS Dept., Chair V: Homepage | theory.cs.uni-bonn.de Reviews
<META>
DESCRIPTION
Department of Computer Science. Welcome to the Homepage of Chair V. We are part of the Department of Computer Science. At the University of Bonn. Our research program is concerned with Efficient Algorithms. Parallel and Distributed Computing. And Combinatorial and Geometric Optimization. Members of Chair V. Special Year on Computational Complexity. Bonn Research Platform on Algorithmics. 3D Gale-Berlekamp Game (Demo). Sorting by Reversals (Demo). How to reach us. Compendium on Steiner Tree Problems.
<META>
KEYWORDS
1 university of bonn
2 chair v
3 deutsche version
4 computational complexity
5 mathematical foundations
6 groups
7 lectures and seminars
8 project groups
9 projects
10 and research overview
CONTENT
Page content here
KEYWORDS ON
PAGE
university of bonn,chair v,deutsche version,computational complexity,mathematical foundations,groups,lectures and seminars,project groups,projects,and research overview,publications,lecture notes,excellence cluster,hausdorff research institute,workshops
SERVER
Apache/2.4.16 (Unix)
CONTENT-TYPE
iso-8859-1
GOOGLE PREVIEW

University of Bonn, CS Dept., Chair V: Homepage | theory.cs.uni-bonn.de Reviews

https://theory.cs.uni-bonn.de

Department of Computer Science. Welcome to the Homepage of Chair V. We are part of the Department of Computer Science. At the University of Bonn. Our research program is concerned with "Efficient Algorithms". Parallel and Distributed Computing". And "Combinatorial and Geometric Optimization". Members of Chair V. Special Year on Computational Complexity. Bonn Research Platform on Algorithmics. 3D Gale-Berlekamp Game (Demo). Sorting by Reversals (Demo). How to reach us. Compendium on Steiner Tree Problems.

INTERNAL PAGES

theory.cs.uni-bonn.de theory.cs.uni-bonn.de
1

CS Dept. V: Lecture Notes

http://theory.cs.uni-bonn.de/info5/publications/lectures-en.html

Department of Computer Science. Foundations of Theoretical Computer Science ("Einführung in die Informatik"). Marek Karpinski (ausgearbeitet von Mathias Hauptmann, Kai Werther und Thorsten Werther). Efficient Algorithms and Computational Complexity ("Effiziente Algorithmen und Komplexitätstheorie (Algebraische Interpolations- und Zählalgorithmen)"). Marek Karpinski (ausgearbeitet von Kai Werther). At the "Spring School on Approximation and Online Algorithms". University of Paris-Sud, May 18, 2001. Last u...

2

tsp

http://theory.cs.uni-bonn.de/info5/tsp

Approximation Taxonomy of Metric TSP. The list below presents the best up to now known upper and lower approximation bounds for the instances of metric TSP (we refer also to another source on approximation algorithms for metric TSP [ 8. It is intended to codify (at one glance) the (many) recent developments and improvements on the approximability of that problem. It is hoped to be useful in further research on the possible improvements of the underlying approximation bounds. Dept of Computer Science,.

3

Marek Karpinski's Home Page

http://theory.cs.uni-bonn.de/~marek/index-en.html

Dept of Computer Science. Or at the lectures. Department of Computer Science and. Hausdorff Center for Mathematics,. University of Bonn,. Office: II.63, Secretary: II.62,. 49 (0)228 73-4224 (office),. 49 (0)228 73-4327 (secretary),. 49 (0)228 73-4440 (fax). Professor Karpinski's research interests are in the. Design of efficient algorithms. Randomized and approximate algorithms. Theory of parallel and distributed systems. And the most fundamental issues of. Professor Karpinski is also interested in.

4

Workshops

http://theory.cs.uni-bonn.de/info5/workshops.html

Department of Computer Science. Please report any problems with our server by Email to:. Webmaster@theory.cs.uni-bonn.de. This page last modified: November 8th, 2012.

5

University of Bonn, CS Dept., Chair V: Homepage

http://theory.cs.uni-bonn.de/info5/index-en.html

Department of Computer Science. Welcome to the Homepage of Chair V. We are part of the Department of Computer Science. At the University of Bonn. Our research program is concerned with "Efficient Algorithms". Parallel and Distributed Computing". And "Combinatorial and Geometric Optimization". Members of Chair V. Special Year on Computational Complexity. Bonn Research Platform on Algorithmics. 3D Gale-Berlekamp Game (Demo). Sorting by Reversals (Demo). How to reach us. Compendium on Steiner Tree Problems.

UPGRADE TO PREMIUM TO VIEW 15 MORE

TOTAL PAGES IN THIS WEBSITE

20

LINKS TO THIS WEBSITE

ais.uni-bonn.de ais.uni-bonn.de

University of Bonn, Computer Science VI, Autonomous Intelligent Systems

http://www.ais.uni-bonn.de/behnke/index.html

Prof Dr. Sven Behnke. Head of Computer Science Department VI. Head of Autonomous Intelligent Systems Group. Prof Dr. Sven Behnke. 49 (0) 228 73-4116. 49 (0) 228 73-4425. Behnke at cs.uni-bonn.de. His research interests include cognitive robotics, computer vision, and machine learning. According to Google Scholar. His h-index is (querying). And his number of citations is (querying). A list of his program committee memberships and meeting organizations can be found here. Institute for Computer Science.

ais.uni-bonn.de ais.uni-bonn.de

Universität Bonn, Informatik VI, Autonome IntelligenteSysteme

http://www.ais.uni-bonn.de/index_de.html

Prof Dr. Sven Behnke. 49 (0) 228 73-4422. 49 (0) 228 73-4425. Sekretariat at ais.uni-bonn.de. Unser Team NimbRo hat den Fußballwettbewerb der Humanoid TeenSize-Klasse. Und den erstmals vergebenen Internationalen Harting Open-Source-Preis. Bei der Amazon Picking Challenge. Hat unser Team den zweiten Platz (Einlagern) und den dritten Platz (Auslagern) belegt. Unser Team NimbRo Explorer. Hat durch den mobilen Manipulationsroboter Momaro alle Aufgaben des DLR SpaceBot Camps. Unser Team NimbRo Rescue.

ais.uni-bonn.de ais.uni-bonn.de

University of Bonn, Computer Science VI, Autonomous Intelligent Systems

http://www.ais.uni-bonn.de/teaching.html

Anfragen für Bachelor- und Masterarbeiten sind jederzeit willkommen. Please contact Prof. Behnke if you want to write a master thesis related to cognitive robotics, computer vision, or deep learning. 2V 2Ü) (BA-INF 123). Prof Dr. Sven Behnke. Do 14:30-16:00, AVZ III, Römerstr. 164, HS 2. Prof Dr. Sven Behnke. Tu 14:30-16:00, Friedrich-Ebert-Allee 144, Lecture Hall III.3a. Mo 8:15-10:00, Friedrich-Ebert-Allee 144, Lecture Hall III.3a. Prof Dr. Sven Behnke, Dr. Seongyong Koo. Prof Dr. Sven Behnke. Mondays,...

wman2011.cs.uni-bonn.de wman2011.cs.uni-bonn.de

Informatik 4: Workshop on Wireless and Mobile Ad-Hoc Networks - WMAN 2011

http://wman2011.cs.uni-bonn.de/events/wman2011

Skip to the navigation. Skip to the content. Workshop on Wireless and Mobile Ad-Hoc Networks - WMAN 2011. 6th Workshop on Wireless and Mobile Ad-Hoc Networks - WMAN 2011. Thursday/Friday, March 10 - 11, 2011. In conjunction with the 17th bi-annual Conference on Communication in Distributed Systems (KiVS). German: ITG/GI - Fachtagung Kommunikation in Verteilten Systemen (KiVS). March 8 - 11, 2011, Kiel/Germany. Http:/ www.kivs11.de/. News: Updated Workshop Program available! Updated, as of Jan 25, 2011).

wman2011.cs.uni-bonn.de wman2011.cs.uni-bonn.de

Informatik 4: WMAN Submission Instructions

http://wman2011.cs.uni-bonn.de/events/wman2011/wman11-submission

Skip to the navigation. Skip to the content. Workshop on Wireless and Mobile Ad-Hoc Networks - WMAN 2011. 6th Workshop on Wireless and Mobile Ad-Hoc Networks - WMAN 2011. Thursday/Friday, March 10 - 11, 2011. In conjunction with the 17th bi-annual Conference on Communication in Distributed Systems (KiVS). German: ITG/GI - Fachtagung Kommunikation in Verteilten Systemen (KiVS). March 8 - 11, 2011, Kiel/Germany. Http:/ www.kivs11.de/. News: Updated Workshop Program available! Updated, as of Jan 25, 2011).

wman2011.cs.uni-bonn.de wman2011.cs.uni-bonn.de

Informatik 4: WMAN History

http://wman2011.cs.uni-bonn.de/events/wman2011/wman11-history

Skip to the navigation. Skip to the content. Workshop on Wireless and Mobile Ad-Hoc Networks - WMAN 2011. 6th Workshop on Wireless and Mobile Ad-Hoc Networks - WMAN 2011. Thursday/Friday, March 10 - 11, 2011. In conjunction with the 17th bi-annual Conference on Communication in Distributed Systems (KiVS). German: ITG/GI - Fachtagung Kommunikation in Verteilten Systemen (KiVS). March 8 - 11, 2011, Kiel/Germany. Http:/ www.kivs11.de/. News: Updated Workshop Program available! Updated, as of Jan 25, 2011).

UPGRADE TO PREMIUM TO VIEW 88 MORE

TOTAL LINKS TO THIS WEBSITE

94

OTHER SITES

theory.cs.cmu.edu theory.cs.cmu.edu

Carnegie Mellon Algorithms and Complexity Group

The faculty routinely offer advanced courses on various topics in the frontier of research in theoretical computer science (there are typically 2-3 such courses every semester). We also have a very active schedule of research seminars, including a weekly theory seminar. Which is run by our graduate students): see the seminars' page. For the inter-disciplinary program in Algorithms, Combinatorics and Optimization. Machine learning, computational aspects in economics and game theory, algorithms. Algorithmi...

theory.cs.princeton.edu theory.cs.princeton.edu

Theory @ Princeton

May 1st, Maria Chudnovsky at Theory Lunch. Title: Coloring square-free perfect graphs. May 8th, Rafael Oliveira at Theory Lunch. Title: Factors of Low Individual Degree Polynomials. Zeev Dvir and Sivakanth Gopi win Best Paper at STOC 2015. Rafael Oliveira wins Best Student Paper at CCC 2015. Sanjeev Arora Elected to AAAS. Tengyu Ma Receives IBM Fellowship Award. Prof Braverman awarded Smale Prize. Subhash Khot becomes CS dept. third winner of Nevanlinna Prize. Theory of Computation at Princeton.

theory.cs.ucdavis.edu theory.cs.ucdavis.edu

UC Davis - Computer Science - Algorithms and Theory Laboratory

Algorithms and Theory Laboratory. While work in algorithms and theory can often be done under a tree as well or better than in a physical laboratory, we do. Have a physical lab where many of our graduate students live. It’s at 2235 Kemper Hall, phone 1 530 752 8819. Computational geometry, computer graphics ( pubs. Scientific computing, numerical linear algebra ( pubs. Computational biology ( pubs. Algorithms, computational biology, bioinformatics ( pubs. Computational biology ( pubs. PhD 2010, Chip) (La...

theory.cs.uchicago.edu theory.cs.uchicago.edu

Theory Group—University of Chicago Computer Science

Department of Computer Science. The University of Chicago. Other Theory Groups in Chicago. Theoretical Computer Science at the University of Chicago. The Theory group sprung up with the founding of the Department in 1983 and has thrived ever since. In the intellectual environment of the University of Chicago, a university dedicated to fundamental research in all areas, our Theory group graduated a number of outstanding doctoral students. Our faculty. As well as current. Refreshments are served before the...

theory.cs.ucr.edu theory.cs.ucr.edu

Algorithms and Computational Biology Lab

We are interested in all aspects of the design and analysis of combinatorial algorithms. Ongoing research includes:. Average-case analysis of algorithms,. We are especially interested in algorithmic problems arising in computational molecular biology, such as:. SNP's and haplotype inference,. Genome-wide analysis of structures of gene families,. DNA microarray analysis,. Oligonucleotide fingerprinting of ribosomal RNA genes (OFRG). Is a high-throughput system for ortholog assignment on a genome scale.

theory.cs.uni-bonn.de theory.cs.uni-bonn.de

University of Bonn, CS Dept., Chair V: Homepage

Department of Computer Science. Welcome to the Homepage of Chair V. We are part of the Department of Computer Science. At the University of Bonn. Our research program is concerned with "Efficient Algorithms". Parallel and Distributed Computing". And "Combinatorial and Geometric Optimization". Members of Chair V. Special Year on Computational Complexity. Bonn Research Platform on Algorithmics. 3D Gale-Berlekamp Game (Demo). Sorting by Reversals (Demo). How to reach us. Compendium on Steiner Tree Problems.

theory.cs.uvic.ca theory.cs.uvic.ca

The Object Server Home Page (COS)

The (Combinatorial) Object Server. Thank you for visiting the combinatorial object server, otherwise known as COS. We hope that you will find it informative and useful. Who is it intended for? How does it work? COS does not store any tables of the lists that it produces. Each list is produced by a program on-the-fly. Most of the programs use a recursive backtracking, and some are available for downloading. What if I want millions of objects? We are always curious about who is using COS. Please send u...

theory.cs.yale.edu theory.cs.yale.edu

Theoretical Computer Science at Yale

Theoretical Computer Science at Yale. Appointed jointly with Applied Mathematics). Alumni (Former PhD students and postdocs, with graduation dates). Karhan Akcoglu, PhD 2003. Leonor Becerra-Bonache, Postdoc 2009. Kevin Chang, PhD 2006. Jiang Chen, PhD 2006. Samuel Daitch, PhD 2009. Ronny Dakdouk, PhD 2009. Zoe Diamadi, PhD 2004. Fernando Esponda, Postdoc 2007. Martins Krikis, PhD 1998. Philip Laird, PhD 1987. Michael Mahoney, Postdoc 2005. Ruben Michel, PhD 1990. Nathaniel Mishkin, PhD 1984. Distributed ...

theory.csc.uvic.ca theory.csc.uvic.ca

The Object Server Home Page (COS)

The (Combinatorial) Object Server. Thank you for visiting the combinatorial object server, otherwise known as COS. We hope that you will find it informative and useful. Who is it intended for? How does it work? COS does not store any tables of the lists that it produces. Each list is produced by a program on-the-fly. Most of the programs use a recursive backtracking, and some are available for downloading. What if I want millions of objects? We are always curious about who is using COS. Please send u...

theory.cse.iitm.ac.in theory.cse.iitm.ac.in

Theory Group @ CSE-IITM

Department of Computer Science and Engineering. Indian Institute of Technology Madras. ITM Convocation 2015 : PhD(4), MS(4), MTP(24), BTP(5) from the theory group. Mini-course on Foundations of Machine Learning by Aravind Srinivasan, Dec 28-30, 2014. Mini-course on Optimization by Nisheeth Vishnoi, on Dec 9, 2014. Oct 2014 : Rajsekar Manokaran joins the Department of CSE. List of upcoming speakers. Welcome to the homepage of the Theoretical Computer Science Group. Please refer to the department webpage.

theory.cse.wustl.edu theory.cse.wustl.edu

Theoretical Computer Science atWashington University in St. Louis

Theoretical Computer Science Group. Welcome to the Theoretical Computer Science Group at Washington University in St. Louis. Theoretical computer science is the mathematical study of the capabilities and limitations of computing. The major research projects in the theoretical computer science group include the development and analysis of algorithms in a variety of models, parallel computing, computational complexity, and learning.