[PORTALNAME]
Toggle menu
Home
Search
Search
Search Transfer Schools
Search for Course Equivalencies
Search for Exam Equivalencies
Search for Transfer Articulation Agreements
Search for Programs
Search for Courses
PA Bureau of CTE SOAR Programs
Transfer Student Center
Transfer Student Center
Adult Learners
Community College Students
High School Students
Traditional University Students
International Students
Military Learners and Veterans
About
About
Institutional information
Transfer FAQ
Register
Login
Course Criteria
Add courses to your favorites to save, share, and find your best transfer school.
CSCI 2510: Approximation Algorithms
1.00 Credits
Brown University
Approximation Algorithms deal with NP-hard combinatorial optimization problems by efficiently constructing a suboptimal solution with some specified quality guarantees. We study techniques such as linear programming and semidefinite programming relaxations, and apply them to problems such as facility location, scheduling, bin packing, maximum satifiability or vertex cover. Prerequisite: CSCI 1490 or 1570.
Share
CSCI 2510 - Approximation Algorithms
Favorite
CSCI 2520: Computational Geometry
1.00 Credits
Brown University
Algorithms and data structures for fundamental geometric problems in two and three dimensions. Topics include point location, range searching, convex hull, intersection, Voronoi diagrams, and graph drawing. Applications to computer graphics, circuit layout, information visualization, and computer-aided design are also discussed. Prerequisite: CS 157 or written permission.
Share
CSCI 2520 - Computational Geometry
Favorite
CSCI 2530: Design and Analysis of Communication Networks
1.00 Credits
Brown University
A theory seminar focusing on algorithmic and combinatorial issues related to the design and analysis of communication networks for parallel and distributed systems. Topics include packet routing, circuit switching, distributed shared memory, fault tolerance, and more. Prerequisites: CS 155, 157, or equivalent.
Share
CSCI 2530 - Design and Analysis of Communication Networks
Favorite
CSCI 2531: Internet and Web Algorithms
1.00 Credits
Brown University
This advanced graduate course/seminar focuses on the mathematical foundations of algorithms for handling large amounts of data over networks. We'll read and discuss recent papers in information retrieval, search engines, link analysis, probabilistic modeling of the web and social networks, and more. Recommended: CSCI 1550 and CSCI 1570, or equivalent courses.
Share
CSCI 2531 - Internet and Web Algorithms
Favorite
CSCI 2540: Advanced Probabilistic Methods in Computer Science
1.00 Credits
Brown University
Advanced topics in applications of probabilistic methods in design and analysis of algorithms, in particular to randomized algorithms and probabilistic analysis of algorithms. Topics include the Markov chains Monte Carlo method, martingales, entropy as a measure for information and randomness, and more. Prerequisites: CS 155. Recommended but not required: CS 157.
Share
CSCI 2540 - Advanced Probabilistic Methods in Computer Science
Favorite
CSCI 2550: Parallel Computation: Models, Algorithms, Limits
1.00 Credits
Brown University
The theoretical foundations of parallel algorithmics. Analysis of the most important models of parallel computation, such as directed-acyclic computation graphs, shared memory and networks, and standard data-exchange schemes (common address space and message-passing). Algorithmic techniques with numerous examples are cast mostly in the data-parallel framework. Finally, limitations to parallelizability (P-completeness) are analyzed. The content of the course is likely to change as technology evolves.
Share
CSCI 2550 - Parallel Computation: Models, Algorithms, Limits
Favorite
CSCI 2560: Applied Theory of Computation
1.00 Credits
Brown University
Advanced topics in theoretical computer science are chosen from the following list: parallel computation, time and space complexity classes, circuit complexity, I/0 complexity, VLSI computation and nanocomputing.
Share
CSCI 2560 - Applied Theory of Computation
Favorite
CSCI 2570: Introduction to Nanocomputing
1.00 Credits
Brown University
Nanoscale technologies employing materials whose smallest dimension is on the order of a few nanometers are expected to replace lithography in the design of chips. We give an introduction to computational nanotechnologies and explore problems presented by their stochastic nature. Nanotechnologies based on the use of DNA and semiconducting materials will be explored. Prerequisite: CSCI 0510.
Share
CSCI 2570 - Introduction to Nanocomputing
Favorite
CSCI 2580: Solving Hard Problems in Combinatorial Optimization: Theory and Systems
1.00 Credits
Brown University
The theory of combinatorial optimization and how it is embodied in practical systems. Explores issues encountered in implementing such systems. Emphasizes the wide variety of techniques and methodologies available, including integer programming, local search, constraint programming, and approximation algorithms. Problems addressed may include: scheduling, coloring, traveling salesman tours, and resource allocation. Prerequisites: CSCI 0320 or CSCI 0360, and basic knowledge of linear algebra.
Share
CSCI 2580 - Solving Hard Problems in Combinatorial Optimization: Theory and Systems
Favorite
CSCI 2590: Advanced Topics in Cryptology
1.00 Credits
Brown University
Seminar-style course on advanced topics in cryptography. Example topics are zero-knowledge proofs, multi-party computation, extractors in cryptography, universal composability, anonymous credentials and ecash, interplay of cryptography and game theory. May be repeated for credit. Prerequisite: CSCI 1510 or permission of the instructor.
Share
CSCI 2590 - Advanced Topics in Cryptology
Favorite
First
Previous
221
222
223
224
225
Next
Last
Results Per Page:
10
20
30
40
50
Search Again
To find college, community college and university courses by keyword, enter some or all of the following, then select the Search button.
College:
(Type the name of a College, University, Exam, or Corporation)
Course Subject:
(For example: Accounting, Psychology)
Course Prefix and Number:
(For example: ACCT 101, where Course Prefix is ACCT, and Course Number is 101)
Course Title:
(For example: Introduction To Accounting)
Course Description:
(For example: Sine waves, Hemingway, or Impressionism)
Distance:
Within
5 miles
10 miles
25 miles
50 miles
100 miles
200 miles
of
Zip Code
Please enter a valid 5 or 9-digit Zip Code.
(For example: Find all institutions within 5 miles of the selected Zip Code)
State/Region:
Alabama
Alaska
American Samoa
Arizona
Arkansas
California
Colorado
Connecticut
Delaware
District of Columbia
Federated States of Micronesia
Florida
Georgia
Guam
Hawaii
Idaho
Illinois
Indiana
Iowa
Kansas
Kentucky
Louisiana
Maine
Marshall Islands
Maryland
Massachusetts
Michigan
Minnesota
Minor Outlying Islands
Mississippi
Missouri
Montana
Nebraska
Nevada
New Hampshire
New Jersey
New Mexico
New York
North Carolina
North Dakota
Northern Mariana Islands
Ohio
Oklahoma
Oregon
Palau
Pennsylvania
Puerto Rico
Rhode Island
South Carolina
South Dakota
Tennessee
Texas
Utah
Vermont
Virgin Islands
Virginia
Washington
West Virginia
Wisconsin
Wyoming
American Samoa
Guam
Northern Marianas Islands
Puerto Rico
Virgin Islands