Bala Kalyanasundaram

Clifford Stein

Oper. Res. Lett., November, 2023

2021

On the Local Communication Complexity of Counting and Modular Arithmetic.

[BibT_eX]

[DOI]

Calvin Newport

CoRR, 2021

2013

Learning Behaviors of Functions with Teams.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2013

2012

A Near Optimal Periodic Transmission Schedule in Bounded Degree Wireless Sensor Network.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2012

2011

Analysis of a Simple Randomized Protocol to Establish Communication in Bounded Degree Sensor Networks.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing and Networking - 12th International Conference, 2011

2010

Learning Behaviors of Functions.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2010

2008

Taming teams with mind changes.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2008

2007

Bioinformatics Data Profiling Tools: A Prelude to Metabolic Profiling.

[BibT_eX]

[DOI]

Natarajan Ganesan

Proceedings of the Biocomputing 2007, 2007

2006

Capabilities of Thoughtful Machines.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2006

2005

Fault-Tolerant Scheduling.

[BibT_eX]

[DOI]

SIAM J. Comput., 2005

Unlocking the Advantages of Dynamic Service Selection and Pricing.

[BibT_eX]

[DOI]

John G. Waclawsky

Theory Comput. Syst., 2005

2004

Fairness to All While Downsizing.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004

2003

Editorial: Special Issue on On-Line Scheduling.

[BibT_eX]

[DOI]

J. Sched., 2003

Maximizing job completions online.

[BibT_eX]

[DOI]

J. Algorithms, 2003

Minimizing flow time nonclairvoyantly.

[BibT_eX]

[DOI]

J. ACM, 2003

On-Demand Broadcasting Under Deadline.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2003

2002

Caching for Web Searching.

[BibT_eX]

[DOI]

Algorithmica, 2002

2001

The Communication Complexity of Enumeration, Elimination, and Selection.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2001

Eliminating Migration in Multi-processor Scheduling.

[BibT_eX]

[DOI]

J. Algorithms, 2001

2000

An optimal deterministic algorithm for online b-matching.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2000

The Online Transportation Problem.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2000

Speed is as powerful as clairvoyance.

[BibT_eX]

[DOI]

J. ACM, 2000

Errata: A New Algorithm for Scheduling Periodic, Real-Time Tasks.

[BibT_eX]

[DOI]

Eric Torng

Algorithmica, 2000

Fault-Tolerant Real-Time Scheduling.

[BibT_eX]

[DOI]

Algorithmica, 2000

Dynamic Spectrum Allocation: The Impotency of Duration Notification.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 2000

Scheduling Broadcasts in Wireless Networks.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2000

1997

On-Line Load Balancing of Temporary Tasks.

[BibT_eX]

[DOI]

J. Algorithms, 1997

FINite Learning Capabilities and Their Limits.

[BibT_eX]

[DOI]

Proceedings of the Tenth Annual Conference on Computational Learning Theory, 1997

1996

On-line Network Optimization Problems.

[BibT_eX]

[DOI]

Proceedings of the Online Algorithms, 1996

1995

Breaking the Probability 1/2 Barrier in FIN-Type Learning.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1995

Towards Reduction Argumentf for FINite Learning.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Learning for Knowledge-Based Systems, GOSLER Final Report, 1995

Simulating Teams with Many Conjectures.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Learning Theory, 6th International Conference, 1995

1994

Constructing Competitive Tours from Local Information.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1994

Not All Insertion Methods Yield Constant Approximate Tours in the Euclidean Plane.

[BibT_eX]

[DOI]

Vineet Bafna

Theor. Comput. Sci., 1994

The power of probabilism in Popperian FINite learning.

[BibT_eX]

[DOI]

J. Exp. Theor. Artif. Intell., 1994

1993

Online Weighted Matching.

[BibT_eX]

[DOI]

J. Algorithms, 1993

A Competitive Analysis of Algorithms for Searching Unknown Scenes.

[BibT_eX]

[DOI]

Comput. Geom., 1993

Online Load Balancing of Temporary Tasks.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, Third Workshop, 1993

Capabilities of fallible FINite Learning.

[BibT_eX]

[DOI]

Proceedings of the Sixth Annual ACM Conference on Computational Learning Theory, 1993

Capabilities of Probabilistic Learners with Bounded Mind Changes.

[BibT_eX]

[DOI]

Proceedings of the Sixth Annual ACM Conference on Computational Learning Theory, 1993

Use of Reduction Arguments in Determining Popperian FIN-Type Learning Capabilities.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Learning Theory, 4th International Workshop, 1993

1 Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Computational Statistics., 1993

1992

The Probabilistic Communication Complexity of Set Intersection.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1992

A Competitive Analysis of Nearest Neighbor Based Algorithms for Searching Unknown Scenes (Preliminary Version).

[BibT_eX]

[DOI]

Proceedings of the STACS 92, 1992

Probabilistic and Pluralistic Learners with Mind Changes.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1992, 1992

Breaking the Probability <i>1/2</i> Barrier in FIN-Type Learning.

[BibT_eX]

[DOI]

Proceedings of the Fifth Annual ACM Conference on Computational Learning Theory, 1992

The Power of Probabilism in Popperian FINite Learning (extended abstract).

[BibT_eX]

[DOI]

Proceedings of the Analogical and Inductive Inference, 1992

Communication Complexity and Lower Bounds for Sequential Computation.

[BibT_eX]

[DOI]

Proceedings of the Informatik, Festschrift zum 60. Geburtstag von Günter Hotz, 1992

1991

On the power of white pebbles.

[BibT_eX]

[DOI]

Comb., 1991

On-Line Weighted Matching.

[BibT_eX]

[DOI]

Proceedings of the Second Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1991

Visual Searching and Mapping.

[BibT_eX]

[DOI]

Proceedings of the On-Line Algorithms, 1991

1990

Rounds Versus Time for the Two Person Pebble Game

[BibT_eX]

[DOI]

Inf. Comput., September, 1990

1989

Rounds versus Time for the Two Person Pebble Game (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the STACS 89, 1989

1988

On the Power of White Pebbles (Extended Abstract)

[BibT_eX]

[DOI]