toc interest of areas and its importance

2. IMPORTANCE
• THEORY OF COMPUTATION LAYS A STRONG FOUNDATION FOR A LOT OF ABSTRACT AREAS OF COMPUTER
SCIENCE
• THEORY OF COMPUTATION IS A VERY CLOSE COUSIN OF ARTIFICIAL INTELLIGENCE THAN SAY
PROBABILITY OR COMPUTER VISION.
• TOC TEACHES YOU ABOUT THE ELEMENTARY WAYS IN WHICH A COMPUTER CAN BE MADE TO THINK.
• THERE IS A GREAT DEAL OF WORK THAT WAS MADE POSSIBLE IN THE AREA OF NATURAL LANGUAGE
PROCESSING THAT INVOLVED BUILDING FINITE STATE MACHINES ALSO KNOWN AS FINITE STATE
AUTOMATA

3. AREAS OF INTEREST
• ALGORITHMS
• COMPUTATION AND BIOLOGY
• COMPLEXITY THEORY
• CRYPTOGRAPHY AND INFORMATION SECURITY (CIS)
• DISTRIBUTED SYSTEM
• PARALLEL COMPUTING
• QUANTUM INFORMATION SCIENCE

4. ALGORITHM
• DIFFICULTY AND IMPORTANCE OF THE PROBLEMS THAT WE POSE TO COMPUTERS GROW, IT IS
CRUCIALLY IMPORTANT THAT WE DEVISE NEW MATHEMATICAL TOOLS TO ATTACK THEM.
• FIGURING OUT HOW BEST TO ALLOCATE SCARCE RESOURCES AMONG THOUSANDS PROBABILISTIC
INFORMATION.

5. COMPUTATION AND BIOLOGY
• FOCUSES ON DESIGNING ALGORITHMS TO GAIN BIOLOGICAL INSIGHTS FROM ADVANCES IN AUTOMATED
DATA COLLECTION AND THE SUBSEQUENT LARGE DATA SETS DRAWN FROM THEM.
• WORKS ON A DIVERSE SET OF PROBLEMS, INCLUDING COMPRESSIVE GENOMICS, NETWORK INFERENCE,
STRUCTURAL BIOINFORMATICS, GENOMIC PRIVACY, AND MEDICAL GENOMICS COLLABORATES CLOSELY
WITH BIOLOGISTS IN ORDER TO DESIGN EXPERIMENTS TO MAXIMALLY LEVERAGE THE POWER OF
COMPUTATION FOR BIOLOGICAL EXPLORATIONS.

6. COMPLEXITY THEORY
• WORK TO DEFINE THE POLYNOMIAL-TIME HIERARCHY IN 1973.
• FOCUSED ON CIRCUIT LOWER BOUNDS, INTERACTIVE PROOFS, AND PROBABILISTIC COMPUTATION.

7. CRYPTOGRAPHY AND INFORMATION
SECURITY (CIS)
• THE CIS GROUP SEEKS TO DEVELOP TECHNIQUES FOR SECURING TOMORROW'S GLOBAL INFORMATION
INFRASTRUCTURE BY EXPLORING THEORETICAL FOUNDATIONS, NEAR-TERM PRACTICAL APPLICATIONS,
AND LONG-RANGE SPECULATIVE RESEARCH.
• AIM TO UNDERSTAND THE THEORETICAL POWER OF CRYPTOGRAPHY AND THE PRACTICAL ENGINEERING
OF SECURE INFORMATION SYSTEMS, FROM APPROPRIATE DEFINITIONS AND PROOFS OF SECURITY,
THROUGH CRYPTOGRAPHIC ALGORITHM AND PROTOCOL DESIGN, TO IMPLEMENTATIONS OF REAL
APPLICATIONS WITH EASY-TO-USE SECURITY FEATURES.

8. DISTRIBUTED SYSTEM
• WORKS ON A WIDE RANGE OF PROBLEMS IN DISTRIBUTED COMPUTING THEORY. MUCH OF OUR WORK
STUDIES ALGORITHMS AND LOWER BOUNDS FOR TYPICAL PROBLEMS THAT ARISE IN DISTRIBUTED
SYSTEMS---LIKE RESOURCE ALLOCATION, IMPLEMENTING SHARED MEMORY ABSTRACTIONS, AND
RELIABLE COMMUNICATION
• THE FOCUS WAS ON RATHER STATIC WIRED SYSTEMS (SEE LYNCH'S BOOK ON DISTRIBUTED
ALGORITHMS). HOWEVER, IN THE PAST FEW YEARS, MOST OF OUR WORK HAS BEEN ON DYNAMIC
SYSTEMS, IN WHICH THE PARTICIPANTS MAY COME AND GO

9. PARALLEL COMPUTING
• THE MULTICORE ALGORITHMICS GROUP DEVELOPS TECHNIQUES FOR DESIGNING, IMPLEMENTING, AND
REASONING ABOUT MULTIPROCESSOR ALGORITHMS FOR MULTICORE MACHINES AND THE
MATHEMATICAL FOUNDATIONS OF THE COMPUTATION MODELS THAT GOVERN THEIR BEHAVIOR.
• THE SUPERTECH RESEARCH GROUP INVESTIGATES THE TECHNOLOGIES THAT SUPPORT SCALABLE HIGH-
PERFORMANCE COMPUTING, INCLUDING HARDWARE, SOFTWARE, AND THEORY.
• THE APPLIED COMPUTING GROUP DESIGNS SOFTWARE FOR HIGH PERFORMANCE COMPUTING, DEVELOPS
ALGORITHMS FOR NUMERICAL LINEAR ALGEBRA AND RESEARCH RANDOM MATRIX THEORY AND ITS
APPLICATIONS.

10. QUANTUM INFORMATION SCIENCE
• PLAYED A CENTRAL ROLE IN LAUNCHING QUANTUM COMPUTING AND INFORMATION AS A FIELD OF STUDY.
• WORKS ON A VARIETY OF TOPICS IN QUANTUM INFORMATION THEORY AND QUANTUM ALGORITHMS.
• FOCUSES ON THE LIMITS OF QUANTUM COMPUTERS, AND MORE GENERALLY, ON THE INTERFACE BETWEEN
COMPUTATIONAL COMPLEXITY THEORY AND PHYSICS.

11. THANK YOU


