[{"run_id":"20260906T231458-5fdd2fff","semester":"1272","observed_at":"2026-09-06 23:14:58.172943+00:00","record_version_id":"8c7218745a19a0176e6ec9a78c82ff7d0c94d7f098c7995bf2616006d18e4c42","course_id":"COMPSCI 787","course_uid":"course_1c792cd171ebabb5c5548c07","catalog_version_id":"4479b1c373eb7f6c37de033740f8e53b39dc27d10418f125f68649dd1485b091","course_number":787,"subjects":["COMPSCI"],"title":"ADVANCED ALGORITHMS","description":"Advanced paradigms for the design and analysis of efficient algorithms, including the use of randomness, linear programming, and semi-definite programming. Applications to data structures, approximating NP-hard optimization problems, learning, on-line and distributed problems.  Students are strongly encouraged to have introductory knowledge of algorithms (e.g.,COMP SCI 577)","requirements_text":"Graduate/professional standing"},{"run_id":"20260907T155543-ce3781c4","semester":"1272","observed_at":"2026-09-07 15:55:43.033547+00:00","record_version_id":"8c7218745a19a0176e6ec9a78c82ff7d0c94d7f098c7995bf2616006d18e4c42","course_id":"COMPSCI 787","course_uid":"course_1c792cd171ebabb5c5548c07","catalog_version_id":"4479b1c373eb7f6c37de033740f8e53b39dc27d10418f125f68649dd1485b091","course_number":787,"subjects":["COMPSCI"],"title":"ADVANCED ALGORITHMS","description":"Advanced paradigms for the design and analysis of efficient algorithms, including the use of randomness, linear programming, and semi-definite programming. Applications to data structures, approximating NP-hard optimization problems, learning, on-line and distributed problems.  Students are strongly encouraged to have introductory knowledge of algorithms (e.g.,COMP SCI 577)","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-03b0bbb9723907cf3d1b41cf0bb34837dc398e42","semester":"1262","observed_at":"2025-04-16 05:20:33.104844+00:00","record_version_id":"8f557c98ac6d812a2848ea3859199625cb16d0c561ca69b2c0ac81fea3b39eaa","course_id":"COMPSCI 787","course_uid":"course_1c792cd171ebabb5c5548c07","catalog_version_id":"4479b1c373eb7f6c37de033740f8e53b39dc27d10418f125f68649dd1485b091","course_number":787,"subjects":["COMPSCI"],"title":"ADVANCED ALGORITHMS","description":"Advanced paradigms for the design and analysis of efficient algorithms, including the use of randomness, linear programming, and semi-definite programming. Applications to data structures, approximating NP-hard optimization problems, learning, on-line and distributed problems.  Students are strongly encouraged to have introductory knowledge of algorithms (e.g.,COMP SCI 577)","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-0837245627eb714ae6bb0375f7abe8f41042011f","semester":"1262","observed_at":"2025-04-16 05:20:33.104844+00:00","record_version_id":"8f557c98ac6d812a2848ea3859199625cb16d0c561ca69b2c0ac81fea3b39eaa","course_id":"COMPSCI 787","course_uid":"course_1c792cd171ebabb5c5548c07","catalog_version_id":"4479b1c373eb7f6c37de033740f8e53b39dc27d10418f125f68649dd1485b091","course_number":787,"subjects":["COMPSCI"],"title":"ADVANCED ALGORITHMS","description":"Advanced paradigms for the design and analysis of efficient algorithms, including the use of randomness, linear programming, and semi-definite programming. Applications to data structures, approximating NP-hard optimization problems, learning, on-line and distributed problems.  Students are strongly encouraged to have introductory knowledge of algorithms (e.g.,COMP SCI 577)","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-08c92e359bbbc110b0778b7e0b15d6f40000e6b1","semester":"1262","observed_at":"2025-08-21 07:05:14.730696+00:00","record_version_id":"3326ba4ff84bf4b4fb29f6350de11ccc04134fe458f6fd8d7d8a0159d67e3ad1","course_id":"COMPSCI 787","course_uid":"course_1c792cd171ebabb5c5548c07","catalog_version_id":"4479b1c373eb7f6c37de033740f8e53b39dc27d10418f125f68649dd1485b091","course_number":787,"subjects":["COMPSCI"],"title":"ADVANCED ALGORITHMS","description":"Advanced paradigms for the design and analysis of efficient algorithms, including the use of randomness, linear programming, and semi-definite programming. Applications to data structures, approximating NP-hard optimization problems, learning, on-line and distributed problems.  Students are strongly encouraged to have introductory knowledge of algorithms (e.g.,COMP SCI 577)","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-0944d76440dc778fbb89626058c10451009ce9c6","semester":"1262","observed_at":"2025-05-21 03:36:18.194118+00:00","record_version_id":"2a136d87c26f7261e20864c7957e48e1ba8c661ad0b409fab1303fc58a1a854b","course_id":"COMPSCI 787","course_uid":"course_1c792cd171ebabb5c5548c07","catalog_version_id":"4479b1c373eb7f6c37de033740f8e53b39dc27d10418f125f68649dd1485b091","course_number":787,"subjects":["COMPSCI"],"title":"ADVANCED ALGORITHMS","description":"Advanced paradigms for the design and analysis of efficient algorithms, including the use of randomness, linear programming, and semi-definite programming. Applications to data structures, approximating NP-hard optimization problems, learning, on-line and distributed problems.  Students are strongly encouraged to have introductory knowledge of algorithms (e.g.,COMP SCI 577)","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-0a7f4bce29c816ef4d3d71b4eb8a2a3e15e33cc1","semester":"1262","observed_at":"2025-06-18 20:04:02.695444+00:00","record_version_id":"bae3b1ae8937417742cf0c95616504c0f330a9877f88906fadb072f5ed129996","course_id":"COMPSCI 787","course_uid":"course_1c792cd171ebabb5c5548c07","catalog_version_id":"4479b1c373eb7f6c37de033740f8e53b39dc27d10418f125f68649dd1485b091","course_number":787,"subjects":["COMPSCI"],"title":"ADVANCED ALGORITHMS","description":"Advanced paradigms for the design and analysis of efficient algorithms, including the use of randomness, linear programming, and semi-definite programming. Applications to data structures, approximating NP-hard optimization problems, learning, on-line and distributed problems.  Students are strongly encouraged to have introductory knowledge of algorithms (e.g.,COMP SCI 577)","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-0ab917f827a7de22ebdc1087114d377a31c4687b","semester":"1262","observed_at":"2025-05-22 02:11:02.531191+00:00","record_version_id":"04fe86eccc34fe32b431b49fca46e4b98900a3c7326f015b072f63099c719e37","course_id":"COMPSCI 787","course_uid":"course_1c792cd171ebabb5c5548c07","catalog_version_id":"4479b1c373eb7f6c37de033740f8e53b39dc27d10418f125f68649dd1485b091","course_number":787,"subjects":["COMPSCI"],"title":"ADVANCED ALGORITHMS","description":"Advanced paradigms for the design and analysis of efficient algorithms, including the use of randomness, linear programming, and semi-definite programming. Applications to data structures, approximating NP-hard optimization problems, learning, on-line and distributed problems.  Students are strongly encouraged to have introductory knowledge of algorithms (e.g.,COMP SCI 577)","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-0c40ecab4b6db9333d1f18aef816e3ee659e300c","semester":"1262","observed_at":"2025-05-25 18:02:34.797617+00:00","record_version_id":"133a8f4820091a1795a4c614c9f6d8dec73581bf93be4da444a422ee12594c10","course_id":"COMPSCI 787","course_uid":"course_1c792cd171ebabb5c5548c07","catalog_version_id":"4479b1c373eb7f6c37de033740f8e53b39dc27d10418f125f68649dd1485b091","course_number":787,"subjects":["COMPSCI"],"title":"ADVANCED ALGORITHMS","description":"Advanced paradigms for the design and analysis of efficient algorithms, including the use of randomness, linear programming, and semi-definite programming. Applications to data structures, approximating NP-hard optimization problems, learning, on-line and distributed problems.  Students are strongly encouraged to have introductory knowledge of algorithms (e.g.,COMP SCI 577)","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-0cb4d29a588ec7f11c7e00b7cf5dc3a0d23d0349","semester":"1266","observed_at":"2026-01-22 01:00:26.555427+00:00","record_version_id":"e07ab3f0a39c59386e372b8de0702fd05111cbb9434a3f60ea0fda7e32a49af8","course_id":"COMPSCI 787","course_uid":"course_1c792cd171ebabb5c5548c07","catalog_version_id":"4479b1c373eb7f6c37de033740f8e53b39dc27d10418f125f68649dd1485b091","course_number":787,"subjects":["COMPSCI"],"title":"ADVANCED ALGORITHMS","description":"Advanced paradigms for the design and analysis of efficient algorithms, including the use of randomness, linear programming, and semi-definite programming. Applications to data structures, approximating NP-hard optimization problems, learning, on-line and distributed problems.  Students are strongly encouraged to have introductory knowledge of algorithms (e.g.,COMP SCI 577)","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-11c30ec39e91498cbfcf3a923c53a4b03e387280","semester":"1262","observed_at":"2025-07-20 04:58:26.847117+00:00","record_version_id":"b48008e9fce5878aa2ce1d1cc39f424f3d8267ffbadf591f17291f6d1054ebce","course_id":"COMPSCI 787","course_uid":"course_1c792cd171ebabb5c5548c07","catalog_version_id":"4479b1c373eb7f6c37de033740f8e53b39dc27d10418f125f68649dd1485b091","course_number":787,"subjects":["COMPSCI"],"title":"ADVANCED ALGORITHMS","description":"Advanced paradigms for the design and analysis of efficient algorithms, including the use of randomness, linear programming, and semi-definite programming. Applications to data structures, approximating NP-hard optimization problems, learning, on-line and distributed problems.  Students are strongly encouraged to have introductory knowledge of algorithms (e.g.,COMP SCI 577)","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-13cd500edf2587e9a3428f326253738fbea965ea","semester":"1264","observed_at":"2025-12-14 04:50:04.653658+00:00","record_version_id":"7f83942c96cc2a15116bc65962bfdeb32956d260d98941084cd78e0a4a5ca828","course_id":"COMPSCI 787","course_uid":"course_1c792cd171ebabb5c5548c07","catalog_version_id":"4479b1c373eb7f6c37de033740f8e53b39dc27d10418f125f68649dd1485b091","course_number":787,"subjects":["COMPSCI"],"title":"ADVANCED ALGORITHMS","description":"Advanced paradigms for the design and analysis of efficient algorithms, including the use of randomness, linear programming, and semi-definite programming. Applications to data structures, approximating NP-hard optimization problems, learning, on-line and distributed problems.  Students are strongly encouraged to have introductory knowledge of algorithms (e.g.,COMP SCI 577)","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-1da08b2de39f05e6bc877c189fc2fd6eeda563f5","semester":"1262","observed_at":"2025-07-01 00:03:56.707251+00:00","record_version_id":"f8c8cdb063449e8ce59afc4f77011a752423766ba5611d5d662f5e86ff15d9e5","course_id":"COMPSCI 787","course_uid":"course_1c792cd171ebabb5c5548c07","catalog_version_id":"4479b1c373eb7f6c37de033740f8e53b39dc27d10418f125f68649dd1485b091","course_number":787,"subjects":["COMPSCI"],"title":"ADVANCED ALGORITHMS","description":"Advanced paradigms for the design and analysis of efficient algorithms, including the use of randomness, linear programming, and semi-definite programming. Applications to data structures, approximating NP-hard optimization problems, learning, on-line and distributed problems.  Students are strongly encouraged to have introductory knowledge of algorithms (e.g.,COMP SCI 577)","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-2031af47efe133b0e7877f433286ff07385afc41","semester":"1262","observed_at":"2025-07-02 20:16:45.749584+00:00","record_version_id":"67a2a9b9fd7b0d9a0fe85dd7e0b214ced0563097967877152f6ceac2a78af045","course_id":"COMPSCI 787","course_uid":"course_1c792cd171ebabb5c5548c07","catalog_version_id":"4479b1c373eb7f6c37de033740f8e53b39dc27d10418f125f68649dd1485b091","course_number":787,"subjects":["COMPSCI"],"title":"ADVANCED ALGORITHMS","description":"Advanced paradigms for the design and analysis of efficient algorithms, including the use of randomness, linear programming, and semi-definite programming. Applications to data structures, approximating NP-hard optimization problems, learning, on-line and distributed problems.  Students are strongly encouraged to have introductory knowledge of algorithms (e.g.,COMP SCI 577)","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-238eba6f32fbc30407f616dd0628ff02a2a824dd","semester":"1262","observed_at":"2025-08-17 05:15:07.788352+00:00","record_version_id":"f9b8089492006bf0ce3784718a0fedb2e599de4b075b93ba9f3938fb05091876","course_id":"COMPSCI 787","course_uid":"course_1c792cd171ebabb5c5548c07","catalog_version_id":"4479b1c373eb7f6c37de033740f8e53b39dc27d10418f125f68649dd1485b091","course_number":787,"subjects":["COMPSCI"],"title":"ADVANCED ALGORITHMS","description":"Advanced paradigms for the design and analysis of efficient algorithms, including the use of randomness, linear programming, and semi-definite programming. Applications to data structures, approximating NP-hard optimization problems, learning, on-line and distributed problems.  Students are strongly encouraged to have introductory knowledge of algorithms (e.g.,COMP SCI 577)","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-25f0ff56bc4d80f8a8afa1a0bcce8dae6fddb5e5","semester":"1262","observed_at":"2025-05-25 17:20:25.942090+00:00","record_version_id":"a3c8b57da0dd8581a22431900537549ef7ebd3cec9e12d390a0ac9e37d0d4c30","course_id":"COMPSCI 787","course_uid":"course_1c792cd171ebabb5c5548c07","catalog_version_id":"4479b1c373eb7f6c37de033740f8e53b39dc27d10418f125f68649dd1485b091","course_number":787,"subjects":["COMPSCI"],"title":"ADVANCED ALGORITHMS","description":"Advanced paradigms for the design and analysis of efficient algorithms, including the use of randomness, linear programming, and semi-definite programming. Applications to data structures, approximating NP-hard optimization problems, learning, on-line and distributed problems.  Students are strongly encouraged to have introductory knowledge of algorithms (e.g.,COMP SCI 577)","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-2923f91826ce253b7aeefa9f75b4a39fe4c80ff0","semester":"1262","observed_at":"2025-08-10 05:10:25.938416+00:00","record_version_id":"511430b5f63674aebe18a2705e315d8a081617ce686c75b84b574c1b4ec179b8","course_id":"COMPSCI 787","course_uid":"course_1c792cd171ebabb5c5548c07","catalog_version_id":"4479b1c373eb7f6c37de033740f8e53b39dc27d10418f125f68649dd1485b091","course_number":787,"subjects":["COMPSCI"],"title":"ADVANCED ALGORITHMS","description":"Advanced paradigms for the design and analysis of efficient algorithms, including the use of randomness, linear programming, and semi-definite programming. Applications to data structures, approximating NP-hard optimization problems, learning, on-line and distributed problems.  Students are strongly encouraged to have introductory knowledge of algorithms (e.g.,COMP SCI 577)","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-2a05214a4023e0157fa6f7d188c85308f714176c","semester":"1262","observed_at":"2025-09-07 04:56:38.255315+00:00","record_version_id":"dade73c4540866557507b91dd574f85d0307a46f2e55c5cd07b838f83d278a5e","course_id":"COMPSCI 787","course_uid":"course_1c792cd171ebabb5c5548c07","catalog_version_id":"4479b1c373eb7f6c37de033740f8e53b39dc27d10418f125f68649dd1485b091","course_number":787,"subjects":["COMPSCI"],"title":"ADVANCED ALGORITHMS","description":"Advanced paradigms for the design and analysis of efficient algorithms, including the use of randomness, linear programming, and semi-definite programming. Applications to data structures, approximating NP-hard optimization problems, learning, on-line and distributed problems.  Students are strongly encouraged to have introductory knowledge of algorithms (e.g.,COMP SCI 577)","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-2b1b8e39131de92b94620b25c5bbb25690efed4c","semester":"1262","observed_at":"2025-06-01 07:54:53.913454+00:00","record_version_id":"816f937871e9d04bc5d1633c64420566c8eecc8b1fd92b81d0d2fabe1d7625e3","course_id":"COMPSCI 787","course_uid":"course_1c792cd171ebabb5c5548c07","catalog_version_id":"4479b1c373eb7f6c37de033740f8e53b39dc27d10418f125f68649dd1485b091","course_number":787,"subjects":["COMPSCI"],"title":"ADVANCED ALGORITHMS","description":"Advanced paradigms for the design and analysis of efficient algorithms, including the use of randomness, linear programming, and semi-definite programming. Applications to data structures, approximating NP-hard optimization problems, learning, on-line and distributed problems.  Students are strongly encouraged to have introductory knowledge of algorithms (e.g.,COMP SCI 577)","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-33a1225644e5a5855d60f66e65413946e72fedf4","semester":"1262","observed_at":"2025-06-22 01:52:05.152650+00:00","record_version_id":"e2c82da7d8c5341d383ea7b3840b28160c9ee5d1b7252fe22417f783062fd39a","course_id":"COMPSCI 787","course_uid":"course_1c792cd171ebabb5c5548c07","catalog_version_id":"4479b1c373eb7f6c37de033740f8e53b39dc27d10418f125f68649dd1485b091","course_number":787,"subjects":["COMPSCI"],"title":"ADVANCED ALGORITHMS","description":"Advanced paradigms for the design and analysis of efficient algorithms, including the use of randomness, linear programming, and semi-definite programming. Applications to data structures, approximating NP-hard optimization problems, learning, on-line and distributed problems.  Students are strongly encouraged to have introductory knowledge of algorithms (e.g.,COMP SCI 577)","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-3b89c83dbf5208e13756184de1f2b2d0c09af35f","semester":"1262","observed_at":"2025-06-30 06:40:10.235522+00:00","record_version_id":"ea7b6adaa60c5b52d124ff8a4e77483602381de9ac3ac9dfc6a92d9e72f24602","course_id":"COMPSCI 787","course_uid":"course_1c792cd171ebabb5c5548c07","catalog_version_id":"4479b1c373eb7f6c37de033740f8e53b39dc27d10418f125f68649dd1485b091","course_number":787,"subjects":["COMPSCI"],"title":"ADVANCED ALGORITHMS","description":"Advanced paradigms for the design and analysis of efficient algorithms, including the use of randomness, linear programming, and semi-definite programming. Applications to data structures, approximating NP-hard optimization problems, learning, on-line and distributed problems.  Students are strongly encouraged to have introductory knowledge of algorithms (e.g.,COMP SCI 577)","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-3c3eebf7f35c39364b445a2fa5a112ce28dbb4a1","semester":"1262","observed_at":"2025-06-01 17:03:59.062985+00:00","record_version_id":"26b6e2718b0ef909d321165362e2471faa547d4080eef7656f71a3c62bb20e99","course_id":"COMPSCI 787","course_uid":"course_1c792cd171ebabb5c5548c07","catalog_version_id":"4479b1c373eb7f6c37de033740f8e53b39dc27d10418f125f68649dd1485b091","course_number":787,"subjects":["COMPSCI"],"title":"ADVANCED ALGORITHMS","description":"Advanced paradigms for the design and analysis of efficient algorithms, including the use of randomness, linear programming, and semi-definite programming. Applications to data structures, approximating NP-hard optimization problems, learning, on-line and distributed problems.  Students are strongly encouraged to have introductory knowledge of algorithms (e.g.,COMP SCI 577)","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-3fa4dd71391f1c9cf4ab2216680bbc428689f92d","semester":"1262","observed_at":"2025-05-25 01:15:58.180530+00:00","record_version_id":"d10de0b956a80831feec1058a2511a8fcb4386c3ca6f16dbfca0114428bc1a35","course_id":"COMPSCI 787","course_uid":"course_1c792cd171ebabb5c5548c07","catalog_version_id":"4479b1c373eb7f6c37de033740f8e53b39dc27d10418f125f68649dd1485b091","course_number":787,"subjects":["COMPSCI"],"title":"ADVANCED ALGORITHMS","description":"Advanced paradigms for the design and analysis of efficient algorithms, including the use of randomness, linear programming, and semi-definite programming. Applications to data structures, approximating NP-hard optimization problems, learning, on-line and distributed problems.  Students are strongly encouraged to have introductory knowledge of algorithms (e.g.,COMP SCI 577)","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-4040aa216da722a34483f68fc1e129ea571ae08d","semester":"1262","observed_at":"2025-06-01 07:27:39.695506+00:00","record_version_id":"a93af86d091b0a0e604a0effa0712115ad66cc167652ecfc5a0dee2ef6da4c30","course_id":"COMPSCI 787","course_uid":"course_1c792cd171ebabb5c5548c07","catalog_version_id":"4479b1c373eb7f6c37de033740f8e53b39dc27d10418f125f68649dd1485b091","course_number":787,"subjects":["COMPSCI"],"title":"ADVANCED ALGORITHMS","description":"Advanced paradigms for the design and analysis of efficient algorithms, including the use of randomness, linear programming, and semi-definite programming. Applications to data structures, approximating NP-hard optimization problems, learning, on-line and distributed problems.  Students are strongly encouraged to have introductory knowledge of algorithms (e.g.,COMP SCI 577)","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-454d53cd690294459f8ad0793cc3ed562060e56c","semester":"1262","observed_at":"2025-05-25 01:34:00.536004+00:00","record_version_id":"57f6bdfcaa12a9d2cca9d143249f69bc687b50d88044ba9ddbeacc3ac41931af","course_id":"COMPSCI 787","course_uid":"course_1c792cd171ebabb5c5548c07","catalog_version_id":"4479b1c373eb7f6c37de033740f8e53b39dc27d10418f125f68649dd1485b091","course_number":787,"subjects":["COMPSCI"],"title":"ADVANCED ALGORITHMS","description":"Advanced paradigms for the design and analysis of efficient algorithms, including the use of randomness, linear programming, and semi-definite programming. Applications to data structures, approximating NP-hard optimization problems, learning, on-line and distributed problems.  Students are strongly encouraged to have introductory knowledge of algorithms (e.g.,COMP SCI 577)","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-486f091e051fdb4ccdb80ee7b4fb0a5814510324","semester":"1264","observed_at":"2025-11-16 05:32:31.273726+00:00","record_version_id":"739655af18edd0011ec2326714c35d8b3acf8f1df0f929aeb8e11232f2bf8235","course_id":"COMPSCI 787","course_uid":"course_1c792cd171ebabb5c5548c07","catalog_version_id":"4479b1c373eb7f6c37de033740f8e53b39dc27d10418f125f68649dd1485b091","course_number":787,"subjects":["COMPSCI"],"title":"ADVANCED ALGORITHMS","description":"Advanced paradigms for the design and analysis of efficient algorithms, including the use of randomness, linear programming, and semi-definite programming. Applications to data structures, approximating NP-hard optimization problems, learning, on-line and distributed problems.  Students are strongly encouraged to have introductory knowledge of algorithms (e.g.,COMP SCI 577)","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-50393cfc5fd5598d4f4731ef1919f2ff53af07d9","semester":"1262","observed_at":"2025-06-30 06:05:57.438846+00:00","record_version_id":"e50003adb15bc31de562cc6b012ef3552a53afee1c1b4dd4185ba933235b551a","course_id":"COMPSCI 787","course_uid":"course_1c792cd171ebabb5c5548c07","catalog_version_id":"4479b1c373eb7f6c37de033740f8e53b39dc27d10418f125f68649dd1485b091","course_number":787,"subjects":["COMPSCI"],"title":"ADVANCED ALGORITHMS","description":"Advanced paradigms for the design and analysis of efficient algorithms, including the use of randomness, linear programming, and semi-definite programming. Applications to data structures, approximating NP-hard optimization problems, learning, on-line and distributed problems.  Students are strongly encouraged to have introductory knowledge of algorithms (e.g.,COMP SCI 577)","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-50f6947786b208c800db8bbd0cec84a8f0f187d2","semester":"1262","observed_at":"2025-06-02 03:49:42.915428+00:00","record_version_id":"cbd8b26b2585a3e2a8477512010f8dc3b7eec75509ecfc6a9651a382f499ca66","course_id":"COMPSCI 787","course_uid":"course_1c792cd171ebabb5c5548c07","catalog_version_id":"4479b1c373eb7f6c37de033740f8e53b39dc27d10418f125f68649dd1485b091","course_number":787,"subjects":["COMPSCI"],"title":"ADVANCED ALGORITHMS","description":"Advanced paradigms for the design and analysis of efficient algorithms, including the use of randomness, linear programming, and semi-definite programming. Applications to data structures, approximating NP-hard optimization problems, learning, on-line and distributed problems.  Students are strongly encouraged to have introductory knowledge of algorithms (e.g.,COMP SCI 577)","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-51d86ed4082dced3803c295419b0ec8440942016","semester":"1264","observed_at":"2025-11-12 04:50:41.141307+00:00","record_version_id":"093e3f2fb11c20d54665fcf358d806c45292ac0432f0ddc6135d3e6408bcfd63","course_id":"COMPSCI 787","course_uid":"course_1c792cd171ebabb5c5548c07","catalog_version_id":"4479b1c373eb7f6c37de033740f8e53b39dc27d10418f125f68649dd1485b091","course_number":787,"subjects":["COMPSCI"],"title":"ADVANCED ALGORITHMS","description":"Advanced paradigms for the design and analysis of efficient algorithms, including the use of randomness, linear programming, and semi-definite programming. Applications to data structures, approximating NP-hard optimization problems, learning, on-line and distributed problems.  Students are strongly encouraged to have introductory knowledge of algorithms (e.g.,COMP SCI 577)","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-53101bd1c10db0d00d094e4c9154d4c244ff23d9","semester":"1262","observed_at":"2025-10-05 04:58:05.366968+00:00","record_version_id":"213aaf7df4324498f9b1aea08431a8a4ecd17d20d99a79f4f5e60dd9e5c2881d","course_id":"COMPSCI 787","course_uid":"course_1c792cd171ebabb5c5548c07","catalog_version_id":"4479b1c373eb7f6c37de033740f8e53b39dc27d10418f125f68649dd1485b091","course_number":787,"subjects":["COMPSCI"],"title":"ADVANCED ALGORITHMS","description":"Advanced paradigms for the design and analysis of efficient algorithms, including the use of randomness, linear programming, and semi-definite programming. Applications to data structures, approximating NP-hard optimization problems, learning, on-line and distributed problems.  Students are strongly encouraged to have introductory knowledge of algorithms (e.g.,COMP SCI 577)","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-58751151c564e11c5cb8aedd3a2d3527c22f73eb","semester":"1262","observed_at":"2025-06-01 06:59:01.536576+00:00","record_version_id":"006444d6372065f15cb5a9ec286913437e540898ad374a107e93873bd2f8b720","course_id":"COMPSCI 787","course_uid":"course_1c792cd171ebabb5c5548c07","catalog_version_id":"4479b1c373eb7f6c37de033740f8e53b39dc27d10418f125f68649dd1485b091","course_number":787,"subjects":["COMPSCI"],"title":"ADVANCED ALGORITHMS","description":"Advanced paradigms for the design and analysis of efficient algorithms, including the use of randomness, linear programming, and semi-definite programming. Applications to data structures, approximating NP-hard optimization problems, learning, on-line and distributed problems.  Students are strongly encouraged to have introductory knowledge of algorithms (e.g.,COMP SCI 577)","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-5c4c8d3701a333ba4ddadef7d0b5dde8440fcdf0","semester":"1262","observed_at":"2025-06-01 01:57:51.256704+00:00","record_version_id":"218ace25f5971816528f2d5bdad85e7783b970ac25e37c4358ef05b9c17d9bd3","course_id":"COMPSCI 787","course_uid":"course_1c792cd171ebabb5c5548c07","catalog_version_id":"4479b1c373eb7f6c37de033740f8e53b39dc27d10418f125f68649dd1485b091","course_number":787,"subjects":["COMPSCI"],"title":"ADVANCED ALGORITHMS","description":"Advanced paradigms for the design and analysis of efficient algorithms, including the use of randomness, linear programming, and semi-definite programming. Applications to data structures, approximating NP-hard optimization problems, learning, on-line and distributed problems.  Students are strongly encouraged to have introductory knowledge of algorithms (e.g.,COMP SCI 577)","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-5d20d9f81651d3c83fcaa2fd10870ce6e5d5a685","semester":"1262","observed_at":"2025-05-21 16:48:48.484741+00:00","record_version_id":"581e48d3e7eab94f2d85c1dd2b8131f47a19c80e00bc2cd45b3732381669f0a4","course_id":"COMPSCI 787","course_uid":"course_1c792cd171ebabb5c5548c07","catalog_version_id":"4479b1c373eb7f6c37de033740f8e53b39dc27d10418f125f68649dd1485b091","course_number":787,"subjects":["COMPSCI"],"title":"ADVANCED ALGORITHMS","description":"Advanced paradigms for the design and analysis of efficient algorithms, including the use of randomness, linear programming, and semi-definite programming. Applications to data structures, approximating NP-hard optimization problems, learning, on-line and distributed problems.  Students are strongly encouraged to have introductory knowledge of algorithms (e.g.,COMP SCI 577)","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-5feaebf2ab37051c86ad360cc0fa0d7e0e2ea295","semester":"1262","observed_at":"2025-05-24 15:58:23.378859+00:00","record_version_id":"719a9badbf17d755296084bae9d2a430390ef439f055fb106fb18fdda27d5d12","course_id":"COMPSCI 787","course_uid":"course_1c792cd171ebabb5c5548c07","catalog_version_id":"4479b1c373eb7f6c37de033740f8e53b39dc27d10418f125f68649dd1485b091","course_number":787,"subjects":["COMPSCI"],"title":"ADVANCED ALGORITHMS","description":"Advanced paradigms for the design and analysis of efficient algorithms, including the use of randomness, linear programming, and semi-definite programming. Applications to data structures, approximating NP-hard optimization problems, learning, on-line and distributed problems.  Students are strongly encouraged to have introductory knowledge of algorithms (e.g.,COMP SCI 577)","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-60949965544fce098cc006354e201149005fb77b","semester":"1264","observed_at":"2025-10-26 05:07:14.077864+00:00","record_version_id":"525fb311280613db032a6b1b225e0808a4e7b464f4b9c60e98014d6eb54cbd6e","course_id":"COMPSCI 787","course_uid":"course_1c792cd171ebabb5c5548c07","catalog_version_id":"4479b1c373eb7f6c37de033740f8e53b39dc27d10418f125f68649dd1485b091","course_number":787,"subjects":["COMPSCI"],"title":"ADVANCED ALGORITHMS","description":"Advanced paradigms for the design and analysis of efficient algorithms, including the use of randomness, linear programming, and semi-definite programming. Applications to data structures, approximating NP-hard optimization problems, learning, on-line and distributed problems.  Students are strongly encouraged to have introductory knowledge of algorithms (e.g.,COMP SCI 577)","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-639225ac3addf8522f1d30cb4fe26054ea7f8c49","semester":"1262","observed_at":"2025-06-01 08:14:42.497608+00:00","record_version_id":"8f8a5cddf5b373b6c8951a2c220c9b08591f4d530830070402f38c0f617bf029","course_id":"COMPSCI 787","course_uid":"course_1c792cd171ebabb5c5548c07","catalog_version_id":"4479b1c373eb7f6c37de033740f8e53b39dc27d10418f125f68649dd1485b091","course_number":787,"subjects":["COMPSCI"],"title":"ADVANCED ALGORITHMS","description":"Advanced paradigms for the design and analysis of efficient algorithms, including the use of randomness, linear programming, and semi-definite programming. Applications to data structures, approximating NP-hard optimization problems, learning, on-line and distributed problems.  Students are strongly encouraged to have introductory knowledge of algorithms (e.g.,COMP SCI 577)","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-64093b17b3a9c67a41aa33eb37adb53ec38df714","semester":"1262","observed_at":"2025-05-22 02:11:02.531191+00:00","record_version_id":"c9b604eba983f44ab6e1500180c5d61bbc6183b9cf3bc6e3c8d75b52ebbe1e21","course_id":"COMPSCI 787","course_uid":"course_1c792cd171ebabb5c5548c07","catalog_version_id":"4479b1c373eb7f6c37de033740f8e53b39dc27d10418f125f68649dd1485b091","course_number":787,"subjects":["COMPSCI"],"title":"ADVANCED ALGORITHMS","description":"Advanced paradigms for the design and analysis of efficient algorithms, including the use of randomness, linear programming, and semi-definite programming. Applications to data structures, approximating NP-hard optimization problems, learning, on-line and distributed problems.  Students are strongly encouraged to have introductory knowledge of algorithms (e.g.,COMP SCI 577)","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-6885b56099f55e08aa0205546369fb0381d50e13","semester":"1262","observed_at":"2025-07-13 04:59:22.367394+00:00","record_version_id":"536871bfab0e21076ce7c3e00db9a05c3fcfe9695d1e33c4dc862ca04f3206d0","course_id":"COMPSCI 787","course_uid":"course_1c792cd171ebabb5c5548c07","catalog_version_id":"4479b1c373eb7f6c37de033740f8e53b39dc27d10418f125f68649dd1485b091","course_number":787,"subjects":["COMPSCI"],"title":"ADVANCED ALGORITHMS","description":"Advanced paradigms for the design and analysis of efficient algorithms, including the use of randomness, linear programming, and semi-definite programming. Applications to data structures, approximating NP-hard optimization problems, learning, on-line and distributed problems.  Students are strongly encouraged to have introductory knowledge of algorithms (e.g.,COMP SCI 577)","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-69d4b2b16e8268f75b6390b3a0e2ce8bf73999da","semester":"1262","observed_at":"2025-06-30 03:21:29.925498+00:00","record_version_id":"0367218b0dbbeeb707d34495a6fe9f07d96580752430a5d86d4ebde2663eb8a8","course_id":"COMPSCI 787","course_uid":"course_1c792cd171ebabb5c5548c07","catalog_version_id":"4479b1c373eb7f6c37de033740f8e53b39dc27d10418f125f68649dd1485b091","course_number":787,"subjects":["COMPSCI"],"title":"ADVANCED ALGORITHMS","description":"Advanced paradigms for the design and analysis of efficient algorithms, including the use of randomness, linear programming, and semi-definite programming. Applications to data structures, approximating NP-hard optimization problems, learning, on-line and distributed problems.  Students are strongly encouraged to have introductory knowledge of algorithms (e.g.,COMP SCI 577)","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-6b29c3e0673b2f9a736d2363db5409e03d5b3ed4","semester":"1264","observed_at":"2025-12-03 12:33:41.418072+00:00","record_version_id":"14488b03a004865c6db65c6c49ed1417cd9cf4f50c6d27557944121092d18fce","course_id":"COMPSCI 787","course_uid":"course_1c792cd171ebabb5c5548c07","catalog_version_id":"4479b1c373eb7f6c37de033740f8e53b39dc27d10418f125f68649dd1485b091","course_number":787,"subjects":["COMPSCI"],"title":"ADVANCED ALGORITHMS","description":"Advanced paradigms for the design and analysis of efficient algorithms, including the use of randomness, linear programming, and semi-definite programming. Applications to data structures, approximating NP-hard optimization problems, learning, on-line and distributed problems.  Students are strongly encouraged to have introductory knowledge of algorithms (e.g.,COMP SCI 577)","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-73259984748de484976ef2ad56ad7ab3d4cb4518","semester":"1262","observed_at":"2025-06-26 08:27:56.461216+00:00","record_version_id":"e69156f0edd9067869a52b0620993d612844abccf3baa7d0bab6a33f303c7520","course_id":"COMPSCI 787","course_uid":"course_1c792cd171ebabb5c5548c07","catalog_version_id":"4479b1c373eb7f6c37de033740f8e53b39dc27d10418f125f68649dd1485b091","course_number":787,"subjects":["COMPSCI"],"title":"ADVANCED ALGORITHMS","description":"Advanced paradigms for the design and analysis of efficient algorithms, including the use of randomness, linear programming, and semi-definite programming. Applications to data structures, approximating NP-hard optimization problems, learning, on-line and distributed problems.  Students are strongly encouraged to have introductory knowledge of algorithms (e.g.,COMP SCI 577)","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-741602fbc6252c232a0b9e6bc1a9ae3101625f5a","semester":"1262","observed_at":"2025-06-30 22:49:32.522034+00:00","record_version_id":"b695037635ca555074358d3d06ff5f8a5a30240710164b7557c50e82df2c50ac","course_id":"COMPSCI 787","course_uid":"course_1c792cd171ebabb5c5548c07","catalog_version_id":"4479b1c373eb7f6c37de033740f8e53b39dc27d10418f125f68649dd1485b091","course_number":787,"subjects":["COMPSCI"],"title":"ADVANCED ALGORITHMS","description":"Advanced paradigms for the design and analysis of efficient algorithms, including the use of randomness, linear programming, and semi-definite programming. Applications to data structures, approximating NP-hard optimization problems, learning, on-line and distributed problems.  Students are strongly encouraged to have introductory knowledge of algorithms (e.g.,COMP SCI 577)","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-7774f45558276ec29bf626e58fffb4a27bdbb2a9","semester":"1264","observed_at":"2025-11-01 11:49:36.359151+00:00","record_version_id":"84d3375ec7224505d5459c6851407bc2bc4686884683a37403e7b50e9f625f58","course_id":"COMPSCI 787","course_uid":"course_1c792cd171ebabb5c5548c07","catalog_version_id":"4479b1c373eb7f6c37de033740f8e53b39dc27d10418f125f68649dd1485b091","course_number":787,"subjects":["COMPSCI"],"title":"ADVANCED ALGORITHMS","description":"Advanced paradigms for the design and analysis of efficient algorithms, including the use of randomness, linear programming, and semi-definite programming. Applications to data structures, approximating NP-hard optimization problems, learning, on-line and distributed problems.  Students are strongly encouraged to have introductory knowledge of algorithms (e.g.,COMP SCI 577)","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-7ab7c5e783fc8ebef8b8ee8cea019ee37a72ce74","semester":"1262","observed_at":"2025-09-28 04:58:07.340658+00:00","record_version_id":"84c2d34954f8346622214fd719e5cfa4a0f2d1c3401c3a68ca4e408b568ce326","course_id":"COMPSCI 787","course_uid":"course_1c792cd171ebabb5c5548c07","catalog_version_id":"4479b1c373eb7f6c37de033740f8e53b39dc27d10418f125f68649dd1485b091","course_number":787,"subjects":["COMPSCI"],"title":"ADVANCED ALGORITHMS","description":"Advanced paradigms for the design and analysis of efficient algorithms, including the use of randomness, linear programming, and semi-definite programming. Applications to data structures, approximating NP-hard optimization problems, learning, on-line and distributed problems.  Students are strongly encouraged to have introductory knowledge of algorithms (e.g.,COMP SCI 577)","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-7b2f22d83ea05055ab90dcb77dc802382cccc6f7","semester":"1262","observed_at":"2025-05-21 17:56:46.096741+00:00","record_version_id":"0a11afa94448e1e1bfb9169cb928bbf245d2326e7159ae908433c0d056b09ae9","course_id":"COMPSCI 787","course_uid":"course_1c792cd171ebabb5c5548c07","catalog_version_id":"4479b1c373eb7f6c37de033740f8e53b39dc27d10418f125f68649dd1485b091","course_number":787,"subjects":["COMPSCI"],"title":"ADVANCED ALGORITHMS","description":"Advanced paradigms for the design and analysis of efficient algorithms, including the use of randomness, linear programming, and semi-definite programming. Applications to data structures, approximating NP-hard optimization problems, learning, on-line and distributed problems.  Students are strongly encouraged to have introductory knowledge of algorithms (e.g.,COMP SCI 577)","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-7ca1175502be18eb51f7b016818a884a43fd4ebb","semester":"1262","observed_at":"2025-07-29 06:28:23.644795+00:00","record_version_id":"28978264bedccc7f79c024680699579c383fb733e990ff1517584407a2d3301e","course_id":"COMPSCI 787","course_uid":"course_1c792cd171ebabb5c5548c07","catalog_version_id":"4479b1c373eb7f6c37de033740f8e53b39dc27d10418f125f68649dd1485b091","course_number":787,"subjects":["COMPSCI"],"title":"ADVANCED ALGORITHMS","description":"Advanced paradigms for the design and analysis of efficient algorithms, including the use of randomness, linear programming, and semi-definite programming. Applications to data structures, approximating NP-hard optimization problems, learning, on-line and distributed problems.  Students are strongly encouraged to have introductory knowledge of algorithms (e.g.,COMP SCI 577)","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-7d8cee5e42602ad9ba5dc0322085af2fa0dffaac","semester":"1262","observed_at":"2025-05-22 01:15:19.291664+00:00","record_version_id":"2b2b033542d9603e2cc1eb70deaf1d725281bdbbb5d2151277851bc15c5aafb5","course_id":"COMPSCI 787","course_uid":"course_1c792cd171ebabb5c5548c07","catalog_version_id":"4479b1c373eb7f6c37de033740f8e53b39dc27d10418f125f68649dd1485b091","course_number":787,"subjects":["COMPSCI"],"title":"ADVANCED ALGORITHMS","description":"Advanced paradigms for the design and analysis of efficient algorithms, including the use of randomness, linear programming, and semi-definite programming. Applications to data structures, approximating NP-hard optimization problems, learning, on-line and distributed problems.  Students are strongly encouraged to have introductory knowledge of algorithms (e.g.,COMP SCI 577)","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-81a0d6a7f668c98c59bd05fa988aa079c5ad1f68","semester":"1262","observed_at":"2025-05-31 07:49:50.419452+00:00","record_version_id":"d948543ebae0add607118fe17b7d69c689acbf287ee081edb9b2bbea4fa9e3c6","course_id":"COMPSCI 787","course_uid":"course_1c792cd171ebabb5c5548c07","catalog_version_id":"4479b1c373eb7f6c37de033740f8e53b39dc27d10418f125f68649dd1485b091","course_number":787,"subjects":["COMPSCI"],"title":"ADVANCED ALGORITHMS","description":"Advanced paradigms for the design and analysis of efficient algorithms, including the use of randomness, linear programming, and semi-definite programming. Applications to data structures, approximating NP-hard optimization problems, learning, on-line and distributed problems.  Students are strongly encouraged to have introductory knowledge of algorithms (e.g.,COMP SCI 577)","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-82f31c08c746a214872494cde6ecaeb9330441b4","semester":"1262","observed_at":"2025-06-17 21:26:08.547156+00:00","record_version_id":"0d08a5838d58d0ff45a50486ebfc48e1cc3f1acafc0200a1c53d0b410e98f982","course_id":"COMPSCI 787","course_uid":"course_1c792cd171ebabb5c5548c07","catalog_version_id":"4479b1c373eb7f6c37de033740f8e53b39dc27d10418f125f68649dd1485b091","course_number":787,"subjects":["COMPSCI"],"title":"ADVANCED ALGORITHMS","description":"Advanced paradigms for the design and analysis of efficient algorithms, including the use of randomness, linear programming, and semi-definite programming. Applications to data structures, approximating NP-hard optimization problems, learning, on-line and distributed problems.  Students are strongly encouraged to have introductory knowledge of algorithms (e.g.,COMP SCI 577)","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-84c248343c5a99ab42c5616c594812a5e3e31cbb","semester":"1262","observed_at":"2025-07-04 06:00:07.487827+00:00","record_version_id":"cc6b22b839c2162886e20fb652796c00df4ddf734f4bd0f468374d6406a30b26","course_id":"COMPSCI 787","course_uid":"course_1c792cd171ebabb5c5548c07","catalog_version_id":"4479b1c373eb7f6c37de033740f8e53b39dc27d10418f125f68649dd1485b091","course_number":787,"subjects":["COMPSCI"],"title":"ADVANCED ALGORITHMS","description":"Advanced paradigms for the design and analysis of efficient algorithms, including the use of randomness, linear programming, and semi-definite programming. Applications to data structures, approximating NP-hard optimization problems, learning, on-line and distributed problems.  Students are strongly encouraged to have introductory knowledge of algorithms (e.g.,COMP SCI 577)","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-86334e7275e315853287e8580c35456c68df800b","semester":"1262","observed_at":"2025-05-22 06:53:03.336354+00:00","record_version_id":"73160a90b6cc7177ed8562d7e63e86bc3fd2d17d486f81848961eaff6c40b03d","course_id":"COMPSCI 787","course_uid":"course_1c792cd171ebabb5c5548c07","catalog_version_id":"4479b1c373eb7f6c37de033740f8e53b39dc27d10418f125f68649dd1485b091","course_number":787,"subjects":["COMPSCI"],"title":"ADVANCED ALGORITHMS","description":"Advanced paradigms for the design and analysis of efficient algorithms, including the use of randomness, linear programming, and semi-definite programming. Applications to data structures, approximating NP-hard optimization problems, learning, on-line and distributed problems.  Students are strongly encouraged to have introductory knowledge of algorithms (e.g.,COMP SCI 577)","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-8686dc1664f93a6c05f50321410961b39b12f91b","semester":"1262","observed_at":"2025-05-28 10:17:41.595894+00:00","record_version_id":"aab80601ddc036a8552262d48e8521157e1870a2c41c5e4e971028dc5ddc603f","course_id":"COMPSCI 787","course_uid":"course_1c792cd171ebabb5c5548c07","catalog_version_id":"4479b1c373eb7f6c37de033740f8e53b39dc27d10418f125f68649dd1485b091","course_number":787,"subjects":["COMPSCI"],"title":"ADVANCED ALGORITHMS","description":"Advanced paradigms for the design and analysis of efficient algorithms, including the use of randomness, linear programming, and semi-definite programming. Applications to data structures, approximating NP-hard optimization problems, learning, on-line and distributed problems.  Students are strongly encouraged to have introductory knowledge of algorithms (e.g.,COMP SCI 577)","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-86d941366886c9a14a2581c04e20d0bdd25e1b02","semester":"1262","observed_at":"2025-08-31 04:54:14.656039+00:00","record_version_id":"b47013a8f293f57030ba37c0200647e0e3dc9a0aa2a854b971247604550e0404","course_id":"COMPSCI 787","course_uid":"course_1c792cd171ebabb5c5548c07","catalog_version_id":"4479b1c373eb7f6c37de033740f8e53b39dc27d10418f125f68649dd1485b091","course_number":787,"subjects":["COMPSCI"],"title":"ADVANCED ALGORITHMS","description":"Advanced paradigms for the design and analysis of efficient algorithms, including the use of randomness, linear programming, and semi-definite programming. Applications to data structures, approximating NP-hard optimization problems, learning, on-line and distributed problems.  Students are strongly encouraged to have introductory knowledge of algorithms (e.g.,COMP SCI 577)","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-8ba1d2e6cfbb1525b4f9f769ec164fb6ad0f237a","semester":"1262","observed_at":"2025-06-02 05:22:45.010398+00:00","record_version_id":"085ddf8a8046e25decd3956b0369b25b96e538cea1c9937fb8858a2a0ed90bff","course_id":"COMPSCI 787","course_uid":"course_1c792cd171ebabb5c5548c07","catalog_version_id":"4479b1c373eb7f6c37de033740f8e53b39dc27d10418f125f68649dd1485b091","course_number":787,"subjects":["COMPSCI"],"title":"ADVANCED ALGORITHMS","description":"Advanced paradigms for the design and analysis of efficient algorithms, including the use of randomness, linear programming, and semi-definite programming. Applications to data structures, approximating NP-hard optimization problems, learning, on-line and distributed problems.  Students are strongly encouraged to have introductory knowledge of algorithms (e.g.,COMP SCI 577)","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-90e5aa456689a3b222016c05c319bbcd0bddd453","semester":"1262","observed_at":"2025-05-25 02:00:10.037905+00:00","record_version_id":"b6606f8e95bb94f740a3002e4827478b152044e31245121d98e5ee239de76390","course_id":"COMPSCI 787","course_uid":"course_1c792cd171ebabb5c5548c07","catalog_version_id":"4479b1c373eb7f6c37de033740f8e53b39dc27d10418f125f68649dd1485b091","course_number":787,"subjects":["COMPSCI"],"title":"ADVANCED ALGORITHMS","description":"Advanced paradigms for the design and analysis of efficient algorithms, including the use of randomness, linear programming, and semi-definite programming. Applications to data structures, approximating NP-hard optimization problems, learning, on-line and distributed problems.  Students are strongly encouraged to have introductory knowledge of algorithms (e.g.,COMP SCI 577)","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-92d960aa7e4cd6e4c9ac8b2e232092904038e9e4","semester":"1262","observed_at":"2025-06-08 01:50:46.451351+00:00","record_version_id":"2a4cd12ced4ec5f3dff39b0f8f9c3e71989ed145524feb87866a35484baaf9cd","course_id":"COMPSCI 787","course_uid":"course_1c792cd171ebabb5c5548c07","catalog_version_id":"4479b1c373eb7f6c37de033740f8e53b39dc27d10418f125f68649dd1485b091","course_number":787,"subjects":["COMPSCI"],"title":"ADVANCED ALGORITHMS","description":"Advanced paradigms for the design and analysis of efficient algorithms, including the use of randomness, linear programming, and semi-definite programming. Applications to data structures, approximating NP-hard optimization problems, learning, on-line and distributed problems.  Students are strongly encouraged to have introductory knowledge of algorithms (e.g.,COMP SCI 577)","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-94002ae588a8f71eca6d64105f2e603e8587293b","semester":"1262","observed_at":"2025-05-21 09:01:16.021508+00:00","record_version_id":"b33db97fe9f419d1b69cc22f0cc5a5ffa09ec8fb9c78702ebbc7e343350e680a","course_id":"COMPSCI 787","course_uid":"course_1c792cd171ebabb5c5548c07","catalog_version_id":"4479b1c373eb7f6c37de033740f8e53b39dc27d10418f125f68649dd1485b091","course_number":787,"subjects":["COMPSCI"],"title":"ADVANCED ALGORITHMS","description":"Advanced paradigms for the design and analysis of efficient algorithms, including the use of randomness, linear programming, and semi-definite programming. Applications to data structures, approximating NP-hard optimization problems, learning, on-line and distributed problems.  Students are strongly encouraged to have introductory knowledge of algorithms (e.g.,COMP SCI 577)","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-9dd575e013c5c6e000ab3ad2d1288cc1dd9c96dc","semester":"1264","observed_at":"2025-12-21 04:47:46.589081+00:00","record_version_id":"0f83e7a74d64f9b3fd28ad847e3882d8320b496a74f55653b238258c55ab0a54","course_id":"COMPSCI 787","course_uid":"course_1c792cd171ebabb5c5548c07","catalog_version_id":"4479b1c373eb7f6c37de033740f8e53b39dc27d10418f125f68649dd1485b091","course_number":787,"subjects":["COMPSCI"],"title":"ADVANCED ALGORITHMS","description":"Advanced paradigms for the design and analysis of efficient algorithms, including the use of randomness, linear programming, and semi-definite programming. Applications to data structures, approximating NP-hard optimization problems, learning, on-line and distributed problems.  Students are strongly encouraged to have introductory knowledge of algorithms (e.g.,COMP SCI 577)","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-a1ea26ed78cbd6e94bc3221e50a6ed9b6bf43871","semester":"1262","observed_at":"2025-05-25 09:16:55.180581+00:00","record_version_id":"120fc0bfebe67b4dbe664ba1de8abdad3394fc577a24dddeda1ac6a4eac24e37","course_id":"COMPSCI 787","course_uid":"course_1c792cd171ebabb5c5548c07","catalog_version_id":"4479b1c373eb7f6c37de033740f8e53b39dc27d10418f125f68649dd1485b091","course_number":787,"subjects":["COMPSCI"],"title":"ADVANCED ALGORITHMS","description":"Advanced paradigms for the design and analysis of efficient algorithms, including the use of randomness, linear programming, and semi-definite programming. Applications to data structures, approximating NP-hard optimization problems, learning, on-line and distributed problems.  Students are strongly encouraged to have introductory knowledge of algorithms (e.g.,COMP SCI 577)","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-a76a3505853d5ea9c13bb98472b87361d469e2ee","semester":"1262","observed_at":"2025-05-28 18:03:41.793846+00:00","record_version_id":"87ba123435549dea1940107fa467d7f0a42655fef33a6a4683598a48545df7e1","course_id":"COMPSCI 787","course_uid":"course_1c792cd171ebabb5c5548c07","catalog_version_id":"4479b1c373eb7f6c37de033740f8e53b39dc27d10418f125f68649dd1485b091","course_number":787,"subjects":["COMPSCI"],"title":"ADVANCED ALGORITHMS","description":"Advanced paradigms for the design and analysis of efficient algorithms, including the use of randomness, linear programming, and semi-definite programming. Applications to data structures, approximating NP-hard optimization problems, learning, on-line and distributed problems.  Students are strongly encouraged to have introductory knowledge of algorithms (e.g.,COMP SCI 577)","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-b285d591f6acf3aa1910e02edc297664db86eb8c","semester":"1262","observed_at":"2025-06-10 22:48:22.460295+00:00","record_version_id":"5deb346f0f2440e37f2875900650b0e695fb9d17274fc011a44be930df776a07","course_id":"COMPSCI 787","course_uid":"course_1c792cd171ebabb5c5548c07","catalog_version_id":"4479b1c373eb7f6c37de033740f8e53b39dc27d10418f125f68649dd1485b091","course_number":787,"subjects":["COMPSCI"],"title":"ADVANCED ALGORITHMS","description":"Advanced paradigms for the design and analysis of efficient algorithms, including the use of randomness, linear programming, and semi-definite programming. Applications to data structures, approximating NP-hard optimization problems, learning, on-line and distributed problems.  Students are strongly encouraged to have introductory knowledge of algorithms (e.g.,COMP SCI 577)","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-b79af756e4f00ba98231feb859ed8e98239eb811","semester":"1262","observed_at":"2025-05-22 02:47:56.931581+00:00","record_version_id":"276b25368f9796a5b010b45f8c6015b7a5ede2faed2b9cfd54e36aa8fc479092","course_id":"COMPSCI 787","course_uid":"course_1c792cd171ebabb5c5548c07","catalog_version_id":"4479b1c373eb7f6c37de033740f8e53b39dc27d10418f125f68649dd1485b091","course_number":787,"subjects":["COMPSCI"],"title":"ADVANCED ALGORITHMS","description":"Advanced paradigms for the design and analysis of efficient algorithms, including the use of randomness, linear programming, and semi-definite programming. Applications to data structures, approximating NP-hard optimization problems, learning, on-line and distributed problems.  Students are strongly encouraged to have introductory knowledge of algorithms (e.g.,COMP SCI 577)","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-b89e05b94730c6471439082d9279c0a834a4aeec","semester":"1262","observed_at":"2025-08-26 20:25:42.325239+00:00","record_version_id":"1884aeba9a288b5f3d93662c104dbff088cf75d8d8b7686eb578980d06a5c889","course_id":"COMPSCI 787","course_uid":"course_1c792cd171ebabb5c5548c07","catalog_version_id":"4479b1c373eb7f6c37de033740f8e53b39dc27d10418f125f68649dd1485b091","course_number":787,"subjects":["COMPSCI"],"title":"ADVANCED ALGORITHMS","description":"Advanced paradigms for the design and analysis of efficient algorithms, including the use of randomness, linear programming, and semi-definite programming. Applications to data structures, approximating NP-hard optimization problems, learning, on-line and distributed problems.  Students are strongly encouraged to have introductory knowledge of algorithms (e.g.,COMP SCI 577)","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-b9279a12d1f2688df9e556183c94d41a89e431dc","semester":"1262","observed_at":"2025-07-06 01:49:47.203835+00:00","record_version_id":"92ddfb0e0e4cb732ef25c2e23529867da32d5b5700aa9c810123e040a3b34308","course_id":"COMPSCI 787","course_uid":"course_1c792cd171ebabb5c5548c07","catalog_version_id":"4479b1c373eb7f6c37de033740f8e53b39dc27d10418f125f68649dd1485b091","course_number":787,"subjects":["COMPSCI"],"title":"ADVANCED ALGORITHMS","description":"Advanced paradigms for the design and analysis of efficient algorithms, including the use of randomness, linear programming, and semi-definite programming. Applications to data structures, approximating NP-hard optimization problems, learning, on-line and distributed problems.  Students are strongly encouraged to have introductory knowledge of algorithms (e.g.,COMP SCI 577)","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-bbdc905e96cc681a5e9a8b02c795b682206e36d1","semester":"1262","observed_at":"2025-06-25 08:02:45.445730+00:00","record_version_id":"684200aece7d4ffe6e68091235e91195e60a8acc9a545c64205bdbd5af89ac07","course_id":"COMPSCI 787","course_uid":"course_1c792cd171ebabb5c5548c07","catalog_version_id":"4479b1c373eb7f6c37de033740f8e53b39dc27d10418f125f68649dd1485b091","course_number":787,"subjects":["COMPSCI"],"title":"ADVANCED ALGORITHMS","description":"Advanced paradigms for the design and analysis of efficient algorithms, including the use of randomness, linear programming, and semi-definite programming. Applications to data structures, approximating NP-hard optimization problems, learning, on-line and distributed problems.  Students are strongly encouraged to have introductory knowledge of algorithms (e.g.,COMP SCI 577)","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-bde225b5243a13d81827aa173e39c78a652b54a0","semester":"1262","observed_at":"2025-05-23 07:22:33.219345+00:00","record_version_id":"4db58b11e551913308913284f6ed5fbc2bb42e0ae60b82dd42f0ab6d812c4188","course_id":"COMPSCI 787","course_uid":"course_1c792cd171ebabb5c5548c07","catalog_version_id":"4479b1c373eb7f6c37de033740f8e53b39dc27d10418f125f68649dd1485b091","course_number":787,"subjects":["COMPSCI"],"title":"ADVANCED ALGORITHMS","description":"Advanced paradigms for the design and analysis of efficient algorithms, including the use of randomness, linear programming, and semi-definite programming. Applications to data structures, approximating NP-hard optimization problems, learning, on-line and distributed problems.  Students are strongly encouraged to have introductory knowledge of algorithms (e.g.,COMP SCI 577)","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-c1fac4cbfde737f4f4ac02cdf15e6f5a9b5b676d","semester":"1262","observed_at":"2025-05-22 01:15:19.291664+00:00","record_version_id":"2b2b033542d9603e2cc1eb70deaf1d725281bdbbb5d2151277851bc15c5aafb5","course_id":"COMPSCI 787","course_uid":"course_1c792cd171ebabb5c5548c07","catalog_version_id":"4479b1c373eb7f6c37de033740f8e53b39dc27d10418f125f68649dd1485b091","course_number":787,"subjects":["COMPSCI"],"title":"ADVANCED ALGORITHMS","description":"Advanced paradigms for the design and analysis of efficient algorithms, including the use of randomness, linear programming, and semi-definite programming. Applications to data structures, approximating NP-hard optimization problems, learning, on-line and distributed problems.  Students are strongly encouraged to have introductory knowledge of algorithms (e.g.,COMP SCI 577)","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-c6b62be45f8a13cba109ef2a7741b9cd9a6b8272","semester":"1262","observed_at":"2025-08-24 08:48:09.035112+00:00","record_version_id":"39cf9b7481f8ef58703e5b2ad5ed7d3a618b2c4405c3bc49c2b7e917dadd810c","course_id":"COMPSCI 787","course_uid":"course_1c792cd171ebabb5c5548c07","catalog_version_id":"4479b1c373eb7f6c37de033740f8e53b39dc27d10418f125f68649dd1485b091","course_number":787,"subjects":["COMPSCI"],"title":"ADVANCED ALGORITHMS","description":"Advanced paradigms for the design and analysis of efficient algorithms, including the use of randomness, linear programming, and semi-definite programming. Applications to data structures, approximating NP-hard optimization problems, learning, on-line and distributed problems.  Students are strongly encouraged to have introductory knowledge of algorithms (e.g.,COMP SCI 577)","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-cc83f62cb6db61f39320916d819ad48ce55cd96d","semester":"1262","observed_at":"2025-05-22 00:45:35.735230+00:00","record_version_id":"22c99d28e59e3e4bd27c881cf09c8347937d8c8c814177745745cd40c711422c","course_id":"COMPSCI 787","course_uid":"course_1c792cd171ebabb5c5548c07","catalog_version_id":"4479b1c373eb7f6c37de033740f8e53b39dc27d10418f125f68649dd1485b091","course_number":787,"subjects":["COMPSCI"],"title":"ADVANCED ALGORITHMS","description":"Advanced paradigms for the design and analysis of efficient algorithms, including the use of randomness, linear programming, and semi-definite programming. Applications to data structures, approximating NP-hard optimization problems, learning, on-line and distributed problems.  Students are strongly encouraged to have introductory knowledge of algorithms (e.g.,COMP SCI 577)","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-d33818a01b6b4c5e2902e704da6e5b713742d4dc","semester":"1262","observed_at":"2025-10-13 10:46:24.251475+00:00","record_version_id":"6d85e1e72e6f6b53aca2ff10f40fe5cabcc5f7a5de15c3b967ee3b92c1b29724","course_id":"COMPSCI 787","course_uid":"course_1c792cd171ebabb5c5548c07","catalog_version_id":"4479b1c373eb7f6c37de033740f8e53b39dc27d10418f125f68649dd1485b091","course_number":787,"subjects":["COMPSCI"],"title":"ADVANCED ALGORITHMS","description":"Advanced paradigms for the design and analysis of efficient algorithms, including the use of randomness, linear programming, and semi-definite programming. Applications to data structures, approximating NP-hard optimization problems, learning, on-line and distributed problems.  Students are strongly encouraged to have introductory knowledge of algorithms (e.g.,COMP SCI 577)","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-d3c17db9832d3064916046caf891dd23f10b1bb9","semester":"1262","observed_at":"2025-08-26 11:30:42.288639+00:00","record_version_id":"8b2f9122a839ec048258e990232200cd4489e927cb4398e4db8ce154db9db734","course_id":"COMPSCI 787","course_uid":"course_1c792cd171ebabb5c5548c07","catalog_version_id":"4479b1c373eb7f6c37de033740f8e53b39dc27d10418f125f68649dd1485b091","course_number":787,"subjects":["COMPSCI"],"title":"ADVANCED ALGORITHMS","description":"Advanced paradigms for the design and analysis of efficient algorithms, including the use of randomness, linear programming, and semi-definite programming. Applications to data structures, approximating NP-hard optimization problems, learning, on-line and distributed problems.  Students are strongly encouraged to have introductory knowledge of algorithms (e.g.,COMP SCI 577)","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-d4ee226dc44268e9b6767fb9f5f20343322f494b","semester":"1262","observed_at":"2025-06-15 01:52:23.911697+00:00","record_version_id":"49dbaf2b97b8b00e833723a2bef21a0955c9dc9d4dd4e62910a426f13ecf9214","course_id":"COMPSCI 787","course_uid":"course_1c792cd171ebabb5c5548c07","catalog_version_id":"4479b1c373eb7f6c37de033740f8e53b39dc27d10418f125f68649dd1485b091","course_number":787,"subjects":["COMPSCI"],"title":"ADVANCED ALGORITHMS","description":"Advanced paradigms for the design and analysis of efficient algorithms, including the use of randomness, linear programming, and semi-definite programming. Applications to data structures, approximating NP-hard optimization problems, learning, on-line and distributed problems.  Students are strongly encouraged to have introductory knowledge of algorithms (e.g.,COMP SCI 577)","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-d8f9fc7f136e2033556d9d65bbdbdf33425dbdc9","semester":"1262","observed_at":"2025-05-28 16:48:12.400438+00:00","record_version_id":"54dfec6c8721549c21506462838a7f8c92eb3ecf0095f0f25a3396c5d9b5597c","course_id":"COMPSCI 787","course_uid":"course_1c792cd171ebabb5c5548c07","catalog_version_id":"4479b1c373eb7f6c37de033740f8e53b39dc27d10418f125f68649dd1485b091","course_number":787,"subjects":["COMPSCI"],"title":"ADVANCED ALGORITHMS","description":"Advanced paradigms for the design and analysis of efficient algorithms, including the use of randomness, linear programming, and semi-definite programming. Applications to data structures, approximating NP-hard optimization problems, learning, on-line and distributed problems.  Students are strongly encouraged to have introductory knowledge of algorithms (e.g.,COMP SCI 577)","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-dbbc9739c616c3846b2e796e00a36fa41225f7d8","semester":"1262","observed_at":"2025-06-01 17:47:19.325144+00:00","record_version_id":"f2dcada367d99deba2c2c72fc7202cccae35dd29772018a1f103a321849b8186","course_id":"COMPSCI 787","course_uid":"course_1c792cd171ebabb5c5548c07","catalog_version_id":"4479b1c373eb7f6c37de033740f8e53b39dc27d10418f125f68649dd1485b091","course_number":787,"subjects":["COMPSCI"],"title":"ADVANCED ALGORITHMS","description":"Advanced paradigms for the design and analysis of efficient algorithms, including the use of randomness, linear programming, and semi-definite programming. Applications to data structures, approximating NP-hard optimization problems, learning, on-line and distributed problems.  Students are strongly encouraged to have introductory knowledge of algorithms (e.g.,COMP SCI 577)","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-dbe5f2d24b48c3177297a3d69c553cc9d1194bac","semester":"1262","observed_at":"2025-09-14 05:00:27.366070+00:00","record_version_id":"181b206a0f22f4249c31b45fcef46d0546e771cce414665b87d60c505bea6ba7","course_id":"COMPSCI 787","course_uid":"course_1c792cd171ebabb5c5548c07","catalog_version_id":"4479b1c373eb7f6c37de033740f8e53b39dc27d10418f125f68649dd1485b091","course_number":787,"subjects":["COMPSCI"],"title":"ADVANCED ALGORITHMS","description":"Advanced paradigms for the design and analysis of efficient algorithms, including the use of randomness, linear programming, and semi-definite programming. Applications to data structures, approximating NP-hard optimization problems, learning, on-line and distributed problems.  Students are strongly encouraged to have introductory knowledge of algorithms (e.g.,COMP SCI 577)","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-dd357dc2758e9e282c30988a527ce37de92593b9","semester":"1264","observed_at":"2025-10-19 01:39:41.951404+00:00","record_version_id":"5a6ff84402d989ac3b730f1b39cc0c3970ef94dc80149ef5f2830a7ef6323a34","course_id":"COMPSCI 787","course_uid":"course_1c792cd171ebabb5c5548c07","catalog_version_id":"4479b1c373eb7f6c37de033740f8e53b39dc27d10418f125f68649dd1485b091","course_number":787,"subjects":["COMPSCI"],"title":"ADVANCED ALGORITHMS","description":"Advanced paradigms for the design and analysis of efficient algorithms, including the use of randomness, linear programming, and semi-definite programming. Applications to data structures, approximating NP-hard optimization problems, learning, on-line and distributed problems.  Students are strongly encouraged to have introductory knowledge of algorithms (e.g.,COMP SCI 577)","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-de74de559e409a3fe668685e28043b888d2e6841","semester":"1262","observed_at":"2025-06-27 07:38:50.882897+00:00","record_version_id":"1d73c1065bab786663849ed521029b6d922b2ad1ffad6fdfe55f7e52f871178a","course_id":"COMPSCI 787","course_uid":"course_1c792cd171ebabb5c5548c07","catalog_version_id":"4479b1c373eb7f6c37de033740f8e53b39dc27d10418f125f68649dd1485b091","course_number":787,"subjects":["COMPSCI"],"title":"ADVANCED ALGORITHMS","description":"Advanced paradigms for the design and analysis of efficient algorithms, including the use of randomness, linear programming, and semi-definite programming. Applications to data structures, approximating NP-hard optimization problems, learning, on-line and distributed problems.  Students are strongly encouraged to have introductory knowledge of algorithms (e.g.,COMP SCI 577)","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-deca7188cf536ade3203cd88b52a45e92a059617","semester":"1262","observed_at":"2025-06-27 00:37:46.087071+00:00","record_version_id":"d8b7f40bd354eff4b703f98a34a11a76941ba3a152babee5fd11b6297e968c8c","course_id":"COMPSCI 787","course_uid":"course_1c792cd171ebabb5c5548c07","catalog_version_id":"4479b1c373eb7f6c37de033740f8e53b39dc27d10418f125f68649dd1485b091","course_number":787,"subjects":["COMPSCI"],"title":"ADVANCED ALGORITHMS","description":"Advanced paradigms for the design and analysis of efficient algorithms, including the use of randomness, linear programming, and semi-definite programming. Applications to data structures, approximating NP-hard optimization problems, learning, on-line and distributed problems.  Students are strongly encouraged to have introductory knowledge of algorithms (e.g.,COMP SCI 577)","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-df60fa9ac3931c5612b0fa641b7a6f5fbec86fab","semester":"1262","observed_at":"2025-05-24 06:36:37.554678+00:00","record_version_id":"3cf363d84c37bfde8e41cb3259f0238320a1da254321389e5894b961058ad84e","course_id":"COMPSCI 787","course_uid":"course_1c792cd171ebabb5c5548c07","catalog_version_id":"4479b1c373eb7f6c37de033740f8e53b39dc27d10418f125f68649dd1485b091","course_number":787,"subjects":["COMPSCI"],"title":"ADVANCED ALGORITHMS","description":"Advanced paradigms for the design and analysis of efficient algorithms, including the use of randomness, linear programming, and semi-definite programming. Applications to data structures, approximating NP-hard optimization problems, learning, on-line and distributed problems.  Students are strongly encouraged to have introductory knowledge of algorithms (e.g.,COMP SCI 577)","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-e339da2d849aaf8bb4dceca07a84728af23cf755","semester":"1262","observed_at":"2025-07-23 08:49:22.748925+00:00","record_version_id":"f515a272b671901b0b4bba9dae4da3f17301d3d88ba1624124a8f8360e85f504","course_id":"COMPSCI 787","course_uid":"course_1c792cd171ebabb5c5548c07","catalog_version_id":"4479b1c373eb7f6c37de033740f8e53b39dc27d10418f125f68649dd1485b091","course_number":787,"subjects":["COMPSCI"],"title":"ADVANCED ALGORITHMS","description":"Advanced paradigms for the design and analysis of efficient algorithms, including the use of randomness, linear programming, and semi-definite programming. Applications to data structures, approximating NP-hard optimization problems, learning, on-line and distributed problems.  Students are strongly encouraged to have introductory knowledge of algorithms (e.g.,COMP SCI 577)","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-e934b1784835f5d36ae9b7ef0992b11e72c39142","semester":"1262","observed_at":"2025-06-01 06:21:25.219533+00:00","record_version_id":"bb68903e22e503ea39297b4d2d24c7eaebc5162c19643f017abcd20edcd6658e","course_id":"COMPSCI 787","course_uid":"course_1c792cd171ebabb5c5548c07","catalog_version_id":"4479b1c373eb7f6c37de033740f8e53b39dc27d10418f125f68649dd1485b091","course_number":787,"subjects":["COMPSCI"],"title":"ADVANCED ALGORITHMS","description":"Advanced paradigms for the design and analysis of efficient algorithms, including the use of randomness, linear programming, and semi-definite programming. Applications to data structures, approximating NP-hard optimization problems, learning, on-line and distributed problems.  Students are strongly encouraged to have introductory knowledge of algorithms (e.g.,COMP SCI 577)","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-ef471690c082448deebd2687eab84b0b78813c36","semester":"1262","observed_at":"2025-06-29 01:47:56.317645+00:00","record_version_id":"75d5ce6bd35578e0a78d88e28be437b777a558a26e4d31bfaffceb92a9508cdb","course_id":"COMPSCI 787","course_uid":"course_1c792cd171ebabb5c5548c07","catalog_version_id":"4479b1c373eb7f6c37de033740f8e53b39dc27d10418f125f68649dd1485b091","course_number":787,"subjects":["COMPSCI"],"title":"ADVANCED ALGORITHMS","description":"Advanced paradigms for the design and analysis of efficient algorithms, including the use of randomness, linear programming, and semi-definite programming. Applications to data structures, approximating NP-hard optimization problems, learning, on-line and distributed problems.  Students are strongly encouraged to have introductory knowledge of algorithms (e.g.,COMP SCI 577)","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-efc4e8e2cd7c3f68e059a308990c00c77c7611eb","semester":"1264","observed_at":"2025-10-16 05:48:13.935141+00:00","record_version_id":"817ad62145b145eb96a1778ad5d110edb6d27633759bb5da37c89b814fa7fcf2","course_id":"COMPSCI 787","course_uid":"course_1c792cd171ebabb5c5548c07","catalog_version_id":"4479b1c373eb7f6c37de033740f8e53b39dc27d10418f125f68649dd1485b091","course_number":787,"subjects":["COMPSCI"],"title":"ADVANCED ALGORITHMS","description":"Advanced paradigms for the design and analysis of efficient algorithms, including the use of randomness, linear programming, and semi-definite programming. Applications to data structures, approximating NP-hard optimization problems, learning, on-line and distributed problems.  Students are strongly encouraged to have introductory knowledge of algorithms (e.g.,COMP SCI 577)","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-f18b7749725097d41f69c60779ff38cf073b93b3","semester":"1262","observed_at":"2025-05-21 19:52:03.259353+00:00","record_version_id":"5b2b86baab37a02284c28381b4f9f4801d0d7bd997378f44606e54aa31b7b0d5","course_id":"COMPSCI 787","course_uid":"course_1c792cd171ebabb5c5548c07","catalog_version_id":"4479b1c373eb7f6c37de033740f8e53b39dc27d10418f125f68649dd1485b091","course_number":787,"subjects":["COMPSCI"],"title":"ADVANCED ALGORITHMS","description":"Advanced paradigms for the design and analysis of efficient algorithms, including the use of randomness, linear programming, and semi-definite programming. Applications to data structures, approximating NP-hard optimization problems, learning, on-line and distributed problems.  Students are strongly encouraged to have introductory knowledge of algorithms (e.g.,COMP SCI 577)","requirements_text":"Graduate/professional standing"}]