iiinova — where your digital self keeps evolving

Arindam Khan @arindamkhan.bsky.social · 29/09/2026

We introduced online TSP scheduling to obtain an O(log^2 n)-competitive algorithm for online strip packing of convex polygons, improving the previous n^0.59. Work started in the Dagstuhl, and later a brilliant student Simon did amazing work to finish it during meetings spanning five time zones.

010

Arindam Khan @arindamkhan.bsky.social · 29/09/2026

-- We resolve a long-standing open problem (posed by Urrutia in 1996) by showing that every set of pairwise-disjoint fat convex objects contains a linear-size guillotine-separable subset. This was not known even for disks earlier. (3/n)

100

Arindam Khan @arindamkhan.bsky.social · 29/09/2026

🇮🇳 On Linear-Size Guillotine-Separable Subsets of Fat Convex Objects, Disks, and Squares; with Mark de Berg (Visiting Chair Prof at IISc), Debajyoti Kar (PhD student at IISc), and Rudrayan Kundu (MStat student from ISI Kolkata). 📄 arxiv.org/abs/2607.24147 (2/n)

arxiv.org

On Linear-Size Guillotine-Separable Subsets of Fat Convex Objects, Disks, and Squares

Let $\mathcal{K}$ be a family of pairwise disjoint objects in the plane. We say that a subset $\mathcal{K}^*\subseteq \mathcal{K}$ is \emph{separable} if it admits a sequence of guillotine cuts that s...

100

Arindam Khan @arindamkhan.bsky.social · 29/09/2026

Two of our papers have been accepted to SODA 2027. Together with papers at STOC’26 and FOCS’26 earlier this year, this completes the grand slam this year: 𝗦𝗧𝗢𝗖’26 ✅ 𝗙𝗢𝗖𝗦’26 ✅ 𝗦𝗢𝗗𝗔’27 ✅✅ Not quite Wimbledon, Roland Garros, and the US Open — but for a theory person, close enough. 🎾😂 (1/n)

130

Arindam Khan @arindamkhan.bsky.social · 08/09/2026

OpenAI claimed to have solved the actual Navier–Stokes problem, carrying Clay’s US$1 million prize. lnkd.in/g-ahmYwr Though it is clouded in controversies regarding stealing credits, threats, and malpractices: lnkd.in/gCF8hGRh

020

Arindam Khan @arindamkhan.bsky.social · 20/08/2026

In these two Algo-rindam videos (links in the comments), I explain the analysis of First Fit Algorithms for Bin Packing using "weight functions". 𝗪𝗵𝗮𝘁 𝗶𝘀 𝘆𝗼𝘂𝗿 𝗳𝗮𝘃𝗼𝘂𝗿𝗶𝘁𝗲 𝗲𝘅𝗮𝗺𝗽𝗹𝗲 𝗼𝗳 𝗮 “𝘀𝗶𝗺𝗽𝗹𝗲 𝗮𝗹𝗴𝗼𝗿𝗶𝘁𝗵𝗺, 𝗱𝗶𝗳𝗳𝗶𝗰𝘂𝗹𝘁 𝗮𝗻𝗮𝗹𝘆𝘀𝗶𝘀”?

110

Arindam Khan @arindamkhan.bsky.social · 11/08/2026

🎉 Delighted to share that my PhD student Sreenivasulu Karnati (Sreenivas) has received the prestigious Microsoft Research India PhD Award 2026! 🥳 Sreenivas is one of only nine awardees across India this year, and only one in Theory CS: lnkd.in/gXHuHhDG www.youtube.com/watch?v=dmdf...

youtube.com

Venkata Naga Sreenivasulu Karnati - 2026 MSRI Award introduction

YouTube video by Microsoft Research

060

Arindam Khan @arindamkhan.bsky.social · 06/08/2026

🎓 𝗣𝗿𝗲𝘀𝗲𝗻𝘁𝗶𝗻𝗴 𝗗𝗿. 𝗔𝗱𝗶𝘁𝘆𝗮 𝗦𝘂𝗯𝗿𝗮𝗺𝗮𝗻𝗶𝗮𝗻! Yesterday, my PhD student Aditya successfully defended his thesis! His thesis was examined by Prof. Naveen Garg (IIT Delhi) and Prof. Parinya Chalermsook (University of Sheffield, UK). He is going to join University of Waterloo as a postdoc. #PhD #CS #IISc

080

Arindam Khan @arindamkhan.bsky.social · 03/07/2026

In this work, we finally show that in several stochastic online models, one can achieve the “gold standard” guarantee: 𝗢𝗣𝗧 + 𝗼(𝗢𝗣𝗧) using a unifying framework. In other words, asymptotically, the online algorithm uses essentially as many bins as the best offline optimal solution! (4/4)

010

Arindam Khan @arindamkhan.bsky.social · 03/07/2026

Bin packing is a prototypical problem that connects approximation algorithms, online algorithms, and probability. For decades, stochastic versions of online bin packing have been studied by many stalwarts, including Peter Shor, Michel Talagrand, and David Johnson. (3/n)

110

Arindam Khan @arindamkhan.bsky.social · 03/07/2026

Bin packing is one of those deceptively simple problems that every algorithms student meets early: pack items using as few bins as possible. But in the online world, where decisions are irrevocable and the future is unknown, this simplicity hides decades of beautiful difficulty. (2/n)

110

Arindam Khan @arindamkhan.bsky.social · 03/07/2026

I am delighted to share that our paper has been accepted to 𝗙𝗢𝗖𝗦 𝟮𝟬𝟮𝟲! My wonderful coauthors: Kailash Gopal (Then a BTech student at IIT Madras and just joined predoc at Google DeepMind), Samyak Jha, RA at IISc (soon joining UW-Madison for PhD), and KVN Sreeniva (PhD student at IISc). #FOCS

180

Arindam Khan @arindamkhan.bsky.social · 21/06/2026

𝗕𝗶𝗽𝗮𝗿𝘁𝗶𝘁𝗲 𝗺𝗮𝘁𝗰𝗵𝗶𝗻𝗴 𝗶𝘀 𝗶𝗻 𝗡𝗖 -- 𝗲𝘅𝗰𝗶𝘁𝗶𝗻𝗴 𝗕𝗮𝗻𝗴𝗮𝗹𝗼𝗿𝗲 𝗧𝗵𝗲𝗼𝗿𝘆 𝗦𝗲𝗺𝗶𝗻𝗮𝗿 𝘁𝗮𝗹𝗸 𝗯𝘆 𝗥𝗼𝗵𝗶𝘁 𝗚𝘂𝗿𝗷𝗮𝗿 𝘁𝗵𝗶𝘀 𝗧𝘂𝗲𝘀𝗱𝗮𝘆 (𝟰𝗽𝗺 𝗜𝗻𝗱𝗶𝗮 𝘁𝗶𝗺𝗲)! Tuesday, 23 June 2026 16:00-17:00 India time. Teams Link: teams.microsoft.com/l/meetup-joi...

teams.microsoft.com

Join conversation

041

Arindam Khan @arindamkhan.bsky.social · 23/05/2026

Prof. Subir Kumar Ghosh (1953–2026) passed away last week. A former Prof at TIFR, Bombay, he launched the conference CALDAM and organized over 20 research workshops on algorithms across Indian universities. He is also known for his book on visibility algorithms. Rest in peace, Sir.

021

Arindam Khan @arindamkhan.bsky.social · 22/05/2026

𝗘𝘅𝗰𝗶𝘁𝗶𝗻𝗴 𝘁𝗶𝗺𝗲𝘀. 𝗛𝘂𝗺𝗮𝗻𝘀 + 𝗔𝗜. Erdős Unit Distance Problem: among n points in the plane, how many pairs can be distance 1 apart? After 80 years, OpenAI researchers gave a new lower-bound construction. Within hours, Will Sawin improved it to (n^{1.014}): arxiv.org/pdf/2605.20579 #Math #Geometry

021

Arindam Khan @arindamkhan.bsky.social · 17/04/2026

Today Jose Correa from the University of Chile will deliver an (online) survey talk at Bangalore Theory Seminar on "Prophet inequalities". Last week, Christian Coester (Oxford) gave a tutorial on mirror descent (and applications in online algorithms) Link: www.csa.iisc.ac.in/theorysemina...

csa.iisc.ac.in

Bangalore Theory Seminars

A Research Seminar Series in Theoretical Computer Science brough to you by various research institutions in Bangalore

042

Arindam Khan @arindamkhan.bsky.social · 12/04/2026

📢 Call for Papers: APPROX 2026 Serving on the PC of APPROX 2026, one of my favorite conferences. Will be held at Boston University (Aug 19–21, 2026), co-located with RANDOM and WOLA. 👉 Submissions are due May 6, 2026 More info: approxconference.wordpress.com

approxconference.wordpress.com

APPROX CONFERENCE

Visit the post for more.

072

Arindam Khan @arindamkhan.bsky.social · 12/03/2026

𝐓𝐡𝐞 𝐦𝐚𝐧 𝐰𝐡𝐨 𝐢𝐧𝐯𝐞𝐧𝐭𝐞𝐝 𝐐𝐮𝐢𝐜𝐤𝐬𝐨𝐫𝐭 𝐩𝐚𝐬𝐬𝐞𝐝 𝐚𝐰𝐚𝐲 𝐥𝐚𝐬𝐭 𝐰𝐞𝐞𝐤. Turing Award winner Sir Tony Hoare passed away last Thursday at the age of 92. At age 26, he invented Quicksort -- Taught in UG algorithms and still one of the most elegant and widely used algorithms. #CS #Algorithms #Quicksort

030

Arindam Khan @arindamkhan.bsky.social · 06/03/2026

Most of us can trace our journeys back to a few people who shaped how we think & what we work on. For me, two of them are Prof. Prasad Tetali (Carnegie Mellon University) & Prof. Mark de Berg (TU Eindhoven) -- both visiting us this week. This week also marks the start of Mark's sabbatical at IISc!

020

Arindam Khan @arindamkhan.bsky.social · 24/02/2026

Sandor Fekete visited IISc and gave an awesome talk on "Hard in Theory, Easy in Practice?"

040

Arindam Khan @arindamkhan.bsky.social · 11/02/2026

𝗔𝗽𝗽𝗹𝗶𝗰𝗮𝘁𝗶𝗼𝗻 𝗣𝗿𝗼𝗰𝗲𝗱𝘂𝗿𝗲 Applicants should prepare the following documents in PDF format: • Curriculum Vitae including publication list • Research statement describing proposed research (1-2 pages) • Contact details of two referees (they will be contacted later, if needed) (6/6)

010

Arindam Khan @arindamkhan.bsky.social · 11/02/2026

𝗘𝗹𝗶𝗴𝗶𝗯𝗶𝗹𝗶𝘁𝘆 Candidates must: • Hold a Ph.D. in Computer Science (in areas related to Algorithms) at the time of joining, with an excellent research record • Candidates who have submitted their Ph.D. thesis may also apply, provided proof of submission is included with the application. (5/n)

110

Arindam Khan @arindamkhan.bsky.social · 11/02/2026

𝗙𝗲𝗹𝗹𝗼𝘄𝘀𝗵𝗶𝗽 𝗢𝘃𝗲𝗿𝘃𝗶𝗲𝘄 Selected fellows will receive: • A consolidated fellowship of ₹80,000–1,30,000 per month (depending on experience and profile). • A research grant for conference travel, computing, and contingency support Foreign nationals are eligible to apply. (4/n)

100

Arindam Khan @arindamkhan.bsky.social · 11/02/2026

𝗥𝗲𝘀𝗲𝗮𝗿𝗰𝗵 𝗔𝗿𝗲𝗮𝘀 (for postdoc applications) • Approximation Algorithms • Online Algorithms • Fair Division and Algorithmic Game Theory • Computational Geometry • Data Structures • Combinatorial Optimization • Online Learning • Beyond Worst-case Analysis • Spectral Algorithms (2/n)

110

Arindam Khan @arindamkhan.bsky.social · 11/02/2026

𝗖𝗮𝗹𝗹 𝗳𝗼𝗿 𝗣𝗼𝘀𝘁𝗱𝗼𝗰𝘁𝗼𝗿𝗮𝗹 𝗙𝗲𝗹𝗹𝗼𝘄𝘀 𝗶𝗻 𝗔𝗹𝗴𝗼𝗿𝗶𝘁𝗵𝗺𝘀 & 𝗧𝗵𝗲𝗼𝗿𝘆 𝗜𝗻𝗱𝗶𝗮𝗻 𝗜𝗻𝘀𝘁𝗶𝘁𝘂𝘁𝗲 𝗼𝗳 𝗦𝗰𝗶𝗲𝗻𝗰𝗲 (𝗜𝗜𝗦𝗰), 𝗕𝗲𝗻𝗴𝗮𝗹𝘂𝗿𝘂 The Algorithms group at IISc invites applications for multiple 𝗣𝗼𝘀𝘁-𝗗𝗼𝗰𝘁𝗼𝗿𝗮𝗹 𝗙𝗲𝗹𝗹𝗼𝘄𝘀𝗵𝗶𝗽𝘀 in Algorithms & Theory. 𝗔𝗽𝗽𝗹𝗶𝗰𝗮𝘁𝗶𝗼𝗻 𝗟𝗶𝗻𝗸: forms.gle/moz2vx7tiNFC... 𝗗𝗲𝗮𝗱𝗹𝗶𝗻𝗲: 28 February #postdocs (1/n)

lnkd.in

This link will take you to a page that’s not on LinkedIn

243

Arindam Khan @arindamkhan.bsky.social · 04/02/2026

New Blog: www.linkedin.com/pulse/how-ha... Some problems don’t yield to quick tricks. They demand patience and the humility to fail repeatedly. If you're working on a hard problem & wondering whether it’s worth it: 𝗧𝗵𝗲 𝗽𝗮𝘆𝗼𝗳𝗳 𝗶𝘀 𝗼𝗳𝘁𝗲𝗻 𝗮 𝗱𝗲𝗰𝗮𝗱𝗲 𝗮𝘄𝗮𝘆. 𝗧𝗵𝗮𝘁’𝘀 𝗼𝗸𝗮𝘆. #Research #CS #Theory #Algorithms

linkedin.com

How hard problems slowly give way -- Sometimes the payoff takes a decade.

Some problems don’t yield to quick tricks. They demand patience, structural understanding, and the humility to fail repeatedly.

020

Arindam Khan @arindamkhan.bsky.social · 02/02/2026

(6/6) 𝗥𝗲𝘀𝗲𝗮𝗿𝗰𝗵 𝗶𝘀 𝘆𝗲𝗮𝗿𝘀 𝗼𝗳 𝗳𝗮𝗶𝗹𝘂𝗿𝗲𝘀 𝗮𝗻𝗱 𝗮 𝗳𝗲𝘄 𝗱𝗮𝘆𝘀 𝗼𝗳 𝘀𝘂𝗰𝗰𝗲𝘀𝘀. 🥳 𝗧𝗼𝗱𝗮𝘆 𝗶𝘀 𝗼𝗻𝗲 𝗼𝗳 𝘁𝗵𝗼𝘀𝗲 𝗱𝗮𝘆𝘀. 🥳

040

Arindam Khan @arindamkhan.bsky.social · 02/02/2026

(5/n) 📈 The results. 1️⃣ Settles a classical open problem 2️⃣ introduces a resource contraction lemma, a structural tool that is likely to be useful far beyond this specific problem. 3️⃣ The paper establishes connections to fine-grained complexity (k-SUM conjecture), and proves structural barriers.

110

Arindam Khan @arindamkhan.bsky.social · 02/02/2026

(4/n) It generalizes the classical knapsack problem (NP-hard but admits PTAS). The central question that resisted progress for decades was: Can we get PTAS for the two-dimensional knapsack? It's repeatedly appeared as a major open question in lists of the top open problems in geometric packing.

110

Arindam Khan @arindamkhan.bsky.social · 02/02/2026

(3/n) The problem: The two-dimensional geometric knapsack problem with rotations lies at the heart of packing, scheduling, and resource allocation. The problem looks deceptively simple: 𝗚𝗶𝘃𝗲𝗻 𝗮 𝘀𝗲𝘁 𝗼𝗳 𝗿𝗲𝗰𝘁𝗮𝗻𝗴𝗹𝗲𝘀, 𝗽𝗮𝗰𝗸 𝗮𝘀 𝗺𝗮𝗻𝘆 𝗮𝘀 𝗽𝗼𝘀𝘀𝗶𝗯𝗹𝗲 𝗶𝗻𝘁𝗼 𝗮 𝘀𝗾𝘂𝗮𝗿𝗲 𝗶𝗻 𝗮𝗻 𝗮𝘅𝗶𝘀-𝗮𝗹𝗶𝗴𝗻𝗲𝗱 𝘄𝗮𝘆.

110

Arindam Khan @arindamkhan.bsky.social · 02/02/2026

🚨 𝗣𝗮𝗽𝗲𝗿 𝗶𝗻 𝗦𝗧𝗢𝗖 𝟮𝟬𝟮𝟲 | 𝗔 𝗵𝗶𝘀𝘁𝗼𝗿𝗶𝗰 𝗳𝗶𝗿𝘀𝘁! (1/n) 🎉 Huge congratulations to my PhD student Debajyoti Kar and collaborator Andreas Wiese 🎉 Our joint work has been accepted at STOC 2026 on approximation schemes for geometric knapsack with rotations.

090

Arindam Khan @arindamkhan.bsky.social · 27/01/2026

We show a mathematically grounded user-interest model capturing these effects and a near-optimal scheduling algorithm for ad timing. The main takeaway is simple: Uniform spacing is rarely optimal. Timing that respects human psychology matters. Link: arxiv.org/pdf/2509.20304 #ICLR #ML #Algorithms

arxiv.org

040

Arindam Khan @arindamkhan.bsky.social · 27/01/2026

We build an optimization framework grounded in three well-known effects from psychology: Mere exposure: early repetitions can increase interest, Hedonic adaptation: attention eventually decays, Fatigue / operant conditioning: overexposure backfires.

110

Arindam Khan @arindamkhan.bsky.social · 27/01/2026

𝐈𝐂𝐋𝐑 𝟐𝟎𝟐𝟔 𝐚𝐜𝐜𝐞𝐩𝐭𝐚𝐧𝐜𝐞: 𝐀𝐝𝐬 𝐭𝐡𝐚𝐭 𝐒𝐭𝐢𝐜𝐤 Most ad systems still do something very simple. They space ads uniformly, or impose crude caps, and hope for the best. Humans, unfortunately, are not uniform. This paper asks a basic question: What if ad scheduling actually respected how human attention works?

131

Arindam Khan @arindamkhan.bsky.social · 24/12/2025

Unwavering Grit -- Lunch with "UG" Interns! Over the past seven years, I have mentored around 40 UG interns, and 20-25 of them joined PhD programs at top universities around the world. With curious and bright students, learning and enthusiasm flow both ways. #Internship #TheoryCS

020

Arindam Khan @arindamkhan.bsky.social · 19/12/2025

Traditionally hosted in India, FSTTCS is now taking a historic step. For the first time, FSTTCS 2026 will be held outside India, in Abu Dhabi, UAE. Looking ahead, FSTTCS 2027 will be hosted at IIT Indore. I am delighted to serve as the PC Chair (Track A) for 2027. #FSTTCS #India #CS #Theory

010

Arindam Khan @arindamkhan.bsky.social · 19/12/2025

𝗙𝗦𝗧𝗧𝗖𝗦 𝗴𝗼𝗲𝘀 𝗶𝗻𝘁𝗲𝗿𝗻𝗮𝘁𝗶𝗼𝗻𝗮𝗹! FSTTCS is a nearly 50-year-old flagship venue of IARCS (Indian Association for Research in Com Science). This week, FSTTCS is underway at BITS Pilani, Goa. This edition is the largest ever, with 50 accepted papers, 8 workshops, and 350+ participants from 18+ countries.

160

Arindam Khan @arindamkhan.bsky.social · 15/12/2025

𝗜𝗱𝗲𝗮𝘀 𝗢𝘃𝗲𝗿 𝗖𝗼𝗺𝗽𝘂𝘁𝗲. 𝗦𝗶𝗺𝗽𝗹𝗶𝗰𝗶𝘁𝘆 𝗢𝘃𝗲𝗿 𝗤𝘂𝗮𝗻𝘁𝗶𝘁𝘆. Happy Theorists during Panel Discussions on Future of Graph Algorithms at the Department of Computer Science and Automation, Indian Institute of Science (IISc), Bangalore. #IISc #India #Algorithms #Graphs

030

Arindam Khan @arindamkhan.bsky.social · 13/12/2025

A fun-filled week of 𝗴𝗿𝗮𝗽𝗵 𝗮𝗹𝗴𝗼𝗿𝗶𝘁𝗵𝗺𝘀 at IISc, a truly 𝗻𝗲𝘁𝘄𝗼𝗿𝗸𝗲𝗱 and 𝗱𝘆𝗻𝗮𝗺𝗶𝗰 event 𝗱𝗶𝘀𝘁𝗿𝗶𝗯𝘂𝘁𝗲𝗱 over five days, 𝘀𝘁𝗿𝗲𝗮𝗺𝗲𝗱 𝗼𝗻𝗹𝗶𝗻𝗲 and 𝗰𝗼𝗻𝗻𝗲𝗰𝘁𝗶𝗻𝗴 over 150 in-person participants from multiple countries. By many 𝗽𝗮𝗿𝗮𝗺𝗲𝘁𝗲𝗿𝘀, the 𝗯𝗶𝗴𝗴𝗲𝘀𝘁 𝗮𝗹𝗴𝗼𝗿𝗶𝘁𝗵𝗺𝘀 𝗲𝘃𝗲𝗻𝘁 ever in India! #IISc #India #Algorithms #Graph

021

Arindam Khan @arindamkhan.bsky.social · 11/12/2025

With some of the brightest minds I admire. At my office during Graph Algorithms Workshop! Debmalya Panigrahi (Duke), Anupam Gupta (NYU), Amit Kumar (IITD), @Sujoy Bhore (IITB), Madhusudhan Reddy Pittu (NYU), and Debajyoti Kar (IISc)! With Erdős and Prasad Tetali in the background 🙂 #Algorithms

050

Arindam Khan @arindamkhan.bsky.social · 07/12/2025

🚀 Biggest-ever Algorithms event in India -- starts tomorrow! Thrilled to share that we are organizing the Frontiers of Graph Algorithms Workshop, happening from December 8–12, 2025, at the IISc! 🎓 Streaming Link: www.youtube.com/playlist?lis... Details: algo.csa.iisc.ac.in/graphworkshop/

062

Arindam Khan @arindamkhan.bsky.social · 25/11/2025

Had a wonderful time visiting Université libre de Bruxelles (ULB), Brussels. Photo with ALGO group (John Iacono, Stefan Langerman, and Jean Cardinal). #Algo #Geometry

030

Arindam Khan @arindamkhan.bsky.social · 19/11/2025

Excited to be at Dagstuhl this week for the seminar on 𝐎𝐧𝐥𝐢𝐧𝐞 𝐀𝐥𝐠𝐨𝐫𝐢𝐭𝐡𝐦𝐬 𝐁𝐞𝐲𝐨𝐧𝐝 𝐂𝐨𝐦𝐩𝐞𝐭𝐢𝐭𝐢𝐯𝐞 𝐀𝐧𝐚𝐥𝐲𝐬𝐢𝐬! Key themes include learning-augmented algorithms, stochastic input models (random-order, IID, prophet), online algorithms with recourse, etc. #Algorithms #Beyond-Competitive-Analysis

020

Arindam Khan @arindamkhan.bsky.social · 16/10/2025

Registration Open: Ajit Diwan Memorial Workshop on Geometry, Graph, and Combinatorics. 📅 Dates: January 19–20, 2026 📍 Venue: RKMVERI, Belur - No registration fee. - Free boarding and lodging for participants. cs.rkmvu.ac.in/ADMemorialWo...

cs.rkmvu.ac.in

Ajit Diwan Memorial Workshop

043

Arindam Khan @arindamkhan.bsky.social · 11/10/2025

Part1: 🏴󠁧󠁢󠁥󠁮󠁧󠁿 🇺🇸 English: www.youtube.com/watch?v=oLVj... 🇮🇳 🇧🇩 Bangla: www.youtube.com/watch?v=3NTp... Part 2: 🏴󠁧󠁢󠁥󠁮󠁧󠁿 🇺🇸 English: www.youtube.com/watch?v=4-ms... 🇮🇳 🇧🇩 Bangla: www.youtube.com/watch?v=faDg... Part 3: 🏴󠁧󠁢󠁥󠁮󠁧󠁿 🇺🇸 English: www.youtube.com/watch?v=-OeT... 🇮🇳 🇧🇩 Bangla: www.youtube.com/watch?v=x8rM...

youtube.com

Algorithms: DAA (IISc): Lec 6A. Closest Pair Problem (Divide and Conquer)

YouTube video by Algo-rindam

010