WP_Query Object
(
[query] => Array
(
[post_type] => tribe_events
[posts_per_page] => 5
[post_status] => publish
[orderby] => Array
(
[post_date] => ASC
[tec_event_start_date] => ASC
)
[order] => DESC
[tax_query] => Array
(
[0] => Array
(
[taxonomy] => post_tag
[field] => term_id
[terms] => 1541
)
)
[meta_query] => Array
(
[tec_event_start_date] => Array
(
[key] => _EventStartDate
[compare] => EXISTS
)
[tec_event_end_date] => Array
(
[key] => _EventEndDate
[value] => 2026-02-22 21:03:46
[compare] => >=
[type] => DATETIME
)
)
)
[query_vars] => Array
(
[post_type] => tribe_events
[posts_per_page] => 5
[post_status] => publish
[orderby] => Array
(
[post_date] => ASC
[tec_event_start_date] => ASC
)
[order] => DESC
[tax_query] => Array
(
[0] => Array
(
[taxonomy] => post_tag
[field] => term_id
[terms] => 1541
)
)
[error] =>
[m] =>
[p] => 0
[post_parent] =>
[subpost] =>
[subpost_id] =>
[attachment] =>
[attachment_id] => 0
[name] =>
[pagename] =>
[page_id] => 0
[second] =>
[minute] =>
[hour] =>
[day] => 0
[monthnum] => 0
[year] => 0
[w] => 0
[category_name] =>
[tag] =>
[cat] =>
[tag_id] => 1541
[author] =>
[author_name] =>
[feed] =>
[tb] =>
[paged] => 0
[meta_key] =>
[meta_value] =>
[preview] =>
[s] =>
[sentence] =>
[title] =>
[fields] => all
[menu_order] =>
[embed] =>
[category__in] => Array
(
)
[category__not_in] => Array
(
)
[category__and] => Array
(
)
[post__in] => Array
(
)
[post__not_in] => Array
(
)
[post_name__in] => Array
(
)
[tag__in] => Array
(
)
[tag__not_in] => Array
(
)
[tag__and] => Array
(
)
[tag_slug__in] => Array
(
)
[tag_slug__and] => Array
(
)
[post_parent__in] => Array
(
)
[post_parent__not_in] => Array
(
)
[author__in] => Array
(
)
[author__not_in] => Array
(
)
[search_columns] => Array
(
)
[meta_query] => Array
(
[tec_event_start_date] => Array
(
[key] => _EventStartDate
[compare] => EXISTS
)
[tec_event_end_date] => Array
(
[key] => _EventEndDate
[value] => 2026-02-22 21:03:46
[compare] => >=
[type] => DATETIME
)
)
[ignore_sticky_posts] =>
[suppress_filters] =>
[cache_results] => 1
[update_post_term_cache] => 1
[update_menu_item_cache] =>
[lazy_load_term_meta] => 1
[update_post_meta_cache] => 1
[nopaging] =>
[comments_per_page] => 50
[no_found_rows] =>
)
[tax_query] => WP_Tax_Query Object
(
[queries] => Array
(
[0] => Array
(
[taxonomy] => post_tag
[terms] => Array
(
[0] => 1541
)
[field] => term_id
[operator] => IN
[include_children] => 1
)
)
[relation] => AND
[table_aliases:protected] => Array
(
[0] => wp_term_relationships
)
[queried_terms] => Array
(
[post_tag] => Array
(
[terms] => Array
(
[0] => 1541
)
[field] => term_id
)
)
[primary_table] => wp_posts
[primary_id_column] => ID
)
[meta_query] => WP_Meta_Query Object
(
[queries] => Array
(
[tec_event_start_date] => Array
(
[key] => _EventStartDate
[compare] => EXISTS
)
[tec_event_end_date] => Array
(
[key] => _EventEndDate
[value] => 2026-02-22 21:03:46
[compare] => >=
[type] => DATETIME
)
[relation] => AND
)
[relation] => AND
[meta_table] => wp_postmeta
[meta_id_column] => post_id
[primary_table] => wp_posts
[primary_id_column] => ID
[table_aliases:protected] => Array
(
[0] => wp_postmeta
[1] => mt1
)
[clauses:protected] => Array
(
[tec_event_start_date] => Array
(
[key] => _EventStartDate
[compare] => EXISTS
[compare_key] => =
[alias] => wp_postmeta
[cast] => CHAR
)
[tec_event_end_date] => Array
(
[key] => _EventEndDate
[value] => 2026-02-22 21:03:46
[compare] => >=
[type] => DATETIME
[compare_key] => =
[alias] => mt1
[cast] => DATETIME
)
)
[has_or_relation:protected] =>
)
[date_query] =>
[request] => SELECT SQL_CALC_FOUND_ROWS wp_posts.ID
FROM wp_posts LEFT JOIN wp_term_relationships ON (wp_posts.ID = wp_term_relationships.object_id) INNER JOIN wp_postmeta ON ( wp_posts.ID = wp_postmeta.post_id ) INNER JOIN wp_postmeta AS mt1 ON ( wp_posts.ID = mt1.post_id )
WHERE 1=1 AND (
wp_term_relationships.term_taxonomy_id IN (1546)
) AND (
wp_postmeta.meta_key = '_EventStartDate'
AND
( mt1.meta_key = '_EventEndDate' AND CAST(mt1.meta_value AS DATETIME) >= '2026-02-22 21:03:46' )
) AND wp_posts.post_type = 'tribe_events' AND ((wp_posts.post_status = 'publish'))
GROUP BY wp_posts.ID
ORDER BY wp_posts.post_date ASC, CAST(wp_postmeta.meta_value AS CHAR) ASC
LIMIT 0, 5
[posts] => Array
(
[0] => WP_Post Object
(
[ID] => 89501
[post_author] => 1
[post_date] => 2026-02-18 08:25:23
[post_date_gmt] => 2026-02-18 08:25:23
[post_content] =>
Short Courses Announcement
Information Theory and its applications in communication, combinatorics, computer science, and statistics
Jaikumar Radhakrishnan
Distinguished Professor International Centre for Theoretical Sciences (ICTS-TIFR), Bengaluru
Abstract: We will begin by discussing the problem of information transmission and the main theorems of Shannon. We will introduce fundamental information theoretic quantities such as entropy, conditional entropy, relative entropy and mutual information and review the inequalities relating these quantities. Finally, we will present applications of the standard information theoretic inequalities in combinatorics, computer science and statistics. We will assume some familiarity with the basics of probability, but otherwise our discussion will be self-contained.
Bio: Jaikumar Radhakrishnan is a theoretical computer scientist with research interests in complexity theory, randomness and computation, quantum information and computation, combinatorics, and information theory. Radhakrishnan obtained his BTech in Computer Science and Engineering from IIT Kharagpur in 1985, and his PhD in Computer Science from Rutgers University, NJ, USA, in 1991. He joined the Tata Institute of Fundamental Research in 1991; in 2024 he moved to the International Centre for Theoretical Sciences (ICTS-TIFR), Bengaluru.
A Short Course on Economics and Computation
Rohit Vaish
Assistant Professor Department of Computer Science and Engineering, Indian Institute of Technology Delhi
Abstract: The course will provide an introduction to algorithmic game theory, which focuses on the design and analysis of algorithms in strategic environments. We will start by examining various types of "real-life" games, understanding the role that algorithms play in these situations, and exploring how incorrect incentives can lead to suboptimal outcomes. Following that, we will discuss some fun problems in the related area of computational social choice, including how computer science can prevent strategic manipulation in elections, and how to set up dates that are provably free of breakups.
Bio: Rohit Vaish is an Assistant Professor in the Department of Computer Science and Engineering at Indian Institute of Technology Delhi. His research is at the interface of computer science and economics, specifically in the area of computational social choice. He explores collective decision-making scenarios, including voting, matching, and fair division, through a computational lens.
Schedule:
-
March 13,2026:
-
Jaikumar Radhakrishnan: 10:00 AM - 11:00 AM, 11:30 AM to 12:30 PM (Information Theory)
-
Rohit Vaish: 2:30 PM-3:30 PM, 4:00 PM-5:00 PM (Algorithmic Game Theory)
-
March 14,2026:
-
Rohit Vaish: 10:00 AM - 11:00 AM, 11:30 AM to 12:30 PM (Algorithmic Game Theory)
-
Jaikumar Radhakrishnan: 2:30 PM-3:30 PM, 4:00 PM-5:00 PM (Information Theory)
[post_title] => Short course
[post_excerpt] =>
[post_status] => publish
[comment_status] => closed
[ping_status] => closed
[post_password] =>
[post_name] => short-course
[to_ping] =>
[pinged] =>
[post_modified] => 2026-02-18 08:26:14
[post_modified_gmt] => 2026-02-18 08:26:14
[post_content_filtered] =>
[post_parent] => 0
[guid] => https://www.ashoka.edu.in?post_type=tribe_events&p=89501
[menu_order] => 0
[post_type] => tribe_events
[post_mime_type] =>
[comment_count] => 0
[filter] => raw
)
[1] => WP_Post Object
(
[ID] => 89633
[post_author] => 1
[post_date] => 2026-02-20 02:02:10
[post_date_gmt] => 2026-02-20 02:02:10
[post_content] => Eligibility: All Ashoka Students / Faculty
Requirements: Your laptop. It will be a workshop.
Registration : Just match our vibe !
Anand S https://www.linkedin.com/in/sanand0/
Bio: Anand studies how LLMs think. After completing his B Tech from IIT Madras (‘96) he worked at IBM. After his MBA from IIMB (‘01) he worked at BCG, Infosys Consulting and later founded Gramener ( A data visualization and analytics company). He also teaches Data Science at IIT Madras. And most importantly, he has transcribed every single Calvin & Hobbes strip. He codes data stories, blogs at https://s-anand.net, plays Minecraft, and enjoys anime.
[post_title] => Vibe Craft - Code & Build
[post_excerpt] =>
[post_status] => publish
[comment_status] => closed
[ping_status] => closed
[post_password] =>
[post_name] => vibe-craft-code-build
[to_ping] =>
[pinged] =>
[post_modified] => 2026-02-20 02:02:10
[post_modified_gmt] => 2026-02-20 02:02:10
[post_content_filtered] =>
[post_parent] => 0
[guid] => https://www.ashoka.edu.in?post_type=tribe_events&p=89633
[menu_order] => 0
[post_type] => tribe_events
[post_mime_type] =>
[comment_count] => 0
[filter] => raw
)
[2] => WP_Post Object
(
[ID] => 89630
[post_author] => 1
[post_date] => 2026-02-20 07:56:18
[post_date_gmt] => 2026-02-20 07:56:18
[post_content] => Abstract: Code assistants powered by large language models have rapidly gained popularity, demonstrating impressive capability in generating small, well-scoped, greenfield code. However, their effectiveness drops sharply when applied to large, long-lived enterprise applications, where scale, legacy design patterns, and deep business logic pose significant challenges.
In this talk, we share insights from our experience building and evaluating IBM watsonx Code Assistant for Z on real-world, large-scale mainframe applications. We discuss the technical and architectural obstacles that arise in brownfield environments—such as program size, cross-program dependencies, legacy constructs, and domain-specific frameworks—and outline emerging opportunities and directions for making code assistants truly effective for enterprise modernization.
About the Speaker: Yogish Sabharwal is a Distinguished Engineer at IBM Research India, where he spearheads the AI for Code team. His leadership was pivotal in driving the core innovations behind the IBM watsonx Code Assistant for Z. With a career spanning over 25 years, Dr. Sabharwal has made significant contributions across the domains of Artificial Intelligence, High-Performance Computing, and networking.
He holds a Ph. D. from the Indian Institute of Technology (IIT) Delhi, specializing in approximation algorithms for computational geometry. Beyond his corporate leadership, he is a dedicated educator, and has served as adjunct faculty at IIT Delhi and Delhi University.
We look forward to your active participation.
[post_title] => Computer Science Colloquium
[post_excerpt] =>
[post_status] => publish
[comment_status] => closed
[ping_status] => closed
[post_password] =>
[post_name] => computer-science-colloquium
[to_ping] =>
[pinged] =>
[post_modified] => 2026-02-20 07:56:18
[post_modified_gmt] => 2026-02-20 07:56:18
[post_content_filtered] =>
[post_parent] => 0
[guid] => https://www.ashoka.edu.in?post_type=tribe_events&p=89630
[menu_order] => 0
[post_type] => tribe_events
[post_mime_type] =>
[comment_count] => 0
[filter] => raw
)
)
[post_count] => 3
[current_post] => -1
[before_loop] => 1
[in_the_loop] =>
[post] => WP_Post Object
(
[ID] => 89501
[post_author] => 1
[post_date] => 2026-02-18 08:25:23
[post_date_gmt] => 2026-02-18 08:25:23
[post_content] =>
Short Courses Announcement
Information Theory and its applications in communication, combinatorics, computer science, and statistics
Jaikumar Radhakrishnan
Distinguished Professor International Centre for Theoretical Sciences (ICTS-TIFR), Bengaluru
Abstract: We will begin by discussing the problem of information transmission and the main theorems of Shannon. We will introduce fundamental information theoretic quantities such as entropy, conditional entropy, relative entropy and mutual information and review the inequalities relating these quantities. Finally, we will present applications of the standard information theoretic inequalities in combinatorics, computer science and statistics. We will assume some familiarity with the basics of probability, but otherwise our discussion will be self-contained.
Bio: Jaikumar Radhakrishnan is a theoretical computer scientist with research interests in complexity theory, randomness and computation, quantum information and computation, combinatorics, and information theory. Radhakrishnan obtained his BTech in Computer Science and Engineering from IIT Kharagpur in 1985, and his PhD in Computer Science from Rutgers University, NJ, USA, in 1991. He joined the Tata Institute of Fundamental Research in 1991; in 2024 he moved to the International Centre for Theoretical Sciences (ICTS-TIFR), Bengaluru.
A Short Course on Economics and Computation
Rohit Vaish
Assistant Professor Department of Computer Science and Engineering, Indian Institute of Technology Delhi
Abstract: The course will provide an introduction to algorithmic game theory, which focuses on the design and analysis of algorithms in strategic environments. We will start by examining various types of "real-life" games, understanding the role that algorithms play in these situations, and exploring how incorrect incentives can lead to suboptimal outcomes. Following that, we will discuss some fun problems in the related area of computational social choice, including how computer science can prevent strategic manipulation in elections, and how to set up dates that are provably free of breakups.
Bio: Rohit Vaish is an Assistant Professor in the Department of Computer Science and Engineering at Indian Institute of Technology Delhi. His research is at the interface of computer science and economics, specifically in the area of computational social choice. He explores collective decision-making scenarios, including voting, matching, and fair division, through a computational lens.
Schedule:
-
March 13,2026:
-
Jaikumar Radhakrishnan: 10:00 AM - 11:00 AM, 11:30 AM to 12:30 PM (Information Theory)
-
Rohit Vaish: 2:30 PM-3:30 PM, 4:00 PM-5:00 PM (Algorithmic Game Theory)
-
March 14,2026:
-
Rohit Vaish: 10:00 AM - 11:00 AM, 11:30 AM to 12:30 PM (Algorithmic Game Theory)
-
Jaikumar Radhakrishnan: 2:30 PM-3:30 PM, 4:00 PM-5:00 PM (Information Theory)
[post_title] => Short course
[post_excerpt] =>
[post_status] => publish
[comment_status] => closed
[ping_status] => closed
[post_password] =>
[post_name] => short-course
[to_ping] =>
[pinged] =>
[post_modified] => 2026-02-18 08:26:14
[post_modified_gmt] => 2026-02-18 08:26:14
[post_content_filtered] =>
[post_parent] => 0
[guid] => https://www.ashoka.edu.in?post_type=tribe_events&p=89501
[menu_order] => 0
[post_type] => tribe_events
[post_mime_type] =>
[comment_count] => 0
[filter] => raw
)
[comment_count] => 0
[current_comment] => -1
[found_posts] => 3
[max_num_pages] => 1
[max_num_comment_pages] => 0
[is_single] =>
[is_preview] =>
[is_page] =>
[is_archive] => 1
[is_date] =>
[is_year] =>
[is_month] =>
[is_day] =>
[is_time] =>
[is_author] =>
[is_category] =>
[is_tag] => 1
[is_tax] =>
[is_search] =>
[is_feed] =>
[is_comment_feed] =>
[is_trackback] =>
[is_home] =>
[is_privacy_policy] =>
[is_404] =>
[is_embed] =>
[is_paged] =>
[is_admin] =>
[is_attachment] =>
[is_singular] =>
[is_robots] =>
[is_favicon] =>
[is_posts_page] =>
[is_post_type_archive] => 1
[query_vars_hash:WP_Query:private] => 92f6f19b5e80fd268b48b8c128a15329
[query_vars_changed:WP_Query:private] => 1
[thumbnails_cached] =>
[allow_query_attachment_by_filename:protected] =>
[stopwords:WP_Query:private] =>
[compat_fields:WP_Query:private] => Array
(
[0] => query_vars_hash
[1] => query_vars_changed
)
[compat_methods:WP_Query:private] => Array
(
[0] => init_query_flags
[1] => parse_tax_query
)
[query_cache_key:WP_Query:private] => wp_query:4af21954b9e61defcb3156b53a9fd7e0
[tribe_is_event] => 1
[tribe_is_multi_posttype] =>
[tribe_is_event_category] =>
[tribe_is_event_venue] =>
[tribe_is_event_organizer] =>
[tribe_is_event_query] => 1
[tribe_is_past] =>
)