Audience: Staff
-
Jorquera, Z. (CSE) – Quantum Entanglement Bounds and the Approximation Algorithms That Use Them
One of the central challenges in quantum computing is finding or approximating the ground-state energy of a local Hamiltonian, a quantum analogue of classical constraint satisfaction problems (CSPs). Among these, the Quantum Max-Cut problem serves as a canonical example, paralleling the classical Max-Cut problem. Despite its foundational importance in both theoretical computer science and condensed…
-
Business Administration Info Session
Strong business skills are the key to success. Join our live virtual discussion to explore how our courses and expert instructors can help you build a versatile and successful career in business. We’ll talk about business leadership essentials and management science as well as practical skills crucial for everyday business operations and strategies. Our curriculum…
-
Bioinformatics Info Session
Lead the next wave of innovation in life sciences and data. As biotechnology and data analytics converge, the demand for professionals who can interpret complex biological data and drive discovery continues to grow. Learn how experts in bioinformatics use computational tools, programming, and molecular biology to transform raw data into scientific and medical insights. Your…
-
Project and Program Management Info Session
Advance your career in project and program management. As organizations tackle more complex initiatives, the demand for skilled project leaders continues to grow. Learn how professionals across industries use Agile methods, AI tools, and data-driven insights to manage scope, schedule, and cost effectively. Join Tim Bombosch, chair of the UCSC Silicon Valley Extension Project and Program Management…
-
Marketing Management Info Session
Shape the future of marketing in the age of AI. As digital transformation accelerates, organizations need marketers who can blend creativity with data-driven insight. Learn how professionals in Silicon Valley use analytics, automation, and AI-powered tools to design integrated campaigns, engage customers, and measure real results. Join Ly-Huong Pham, Ph.D., M.B.A., chair of the UCSC Silicon…
-
ECE Supervision and Administration Info Session
Step into leadership in early childhood education. The need for skilled supervisors and administrators in early learning programs continues to grow. Childcare centers, preschools, and early education organizations all rely on leaders who can manage teams, ensure quality, and meet state standards. We’ll explore the key roles in early childhood supervision and administration—site director, program…
-
Embedded Systems Program Info Session
Build Your Career in Embedded Systems While hiring has slowed in some tech sectors, the demand for skilled Embedded Systems professionals continues to grow across industries. At this free winter info session, you’ll learn about emerging roles in embedded technology and the essential skills that make your resume stand out. Discover how AI is being…
-
Future careers: What will work look like in 2030?
Join Dean PK Agarwal for this free online session. He’ll lead a forward-looking conversation on emerging job roles in tech, sustainability, health, and creative industries. Learn how industry convergence and global trends are shaping new career paths and the skills you’ll need to stay relevant. Discover which industries are driving job creation and how roles…
-
Job search strategies in a competitive market
Join Dean PK Agarwal for this free, in-person and online event as he provides actionable tips on navigating today’s dynamic job market — from leveraging LinkedIn and digital portfolios to networking effectively and positioning yourself as a must-hire candidate. Ideal for career changers, recent grads, and mid-career professionals. In this session you’ll: Learn proven strategies…
-
Chen, Q. (CSE) – New Approximation and Online Algorithms using Novel Combinatorial Structures
Most optimization problems face the challenge of computing an optimum solution requiring superpolynomial time. In particular, they are classified as NP-hard problems that have no polynomial-time algorithm to date. Instead, computer scientists turn to find an approximate solution and create numerous elegant algorithms. However, in the modern era, computational environments have changed drastically, and we…