Yishay Mansour

Proceedings of the 30th International Conference on Machine Learning, 2013

Regret Minimization for Branching Experts.

[BibT_eX]

[DOI]

Proceedings of the COLT 2013, 2013

An empirical study of trading agent robustness.

[BibT_eX]

[DOI]

Shai Hertz

Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2013

A Local Computation Approximation Scheme to Maximum Matching.

[BibT_eX]

[DOI]

Shai Vardi

Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2013

Scheduling Subset Tests: One-Time, Continuous, and How They Relate.

[BibT_eX]

[DOI]

Edith Cohen

Haim Kaplan

Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2013

2012

Online Set Packing.

[BibT_eX]

[DOI]

Yuval Emek

Magnús M. Halldórsson

Jaikumar Radhakrishnan

Dror Rawitz

SIAM J. Comput., 2012

The load-distance balancing problem.

[BibT_eX]

[DOI]

Networks, 2012

Distributed Learning, Communication Complexity and Privacy.

[BibT_eX]

[DOI]

Proceedings of the COLT 2012, 2012

Reliable agnostic learning.

[BibT_eX]

[DOI]

Adam Tauman Kalai

Varun Kanade

J. Comput. Syst. Sci., 2012

Doubleclick Ad Exchange Auction

[BibT_eX]

[DOI]

S. Muthukrishnan

CoRR, 2012

Overflow management with multipart packets.

[BibT_eX]

[DOI]

Dror Rawitz

Comput. Networks, 2012

The AND-OR Game: Equilibrium Characterization - (Working Paper).

[BibT_eX]

[DOI]

Proceedings of the Internet and Network Economics - 8th International Workshop, 2012

Learning Multiple Tasks using Shared Hypotheses.

[BibT_eX]

[DOI]

Koby Crammer

Proceedings of the Advances in Neural Information Processing Systems 25: 26th Annual Conference on Neural Information Processing Systems 2012. Proceedings of a meeting held December 3-6, 2012

Strictly-Black-Box Zero-Knowledge and Efficient Validation of Financial Transactions.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

Converting Online Algorithms to Local Computation Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

Ad Exchange - Proposal for a New Trading Agent Competition Game.

[BibT_eX]

[DOI]

Proceedings of the Agent-Mediated Electronic Commerce. Designing Trading Strategies and Mechanisms for Electronic Markets, 2012

A Model-Free Approach for a TAC-AA Trading Agent.

[BibT_eX]

[DOI]

Shai Hertz

Proceedings of the Agent-Mediated Electronic Commerce. Designing Trading Strategies and Mechanisms for Electronic Markets, 2012

2011

Non-price equilibria in markets of discrete goods.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 12th ACM Conference on Electronic Commerce (EC-2011), 2011

Pricing Exotic Derivatives Using Regret Minimization.

[BibT_eX]

[DOI]

Eyal Gofer

Proceedings of the Algorithmic Game Theory, 4th International Symposium, 2011

Welfare and Profit Maximization with Production Costs.

[BibT_eX]

[DOI]

Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011

Regret Minimization Algorithms for Pricing Lookback Options.

[BibT_eX]

[DOI]

Eyal Gofer

Proceedings of the Algorithmic Learning Theory - 22nd International Conference, 2011

2010

How long to equilibrium? The communication complexity of uncoupled equilibrium procedures.

[BibT_eX]

[DOI]

Sergiu Hart

Games Econ. Behav., 2010

Approximation Schemes for Sequential Posted Pricing in Multi-unit Auctions.

[BibT_eX]

[DOI]

Proceedings of the Internet and Network Economics - 6th International Workshop, 2010

Selective Call Out and Real Time Bidding.

[BibT_eX]

[DOI]

Proceedings of the Internet and Network Economics - 6th International Workshop, 2010

Regret Minimization and Job Scheduling.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2010: Theory and Practice of Computer Science, 2010

On the Equilibria of Alternating Move Games.

[BibT_eX]

[DOI]

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Online set packing and competitive scheduling of multi-part tasks.

[BibT_eX]

[DOI]

Yuval Emek

Magnús M. Halldórsson

Jaikumar Radhakrishnan

Dror Rawitz

Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010

Learning Bounds for Importance Weighting.

[BibT_eX]

[DOI]

Corinna Cortes

Proceedings of the Advances in Neural Information Processing Systems 23: 24th Annual Conference on Neural Information Processing Systems 2010. Proceedings of a meeting held 6-9 December 2010, 2010

Learning with Global Cost in Stochastic Environments.

[BibT_eX]

[DOI]

Proceedings of the COLT 2010, 2010

Regret Minimization With Concept Drift.

[BibT_eX]

[DOI]

Koby Crammer

Jennifer Wortman Vaughan

Proceedings of the COLT 2010, 2010

2009

Online Markov Decision Processes.

[BibT_eX]

[DOI]

Math. Oper. Res., 2009

Efficient graph topologies in network routing games.

[BibT_eX]

[DOI]

Amir Epstein

Michal Feldman

Games Econ. Behav., 2009

Strong equilibrium in cost sharing connection games.

[BibT_eX]

[DOI]

Amir Epstein

Michal Feldman

Games Econ. Behav., 2009

Strong price of anarchy.

[BibT_eX]

[DOI]

Michal Feldman

Games Econ. Behav., 2009

Bid optimization for broad match ad auctions.

[BibT_eX]

[DOI]

Proceedings of the 18th International Conference on World Wide Web, 2009

Multiple Source Adaptation and the Rényi Divergence.

[BibT_eX]

[DOI]

Afshin Rostamizadeh

Proceedings of the UAI 2009, 2009

On the convergence of regret minimization dynamics in concave games.

[BibT_eX]

[DOI]

Uri Nadav

Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009

Improved equilibria via public service advertising.

[BibT_eX]

[DOI]

Maria-Florina Balcan

Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

Learning and Domain Adaptation.

[BibT_eX]

[DOI]

Proceedings of the Discovery Science, 12th International Conference, 2009

Domain Adaptation: Learning Bounds and Algorithms.

[BibT_eX]

[DOI]

Afshin Rostamizadeh

Proceedings of the COLT 2009, 2009

Online Learning for Global Cost Functions.

[BibT_eX]

[DOI]

Proceedings of the COLT 2009, 2009

2008

Competitive buffer management for shared-memory switches.

[BibT_eX]

[DOI]

William Aiello

ACM Trans. Algorithms, 2008

Item pricing for revenue maximization.

[BibT_eX]

[DOI]

Maria-Florina Balcan

SIGecom Exch., 2008

Agnostically Learning Halfspaces.

[BibT_eX]

[DOI]

SIAM J. Comput., 2008

Regret to the best vs. regret to the average.

[BibT_eX]

[DOI]

Mach. Learn., 2008

Reducing mechanism design to algorithm design via machine learning.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2008

Position Auctions with Bidder-Specific Minimum Prices.

[BibT_eX]

[DOI]

Proceedings of the Internet and Network Economics, 4th International Workshop, 2008

On agnostic boosting and parity learning.

[BibT_eX]

[DOI]

Adam Tauman Kalai

Elad Verbin

Proceedings of the 40th Annual ACM Symposium on Theory of Computing, 2008

Competitive queue management for latency sensitive packets.

[BibT_eX]

[DOI]

Amos Fiat

Uri Nadav

Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Domain Adaptation with Multiple Sources.

[BibT_eX]

[DOI]

Afshin Rostamizadeh

Proceedings of the Advances in Neural Information Processing Systems 21, 2008

2007

A Time-Optimal Self-Stabilizing Synchronizer Using A Phase Clock.

[BibT_eX]

[DOI]

IEEE Trans. Dependable Secur. Comput., 2007

Convergence time to Nash equilibrium in load balancing.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2007

Active sampling for multiple output identification.

[BibT_eX]

[DOI]

Shai Fine

Mach. Learn., 2007

Improved second-order bounds for prediction with expert advice.

[BibT_eX]

[DOI]

Nicolò Cesa-Bianchi

Gilles Stoltz

Mach. Learn., 2007

From External to Internal Regret.

[BibT_eX]

[DOI]

J. Mach. Learn. Res., 2007

A Network Creation Game with Nonuniform Interests.

[BibT_eX]

[DOI]

Yair Halevi

Proceedings of the Internet and Network Economics, Third International Workshop, 2007

Learning, regret minimization and option pricing.

[BibT_eX]

[DOI]

Proceedings of the 11th Conference on Theoretical Aspects of Rationality and Knowledge (TARK-2007), 2007

The communication complexity of uncoupled nash equilibrium procedures.

[BibT_eX]

[DOI]

Sergiu Hart

Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007

Efficient contention resolution protocols for selfish agents.

[BibT_eX]

[DOI]

Amos Fiat

Uri Nadav

Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

The Value of Observation for Monitoring Dynamic Systems.

[BibT_eX]

[DOI]

Proceedings of the IJCAI 2007, 2007

2006

Harnessing Machine Learning to Improve the Success Rate of Stimuli Generation.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 2006

Action Elimination and Stopping Conditions for the Multi-Armed Bandit and Reinforcement Learning Problems.

[BibT_eX]

[DOI]

J. Mach. Learn. Res., 2006

Online trading algorithms and robust option pricing.

[BibT_eX]

[DOI]

Peter M. DeMarzo

Ilan Kremer

Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006

Combining Multiple Heuristics.

[BibT_eX]

[DOI]

Tzur Sayag

Shai Fine

Proceedings of the STACS 2006, 2006

(In)Stability properties of limit order dynamics.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 7th ACM Conference on Electronic Commerce (EC-2006), 2006

A sufficient condition for truthfulness with single parameter agents.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 7th ACM Conference on Electronic Commerce (EC-2006), 2006

2005

Combining Online Algorithms for Acceptance and Rejection.

[BibT_eX]

[DOI]

Theory Comput., 2005

Computation in Noisy Radio Networks.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2005

Concentration Bounds for Unigram Language Models.

[BibT_eX]

[DOI]

Evgeny Drukh

J. Mach. Learn. Res., 2005

Competitive queue policies for differentiated services.

[BibT_eX]

[DOI]

J. Algorithms, 2005

Improved Competitive Guarantees for QoS Buffering.

[BibT_eX]

[DOI]

Rob van Stee

Algorithmica, 2005

Adaptive AIMD Congestion Control.

[BibT_eX]

[DOI]

Algorithmica, 2005

Planning in POMDPs Using Multiplicity Automata.

[BibT_eX]

[DOI]

Proceedings of the UAI '05, 2005

Learning with attribute costs.

[BibT_eX]

[DOI]

Haim Kaplan

Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005

Fast convergence of selfish rerouting.

[BibT_eX]

[DOI]

Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

Reinforcement Learning in POMDPs Without Resets.

[BibT_eX]

[DOI]

Proceedings of the IJCAI-05, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, Edinburgh, Scotland, UK, July 30, 2005

Optimizing TCP Retransmission Timeout.

[BibT_eX]

[DOI]

Proceedings of the Networking, 2005

Mechanism Design via Machine Learning.

[BibT_eX]

[DOI]

Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 2005

2004

Harmonic buffer management policy for shared memory switches.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

Buffer Overflow Management in QoS Switches.

[BibT_eX]

[DOI]

SIAM J. Comput., 2004

Optimal smoothing schedules for real-time streams.

[BibT_eX]

[DOI]

Ofer Lapid

Distributed Comput., 2004

Auctions with Budget Constraints.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 2004

Improved combination of online algorithms for acceptance and rejection.

[BibT_eX]

[DOI]

David P. Bunde

Proceedings of the SPAA 2004: Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2004

Competitive algorithms for VWAP and limit order trading.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 5th ACM Conference on Electronic Commerce (EC-2004), 2004

Competitive on-line paging strategies for mobile users under delay constraints.

[BibT_eX]

[DOI]

Amotz Bar-Noy

Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, 2004

Experts in a Markov Decision Process.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 17 [Neural Information Processing Systems, 2004

Concentration Bounds for Unigrams Language Model.

[BibT_eX]

[DOI]

Evgeny Drukh

Proceedings of the Learning Theory, 17th Annual Conference on Learning Theory, 2004

2003

Diffusion without false rumors: on propagating updates in a Byzantine environment.

[BibT_eX]

[DOI]

Dahlia Malkhi

Michael K. Reiter

Theor. Comput. Sci., 2003

Predicting and bypassing end-to-end Internet service degradations.

[BibT_eX]

[DOI]

IEEE J. Sel. Areas Commun., 2003

Learning Rates for Q-learning.

[BibT_eX]

[DOI]

J. Mach. Learn. Res., 2003

Loss-bounded analysis for differentiated services.

[BibT_eX]

[DOI]

J. Algorithms, 2003

Centralized broadcast in multihop radio networks.

[BibT_eX]

[DOI]

Iris Gaber

J. Algorithms, 2003

Almost k-wise independence versus k-wise independence.

[BibT_eX]

[DOI]

Noga Alon

Oded Goldreich

Inf. Process. Lett., 2003

Competitive Management of Non-preemptive Queues with Multiple Values.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 17th International Conference, 2003

Combining online algorithms for rejection and acceptance.

[BibT_eX]

[DOI]

Yossi Azar

Proceedings of the SPAA 2003: Proceedings of the Fifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2003

Competitive queueing policies for QoS switches.

[BibT_eX]

[DOI]

An Zhu

Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

Adapting to a reliable network path.

[BibT_eX]

[DOI]

Baruch Awerbuch

Proceedings of the Twenty-Second ACM Symposium on Principles of Distributed Computing, 2003

Action Elimination and Stopping Conditions for Reinforcement Learning.

[BibT_eX]

[DOI]

Proceedings of the Machine Learning, 2003

Convergence Time to Nash Equilibria.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

AdaVegas: adaptive control for TCP Vegas.

[BibT_eX]

[DOI]

Amir Maor

Proceedings of the Global Telecommunications Conference, 2003

Buffer Overflows of Merging Streams.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2003

Approximate Equivalence of Markov Decision Processes.

[BibT_eX]

[DOI]

Proceedings of the Computational Learning Theory and Kernel Machines, 2003

2002

Simple Learning Algorithms for Decision Trees and Multivariate Polynomials.

[BibT_eX]

[DOI]

Nader H. Bshouty

SIAM J. Comput., 2002

A Sparse Sampling Algorithm for Near-Optimal Planning in Large Markov Decision Processes.

[BibT_eX]

[DOI]

Mach. Learn., 2002

Boosting Using Branching Programs.

[BibT_eX]

[DOI]

David A. McAllester

J. Comput. Syst. Sci., 2002

QoS-Competitive Video Buffering.

[BibT_eX]

[DOI]

Comput. Artif. Intell., 2002

Efficient Nash Computation in Large Population Games with Bounded Influence.

[BibT_eX]

[DOI]

Proceedings of the UAI '02, 2002

PAC Bounds for Multi-armed Bandit and Markov Decision Processes.

[BibT_eX]

[DOI]

Proceedings of the Computational Learning Theory, 2002

2001

Jitter control in QoS networks.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2001

Learning with Maximum-Entropy Distributions.

[BibT_eX]

[DOI]

Mach. Learn., 2001

Competitve buffer management for shared-memory switches.

[BibT_eX]

[DOI]

Ellen L. Hahne

Proceedings of the Thirteenth Annual ACM Symposium on Parallel Algorithms and Architectures, 2001

Convergence of Optimistic and Incremental Q-Learning.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 14 [Neural Information Processing Systems: Natural and Synthetic, 2001

Agnostic Boosting.

[BibT_eX]

[DOI]

Philip M. Long

Proceedings of the Computational Learning Theory, 2001

Why averaging classifiers can protect against overfitting.

[BibT_eX]

[DOI]

Yoav Freund

Robert E. Schapire

Proceedings of the Eighth International Workshop on Artificial Intelligence and Statistics, 2001

2000

Implementation Issues in the Fourier Transform Algorithm.

[BibT_eX]

[DOI]

Sigal Sahar

Mach. Learn., 2000

Phantom: a simple and effective flow control scheme.

[BibT_eX]

[DOI]

Comput. Networks, 2000

Nash Convergence of Gradient Dynamics in General-Sum Games.

[BibT_eX]

[DOI]

Satinder Singh

Proceedings of the UAI '00: Proceedings of the 16th Conference in Uncertainty in Artificial Intelligence, Stanford University, Stanford, California, USA, June 30, 2000

Fast Planning in Stochastic Games.

[BibT_eX]

[DOI]

Satinder Singh

Proceedings of the UAI '00: Proceedings of the 16th Conference in Uncertainty in Artificial Intelligence, Stanford University, Stanford, California, USA, June 30, 2000

Optimal smoothing schedules for real-time streams (extended abstract).

[BibT_eX]

[DOI]

Ofer Lapid

Proceedings of the Nineteenth Annual ACM Symposium on Principles of Distributed Computing, 2000

Generalization Bounds for Decision Trees.

[BibT_eX]

David A. McAllester

Proceedings of the Thirteenth Annual Conference on Computational Learning Theory (COLT 2000), June 28, 2000

1999

Bandwidth Allocation with Preemption.

[BibT_eX]

[DOI]

SIAM J. Comput., 1999

On the Boosting Ability of Top-Down Decision Tree Learning Algorithms.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1999

Trade-offs between Communication Throughput and Parallel Time.

[BibT_eX]

[DOI]

Uzi Vishkin

J. Complex., 1999

Convergence Complexity of Optimistic Rate-Based Flow-Control Algorithms.

[BibT_eX]

[DOI]

J. Algorithms, 1999

On Propagating Updates in a Byzantine Environment

[BibT_eX]

[DOI]

Dahlia Malkhi

Michael K. Reiter

CoRR, 1999

On the Complexity of Policy Iteration.

[BibT_eX]

[DOI]

Satinder Singh

Proceedings of the UAI '99: Proceedings of the Fifteenth Conference on Uncertainty in Artificial Intelligence, Stockholm, Sweden, July 30, 1999

On Diffusing Updates in a Byzantine Environment.

[BibT_eX]

[DOI]

Dahlia Malkhi

Michael K. Reiter

Proceedings of the Eighteenth Symposium on Reliable Distributed Systems, 1999

Policy Gradient Methods for Reinforcement Learning with Function Approximation.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 12, [NIPS Conference, Denver, Colorado, USA, November 29, 1999

Boosting with Multi-Way Branching in Decision Trees.

[BibT_eX]

[DOI]

David A. McAllester

Proceedings of the Advances in Neural Information Processing Systems 12, [NIPS Conference, Denver, Colorado, USA, November 29, 1999

Approximate Planning in Large POMDPs via Reusable Trajectories.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 12, [NIPS Conference, Denver, Colorado, USA, November 29, 1999

Empirical evaluation of interest-level criteria.

[BibT_eX]

[DOI]

Sigal Sahar

Proceedings of the Data Mining and Knowledge Discovery: Theory, 1999

Reinforcement Learning and Mistake Bounded Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Twelfth Annual Conference on Computational Learning Theory, 1999

Estimating a Mixture of Two Product Distributions.

[BibT_eX]

[DOI]

Yoav Freund

Proceedings of the Twelfth Annual Conference on Computational Learning Theory, 1999

1998

Lower Bounds for Randomized Mutual Exclusion.

[BibT_eX]

[DOI]

SIAM J. Comput., 1998

An Omega(D log (N/D)) Lower Bound for Broadcast in Radio Networks.

[BibT_eX]

[DOI]

SIAM J. Comput., 1998

Optimal Broadcast with Partial Knowledge.

[BibT_eX]

[DOI]

SIAM J. Comput., 1998

Learning Conjunctions with Noise under Product Distributions.

[BibT_eX]

[DOI]

Michal Parnas

Inf. Process. Lett., 1998

Exact Inference of Hidden Structure from Sample Data in noisy-OR Networks.

[BibT_eX]

[DOI]

Proceedings of the UAI '98: Proceedings of the Fourteenth Conference on Uncertainty in Artificial Intelligence, 1998

Competitive Dynamic Bandwidth Allocation.

[BibT_eX]

[DOI]

Amotz Bar-Noy

Proceedings of the Seventeenth Annual ACM Symposium on Principles of Distributed Computing, 1998

A Fast, Bottom-Up Decision Tree Pruning Algorithm with Near-Optimal Generalization.

[BibT_eX]

Proceedings of the Fifteenth International Conference on Machine Learning (ICML 1998), 1998

An approximation algorithm for minimum-cost network design.

[BibT_eX]

[DOI]

David Peleg

Proceedings of the Robust Communication Networks: Interconnection and Survivability, 1998

An Information-Theoretic Analysis of Hard and Soft Assignment Methods for Clustering.

[BibT_eX]

[DOI]

Proceedings of the Learning in Graphical Models, 1998

1997

Randomness in Private Computations.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1997

An Experimental and Theoretical Comparison of Model Selection Methods.

[BibT_eX]

[DOI]

Mach. Learn., 1997

Online Learning versus Offline Learning.

[BibT_eX]

[DOI]

Mach. Learn., 1997

A Construction of a Cipher from a Single Pseudorandom Permutation.

[BibT_eX]

[DOI]

Shimon Even

J. Cryptol., 1997

Efficient On-Line Call Control Algorithms.

[BibT_eX]

[DOI]

J. Algorithms, 1997

Slide-The Key to Polynomial End-to-End Communication.

[BibT_eX]

[DOI]

J. Algorithms, 1997

A Tight Bound for Approximating the Square Root.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1997

On Construction of k-Wise Independent Random Variables.

[BibT_eX]

[DOI]

Howard J. Karloff

Comb., 1997

An Information-Theoretic Analysis of Hard and Soft Assignment Methods for Clustering.

[BibT_eX]

[DOI]

Proceedings of the UAI '97: Proceedings of the Thirteenth Conference on Uncertainty in Artificial Intelligence, 1997

Pessimistic decision tree pruning based Continuous-time.

[BibT_eX]

Proceedings of the Fourteenth International Conference on Machine Learning (ICML 1997), 1997

Learning Under Persistent Drift.

[BibT_eX]

[DOI]

Yoav Freund

Proceedings of the Computational Learning Theory, Third European Conference, 1997

Virtual-credit: Efficient end-to-end credit based flow control.

[BibT_eX]

[DOI]

Proceedings of the Networks in Distributed Computing, 1997

1996

Convergence Complexity of Optimistic Rate Based Flow Control Algorithms (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, 1996

On the Convergence Complexity of Optimistic Rate Based Flow Control Algorithms (Brief Announcement).

[BibT_eX]

[DOI]

Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, 1996

On Learning Conjunctions with Malicious Noise.

[BibT_eX]

Michal Parnas

Proceedings of the Fourth Israel Symposium on Theory of Computing and Systems, 1996

Dynamic Bandwidth Allocation Policies.

[BibT_eX]

[DOI]

Proceedings of the Proceedings IEEE INFOCOM '96, 1996

Applying the Waek Learning Framework to Understand and Improve C4.5.

[BibT_eX]

Thomas G. Dietterich

Proceedings of the Machine Learning, 1996

1995

A Parametrization Scheme for Classifying Models of PAC Learnability

[BibT_eX]

[DOI]

Gyora M. Benedek

Inf. Comput., July, 1995

On Lotteries with Unique Winners.

[BibT_eX]

[DOI]

Michael O. Rabin

SIAM J. Discret. Math., 1995

Randomized Interpolation and Approximation of Sparse Polynomials.

[BibT_eX]

[DOI]

SIAM J. Comput., 1995

Greedy Packet Scheduling.

[BibT_eX]

[DOI]

SIAM J. Comput., 1995

An O(n^(log log n)) Learning Algorithm for DNT under the Uniform Distribution.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1995

epsilon-Discrepancy Sets and Their Application for Interpolation of Sparse Polynomials.

[BibT_eX]

[DOI]

Noga Alon

Inf. Process. Lett., 1995

Optimal Broadcast with Partial Knowledge (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Distributed Algorithms, 9th International Workshop, 1995

Many-to-one packet routing on grids (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 1995

Broadcast in Radio Networks.

[BibT_eX]

[DOI]

Iris Gaber

Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 1995

Efficient Algorithms for Learning to Play Repeated Games Against Computationally Bounded Adversaries.

[BibT_eX]

[DOI]

Proceedings of the 36th Annual Symposium on Foundations of Computer Science, 1995

Competitive Access Time via Dynamic Storage Rearrangement (Preliminary Version).

[BibT_eX]

[DOI]

Proceedings of the 36th Annual Symposium on Foundations of Computer Science, 1995

1994

Reliable Communication Over Unreliable Channels.

[BibT_eX]

[DOI]

J. ACM, 1994

On the learnability of discrete distributions.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 1994

Weakly learning DNF and characterizing statistical query learning using Fourier analysis.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 1994

1993

The Computational Complexity of Universal Hashing.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1993

Learning Decision Trees Using the Fourier Spectrum.

[BibT_eX]

[DOI]

SIAM J. Comput., 1993

Greedy Packet Scheduling on Shortest Paths.

[BibT_eX]

[DOI]

J. Algorithms, 1993

Constant Depth Circuits, Fourier Transform, and Learnability.

[BibT_eX]

[DOI]

J. ACM, 1993

The Impossibility of Implementing Reliable Communication in the Face of Crashes.

[BibT_eX]

[DOI]

J. ACM, 1993

Improved selection in totally monotone arrays.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 1993

Time optimal self-stabilizing synchronization.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993

An Omega(D log(N/D)) Lower Bound for Broadcast in Radio Networks.

[BibT_eX]

[DOI]

Proceedings of the Twelth Annual ACM Symposium on Principles of Distributed Computing, 1993

The Shrinking Generator.

[BibT_eX]

[DOI]

Don Coppersmith

Hugo Krawczyk

Proceedings of the Advances in Cryptology, 1993

1992

The Intractability of Bounded Protocols for On-Line Sequence Transmission over Non-FIFO Channels.

[BibT_eX]

[DOI]

J. ACM, 1992

Fast Exponentiation Using the Truncation Operation.

[BibT_eX]

[DOI]

Comput. Complex., 1992

An Efficient Topology Update Protocol for Dynamic Networks.

[BibT_eX]

[DOI]

Baruch Awerbuch

Proceedings of the Distributed Algorithms, 6th International Workshop, 1992

An O(nlog log n) Learning Algorithm for DNF Under the Uniform Distribution.

[BibT_eX]

[DOI]

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

1991

Results on Learnability and the Vapnik-Chervonenkis Dimension

[BibT_eX]

[DOI]

Ronald L. Rivest

Inf. Comput., January, 1991

Lower Bounds for Computations with the Floor Operation.

[BibT_eX]

[DOI]

SIAM J. Comput., 1991

A Lower Bound for Integer Greatest Common Divisor Computations.

[BibT_eX]

[DOI]

J. ACM, 1991

Learning Decision Trees Using the Fourier Sprectrum (Extended Abstract)

[BibT_eX]

[DOI]

Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, 1991

Greedy Packet Scheduling on Shortest Paths (Preliminary Version).

[BibT_eX]

[DOI]

Proceedings of the Tenth Annual ACM Symposium on Principles of Distributed Computing, 1991

Broadcast with Partial Knowledge (Preliminary Version).

[BibT_eX]

[DOI]

Proceedings of the Tenth Annual ACM Symposium on Principles of Distributed Computing, 1991

Improved Selection on Totally Monotone Arrays.

[BibT_eX]

[DOI]

James K. Park

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

Learning Monotone kµ DNF Formulas on Product Distributions.

[BibT_eX]

[DOI]

Thomas R. Hancock

Proceedings of the Fourth Annual Workshop on Computational Learning Theory, 1991

A Construction of a Cioher From a Single Pseudorandom Permutation.

[BibT_eX]

[DOI]

Shimon Even

Proceedings of the Advances in Cryptology, 1991

1990

Sorting on a Ring of Processors.

[BibT_eX]

[DOI]

Leonard J. Schulman

J. Algorithms, 1990

1989

Finding the Edge Connectivity of Directed Graphs.

[BibT_eX]

[DOI]

J. Algorithms, 1989

Bit Complexity of Order Statistics on a Distributed Star Network.

[BibT_eX]

[DOI]

Ornan Ori Gerstel

Shmuel Zaks

Inf. Process. Lett., 1989

On Completeness and Soundness in Interactive Proof Systems.

[BibT_eX]

Adv. Comput. Res., 1989

The Intractability of Bounded Protocols for Non-FIFO Channels.

[BibT_eX]

[DOI]

Proceedings of the Eighth Annual ACM Symposium on Principles of Distributed Computing, 1989

Source to Destination Communication in the Presence of Faults.

[BibT_eX]

[DOI]

Oded Goldreich

Amir Herzberg

Proceedings of the Eighth Annual ACM Symposium on Principles of Distributed Computing, 1989

Spill Code Minimization Techniques for Optimizing Compilers.

[BibT_eX]

[DOI]

David Bernstein

Dina Q. Goldin

Martin Charles Golumbic

Proceedings of the ACM SIGPLAN'89 Conference on Programming Language Design and Implementation (PLDI), 1989

The Complexity of Approximating the Square Root (Extended Summary)

[BibT_eX]

[DOI]

Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989

Polynomial End-To-End Communication (Extended Abstract)

[BibT_eX]

[DOI]

Baruch Awerbuch

Nir Shavit

Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989

A Parametrization Scheme for Classifying Models of Learnability.

[BibT_eX]

[DOI]

Gyora M. Benedek

Proceedings of the Second Annual Workshop on Computational Learning Theory, 1989

1988

Data Link Layer: Two Impossibility Results.

[BibT_eX]

[DOI]

Nancy A. Lynch

Alan D. Fekete

Proceedings of the Seventh Annual ACM Symposium on Principles of Distributed Computing, 1988

Lower Bounds for Integer Greatest Common Divisor Computations (Extended Summary)

[BibT_eX]

[DOI]

Proceedings of the 29th Annual Symposium on Foundations of Computer Science, 1988

Results on learnability and the Vapnik-Chervonenkis dimension (Extended Abstract)

[BibT_eX]

[DOI]

Ronald L. Rivest

Proceedings of the 29th Annual Symposium on Foundations of Computer Science, 1988

Results on Learnability and the Vapnick-Chervonenkis Dimension.

[BibT_eX]

[DOI]

Ronald L. Rivest

Proceedings of the First Annual Workshop on Computational Learning Theory, 1988

1987

On the Bit Complexity of Distributed Computations in a Ring with a Leader

[BibT_eX]

[DOI]

Shmuel Zaks

Inf. Comput., November, 1987

Language Complexity on the Synchronous Anonymous Ring.

[BibT_eX]

[DOI]

Hagit Attiya

Theor. Comput. Sci., 1987

Interactive Proof Systems: Provers that never Fail and Random Selection (Extended Abstract)

[BibT_eX]

[DOI]

Oded Goldreich