BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Ashoka University - ECPv6.18.2//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-ORIGINAL-URL:https://www.ashoka.edu.in
X-WR-CALDESC:Events for Ashoka University
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:Asia/Kolkata
BEGIN:STANDARD
TZOFFSETFROM:+0530
TZOFFSETTO:+0530
TZNAME:IST
DTSTART:20250101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Asia/Kolkata:20260402T133000
DTEND;TZID=Asia/Kolkata:20260402T144500
DTSTAMP:20260327T201725Z
CREATED:20260327T201725Z
LAST-MODIFIED:20260327T201725Z
UID:91200-1775136600-1775141100@www.ashoka.edu.in
SUMMARY:Computer Science Seminar | The Group Access Bounds for Binary Search Trees
DESCRIPTION:Dear All\, \nThe Department of Computer Science invites you to a seminar on "The Group Access Bounds for Binary Search Trees" \nAbstract: In Binary Search Trees (BSTs)\, the access lemma (Sleator and Tarjan\, JACM 1985) is a property such that if a BST algorithm satisfies the access lemma\, then as a consequence\, it satisfies many other BST properties\, such as Balance Theorem\, Static optimality\, Static finger\, Working set\, etc. However\, there are many BST properties that are not known to be derived via the access lemma\, such as dynamic finger\, o(log n)-competitiveness\, k-finger\, etc. To overcome this\, we introduce the group access bounds that generalize the access lemma and imply properties that are far stronger than those implied by the classical access lemma. Using the group access bounds\, we give improved results for k-finger\,  o(log n)-competitiveness\, unified bound\, and unified bound with a time window. \nFurthermore\, we prove the simulation theorem: For every group access tree\, there is an online BST algorithm that is O(1)-competitive with its group access bound. In particular\, any new group access bound will automatically imply a new BST algorithm achieving the same bound. Thereby\, we obtain an improved k-finger bound (reference tree is an almost complete binary tree)\, an improved unified bound with a time window k\, and matching the best-known bound for Unified bound in the BST model. Since any dynamically optimal BST must achieve the group access bounds\, we believe our results provide a new direction towards proving o(log n)-competitiveness of Splay tree and Greedy\, two prime candidates for the dynamic optimality conjecture. \nAbout the Speaker:  Akash Pareek is a Postdoctoral Researcher in the Department of Computer Science at Université libre de Bruxelles\, where he is hosted by Prof. John Iacono. Previously\, he was a Walmart and KIAC Postdoctoral Fellow at IISc Bangalore\, working with Prof. Arindam Khan. He earned his Ph.D. in Computer Science from IIT Gandhinagar under the supervision of Prof. Manoj Gupta. His research interests lie in theoretical computer science\, with a focus on data structures\, online algorithms\, clustering\, and algorithms with predictions. \nWe look forward to your active participation.
URL:https://www.ashoka.edu.in/event/computer-science-seminar-the-group-access-bounds-for-binary-search-trees/
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Kolkata:20260402T183000
DTEND;TZID=Asia/Kolkata:20260402T193000
DTSTAMP:20260401T000051Z
CREATED:20260401T000051Z
LAST-MODIFIED:20260401T000051Z
UID:91297-1775154600-1775158200@www.ashoka.edu.in
SUMMARY:The Ethnoprimatology of Human Primate Interactions in India
DESCRIPTION:Dear All\, \nThe Department of Environmental Studies cordially invites you to the fourth colloquium in the Spring '26 Colloquium Series on Tuesday\, 2nd April 2026. \nTitle: The Ethnoprimatology of Human Primate Interactions in India  \nSpeaker: Dr. SINDHU RADHAKRISHNA\, Professor and Head of the Animal Behaviour and Cognition Programme\, NIAS\, Bengaluru \nDate: 2nd April 2026 \nTime: 6:30 – 7:30 PM  \nZoom Link: https://zoom.us/j/99794180906?pwd=h7Lw0yvhxetxWlDXpCEsWSg5bpoje3.1  \nAbstract: Human primate conflict in India has expanded in scope and intensity over the years and threatens not only primate conservation but also the cultural relations that people have shared with primates in the country. Ethnoprimatology\, a subdiscipline in primatology\, views humans and primates as co-inhabitants of shared spaces who mutually influence each other’s lives and ecologies. This talk will examine how viewing human primate interactions through an ethnoprimatological lens grants us greater insights into human and primate behaviour and understanding the dynamics of conflict events.  \nSpeaker's Bio: Dr. Sindhu Radhakrishna is Professor and Head of the Animal Behaviour and Cognition Programme at the National Institute of Advanced Studies\, Bengaluru\, India. She is an ethologist and primatologist whose research focuses on primate social behaviour and cognition\, human-animal relations\, animal decision-making\, wildlife conservation\, and human-environment interactions. She is primarily interested in understanding how interactions between humans\, animals and the environment influence human and animal ecologies and cultures and explores these questions using primates as animal models. Prof Radhakrishna holds a master’s degree in Psychology from Annamalai University\, Tamil Nadu and a PhD in Animal Behaviour from Mysore University\, Karnataka.  She has published extensively and is the recipient of many research grants and honours\, notably the INSA Young Scientist Award in 2004\, the Nehru-Fulbright Fellowship in 2013\, and the DST-SERB Women Excellence Award in 2014. \n  \nWe look forward to your active participation in the talk. \nwarm regards\, \nEnvironmental Studies Department
URL:https://www.ashoka.edu.in/event/the-ethnoprimatology-of-human-primate-interactions-in-india/
END:VEVENT
END:VCALENDAR