Bala Kalyanasundaram

From MaRDI portal
Person:230555

Available identifiers

zbMath Open kalyanasundaram.balaMaRDI QIDQ230555

List of research outcomes

PublicationDate of PublicationType
Simulating teams with many conjectures2023-12-08Paper
The online transportation problem2023-05-08Paper
Online load balancing of temporary tasks2023-01-18Paper
A competitive analysis of nearest neighbor based algorithms for searching unknown scenes2022-08-18Paper
Rounds versus time for the two person pebble game2022-08-16Paper
Fault-tolerant real-time scheduling2021-12-20Paper
Constructing competitive tours from local information2019-03-29Paper
Fault-tolerant scheduling2016-09-01Paper
Minimizing flow time nonclairvoyantly2015-11-12Paper
Learning Behaviors of Functions with Teams2013-07-30Paper
A near optimal periodic transmission schedule in bounded degree wireless sensor network2012-12-07Paper
Learning Behaviors of Functions2010-05-14Paper
Algorithms - ESA 20032010-03-03Paper
Taming teams with mind changes2008-06-10Paper
https://portal.mardi4nfdi.de/entity/Q34160842007-01-19Paper
Unlocking the advantages of dynamic service selection and pricing2006-02-08Paper
Fault-Tolerant Scheduling2005-09-16Paper
Automata, Languages and Programming2005-08-24Paper
Maximizing job completions online2004-10-01Paper
https://portal.mardi4nfdi.de/entity/Q44724642004-08-04Paper
https://portal.mardi4nfdi.de/entity/Q44374962003-12-02Paper
Dynamic spectrum allocation: the impotency of duration notification.2003-07-27Paper
Speed is as powerful as clairvoyance2003-06-25Paper
Caching for web searching2002-06-17Paper
Scheduling broadcasts in wireless networks2002-05-14Paper
The communication complexity of enumeration, elimination, and selection2002-04-11Paper
https://portal.mardi4nfdi.de/entity/Q27539442001-12-18Paper
Eliminating Migration in Multi-processor Scheduling2001-10-07Paper
https://portal.mardi4nfdi.de/entity/Q27219752001-07-11Paper
Errata: A new algorithm for scheduling periodic, real-time tasks2000-12-03Paper
Fault-tolerant real-time scheduling2000-08-27Paper
An optimal deterministic algorithm for online \(b\)-matching2000-08-23Paper
The Online Transportation Problem2000-07-20Paper
Constructing competitive tours from local information2000-06-21Paper
https://portal.mardi4nfdi.de/entity/Q42527062000-04-26Paper
https://portal.mardi4nfdi.de/entity/Q42523261999-06-17Paper
On-Line Load Balancing of Temporary Tasks1997-03-18Paper
Not all insertion methods yield constant approximate tours in the Euclidean plane1994-04-05Paper
A competitive analysis of algorithms for searching unknown scenes1993-10-24Paper
https://portal.mardi4nfdi.de/entity/Q31389581993-10-20Paper
Online Weighted Matching1993-06-29Paper
The Probabilistic Communication Complexity of Set Intersection1993-04-01Paper
https://portal.mardi4nfdi.de/entity/Q40103111992-09-27Paper
https://portal.mardi4nfdi.de/entity/Q40103161992-09-27Paper
On the power of white pebbles1992-06-27Paper
Rounds versus time for the two person pebble game1990-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Bala Kalyanasundaram