2009 | ||
---|---|---|
208 | EE | Maria-Florina Balcan, Avrim Blum, Yishay Mansour: Improved equilibria via public service advertising. SODA 2009: 728-737 |
207 | EE | Eyal Even-Dar, Vahab S. Mirrokni, S. Muthukrishnan, Yishay Mansour, Uri Nadav: Bid optimization for broad match ad auctions. WWW 2009: 231-240 |
206 | EE | Eyal Even-Dar, Yishay Mansour, Vahab S. Mirrokni, S. Muthukrishnan, Uri Nadav: Bid Optimization in Broad-Match Ad Auctions CoRR abs/0901.3754: (2009) |
205 | EE | Yishay Mansour, Mehryar Mohri, Afshin Rostamizadeh: Domain Adaptation: Learning Bounds and Algorithms CoRR abs/0902.3430: (2009) |
2008 | ||
204 | EE | Maria-Florina Balcan, Avrim Blum, Yishay Mansour: Item pricing for revenue maximization. ACM Conference on Electronic Commerce 2008: 50-59 |
203 | EE | Yishay Mansour, Mehryar Mohri, Afshin Rostamizadeh: Domain Adaptation with Multiple Sources. NIPS 2008: 1041-1048 |
202 | EE | Amos Fiat, Yishay Mansour, Uri Nadav: Competitive queue management for latency sensitive packets. SODA 2008: 228-237 |
201 | EE | Adam Tauman Kalai, Yishay Mansour, Elad Verbin: On agnostic boosting and parity learning. STOC 2008: 629-638 |
200 | EE | Eyal Even-Dar, Jon Feldman, Yishay Mansour, S. Muthukrishnan: Position Auctions with Bidder-Specific Minimum Prices. WINE 2008: 577-584 |
199 | EE | William Aiello, Alexander Kesselman, Yishay Mansour: Competitive buffer management for shared-memory switches. ACM Transactions on Algorithms 5(1): (2008) |
198 | EE | Maria-Florina Balcan, Avrim Blum, Jason D. Hartline, Yishay Mansour: Reducing mechanism design to algorithm design via machine learning. J. Comput. Syst. Sci. 74(8): 1245-1270 (2008) |
197 | EE | Eyal Even-Dar, Michael Kearns, Yishay Mansour, Jennifer Wortman: Regret to the best vs. regret to the average. Machine Learning 72(1-2): 21-37 (2008) |
196 | EE | Adam Tauman Kalai, Adam R. Klivans, Yishay Mansour, Rocco A. Servedio: Agnostically Learning Halfspaces. SIAM J. Comput. 37(6): 1777-1805 (2008) |
2007 | ||
195 | EE | Amir Epstein, Michal Feldman, Yishay Mansour: Strong equilibrium in cost sharing connection games. ACM Conference on Electronic Commerce 2007: 84-92 |
194 | EE | Eyal Even-Dar, Michael J. Kearns, Yishay Mansour, Jennifer Wortman: Regret to the Best vs. Regret to the Average. COLT 2007: 233-247 |
193 | EE | Eyal Even-Dar, Sham M. Kakade, Yishay Mansour: The Value of Observation for Monitoring Dynamic Systems. IJCAI 2007: 2474-2479 |
192 | EE | Amos Fiat, Yishay Mansour, Uri Nadav: Efficient contention resolution protocols for selfish agents. SODA 2007: 179-188 |
191 | EE | Nir Andelman, Michal Feldman, Yishay Mansour: Strong price of anarchy. SODA 2007: 189-198 |
190 | EE | Sergiu Hart, Yishay Mansour: The communication complexity of uncoupled nash equilibrium procedures. STOC 2007: 345-353 |
189 | EE | Yishay Mansour: Learning, regret minimization and option pricing. TARK 2007: 2-3 |
188 | EE | Yair Halevi, Yishay Mansour: A Network Creation Game with Nonuniform Interests. WINE 2007: 287-292 |
187 | EE | Eyal Even-Dar, Alexander Kesselman, Yishay Mansour: Convergence time to Nash equilibrium in load balancing. ACM Transactions on Algorithms 3(3): (2007) |
186 | EE | Baruch Awerbuch, Shay Kutten, Yishay Mansour, Boaz Patt-Shamir, George Varghese: A Time-Optimal Self-Stabilizing Synchronizer Using A Phase Clock. IEEE Trans. Dependable Sec. Comput. 4(3): 180-190 (2007) |
185 | EE | Nicolò Cesa-Bianchi, Yishay Mansour, Gilles Stoltz: Improved second-order bounds for prediction with expert advice. Machine Learning 66(2-3): 321-352 (2007) |
184 | EE | Shai Fine, Yishay Mansour: Active sampling for multiple output identification. Machine Learning 69(2-3): 213-228 (2007) |
2006 | ||
183 | EE | Eyal Even-Dar, Sham M. Kakade, Michael S. Kearns, Yishay Mansour: (In)Stability properties of limit order dynamics. ACM Conference on Electronic Commerce 2006: 120-129 |
182 | EE | Nir Andelman, Yishay Mansour: A sufficient condition for truthfulness with single parameter agents. ACM Conference on Electronic Commerce 2006: 8-17 |
181 | EE | Shai Fine, Yishay Mansour: Active Sampling for Multiple Output Identification. COLT 2006: 620-634 |
180 | EE | Susanne Albers, Stefan Eilts, Eyal Even-Dar, Yishay Mansour, Liam Roditty: On nash equilibria for a network creation game. SODA 2006: 89-98 |
179 | EE | Tzur Sayag, Shai Fine, Yishay Mansour: Combining Multiple Heuristics. STACS 2006: 242-253 |
178 | EE | Peter DeMarzo, Ilan Kremer, Yishay Mansour: Online trading algorithms and robust option pricing. STOC 2006: 477-486 |
177 | EE | Shai Fine, Ari Freund, Itai Jaeger, Yishay Mansour, Yehuda Naveh, Avi Ziv: Harnessing Machine Learning to Improve the Success Rate of Stimuli Generation. IEEE Trans. Computers 55(11): 1344-1355 (2006) |
176 | EE | Eyal Even-Dar, Shie Mannor, Yishay Mansour: Action Elimination and Stopping Conditions for the Multi-Armed Bandit and Reinforcement Learning Problems. Journal of Machine Learning Research 7: 1079-1105 (2006) |
2005 | ||
175 | EE | Nicolò Cesa-Bianchi, Yishay Mansour, Gilles Stoltz: Improved Second-Order Bounds for Prediction with Expert Advice. COLT 2005: 217-232 |
174 | EE | Avrim Blum, Yishay Mansour: From External to Internal Regret. COLT 2005: 621-636 |
173 | EE | Adam Tauman Kalai, Adam R. Klivans, Yishay Mansour, Rocco A. Servedio: Agnostically Learning Halfspaces. FOCS 2005: 11-20 |
172 | EE | Maria-Florina Balcan, Avrim Blum, Jason D. Hartline, Yishay Mansour: Mechanism Design via Machine Learning. FOCS 2005: 605-614 |
171 | EE | Alexander Kesselman, Yishay Mansour: Optimizing TCP Retransmission Timeout. ICN (2) 2005: 133-140 |
170 | EE | Eyal Even-Dar, Sham M. Kakade, Yishay Mansour: Reinforcement Learning in POMDPs Without Resets. IJCAI 2005: 690-695 |
169 | EE | Eyal Even-Dar, Yishay Mansour: Fast convergence of selfish rerouting. SODA 2005: 772-781 |
168 | EE | Haim Kaplan, Eyal Kushilevitz, Yishay Mansour: Learning with attribute costs. STOC 2005: 356-365 |
167 | EE | Eyal Even-Dar, Sham M. Kakade, Yishay Mansour: Planning in POMDPs Using Multiplicity Automata. UAI 2005: 185-192 |
166 | EE | Alexander Kesselman, Yishay Mansour, Rob van Stee: Improved Competitive Guarantees for QoS Buffering. Algorithmica 43(1-2): 63-80 (2005) |
165 | EE | Alexander Kesselman, Yishay Mansour: Adaptive AIMD Congestion Control. Algorithmica 43(1-2): 97-111 (2005) |
164 | EE | William Aiello, Yishay Mansour, S. Rajagopolan, Adi Rosén: Competitive queue policies for differentiated services. J. Algorithms 55(2): 113-141 (2005) |
163 | EE | Evgeny Drukh, Yishay Mansour: Concentration Bounds for Unigram Language Models. Journal of Machine Learning Research 6: 1231-1264 (2005) |
162 | EE | Eyal Kushilevitz, Yishay Mansour: Computation in Noisy Radio Networks. SIAM J. Discrete Math. 19(1): 96-108 (2005) |
161 | EE | Yossi Azar, Avrim Blum, David P. Bunde, Yishay Mansour: Combining Online Algorithms for Acceptance and Rejection. Theory of Computing 1(1): 105-117 (2005) |
2004 | ||
160 | EE | Sham Kakade, Michael J. Kearns, Yishay Mansour, Luis E. Ortiz: Competitive algorithms for VWAP and limit order trading. ACM Conference on Electronic Commerce 2004: 189-198 |
159 | EE | Evgeny Drukh, Yishay Mansour: Concentration Bounds for Unigrams Language Model. COLT 2004: 170-185 |
158 | EE | Eyal Even-Dar, Sham M. Kakade, Yishay Mansour: Experts in a Markov Decision Process. NIPS 2004 |
157 | EE | Amotz Bar-Noy, Yishay Mansour: Competitive on-line paging strategies for mobile users under delay constraints. PODC 2004: 256-265 |
156 | EE | David P. Bunde, Yishay Mansour: Improved combination of online algorithms for acceptance and rejection. SPAA 2004: 265-266 |
155 | EE | Nir Andelman, Yishay Mansour: Auctions with Budget Constraints. SWAT 2004: 26-38 |
154 | EE | Yishay Mansour, Boaz Patt-Shamir, Ofer Lapid: Optimal smoothing schedules for real-time streams. Distributed Computing 17(1): 77-89 (2004) |
153 | EE | Alexander Kesselman, Zvi Lotker, Yishay Mansour, Boaz Patt-Shamir, Baruch Schieber, Maxim Sviridenko: Buffer Overflow Management in QoS Switches. SIAM J. Comput. 33(3): 563-583 (2004) |
152 | EE | Alexander Kesselman, Yishay Mansour: Harmonic buffer management policy for shared memory switches. Theor. Comput. Sci. 324(2-3): 161-182 (2004) |
2003 | ||
151 | EE | Eyal Even-Dar, Yishay Mansour: Approximate Equivalence of Markov Decision Processes. COLT 2003: 581-594 |
150 | EE | Nir Andelman, Yishay Mansour: Competitive Management of Non-preemptive Queues with Multiple Values. DISC 2003: 166-180 |
149 | EE | Alexander Kesselman, Zvi Lotker, Yishay Mansour, Boaz Patt-Shamir: Buffer Overflows of Merging Streams. ESA 2003: 349-360 |
148 | EE | Alexander Kesselman, Yishay Mansour, Rob van Stee: Improved Competitive Guarantees for QoS Buffering. ESA 2003: 361-372 |
147 | EE | Eyal Even-Dar, Alexander Kesselman, Yishay Mansour: Convergence Time to Nash Equilibria. ICALP 2003: 502-513 |
146 | Eyal Even-Dar, Shie Mannor, Yishay Mansour: Action Elimination and Stopping Conditions for Reinforcement Learning. ICML 2003: 162-169 | |
145 | EE | Alexander Kesselman, Yishay Mansour: Adaptive AIMD congestion control. PODC 2003: 352-359 |
144 | EE | Baruch Awerbuch, Yishay Mansour: Adapting to a reliable network path. PODC 2003: 360-367 |
143 | EE | Nir Andelman, Yishay Mansour, An Zhu: Competitive queueing policies for QoS switches. SODA 2003: 761-770 |
142 | EE | Yossi Azar, Avrim Blum, Yishay Mansour: Combining online algorithms for rejection and acceptance. SPAA 2003: 159-163 |
141 | EE | Alexander Kesselman, Yishay Mansour, Zvi Lotker, Boaz Patt-Shamir: Buffer overflows of merging streams. SPAA 2003: 244-245 |
140 | EE | Noga Alon, Oded Goldreich, Yishay Mansour: Almost k-wise independence versus k-wise independence. Inf. Process. Lett. 88(3): 107-110 (2003) |
139 | EE | Iris Gaber, Yishay Mansour: Centralized broadcast in multihop radio networks. J. Algorithms 46(1): 1-20 (2003) |
138 | EE | Alexander Kesselman, Yishay Mansour: Loss-bounded analysis for differentiated services. J. Algorithms 46(1): 79-95 (2003) |
137 | EE | Eyal Even-Dar, Yishay Mansour: Learning Rates for Q-learning. Journal of Machine Learning Research 5: 1-25 (2003) |
136 | EE | Dahlia Malkhi, Yishay Mansour, Michael K. Reiter: Diffusion without false rumors: on propagating updates in a Byzantine environment. Theor. Comput. Sci. 1-3(299): 289-306 (2003) |
2002 | ||
135 | EE | Eyal Even-Dar, Shie Mannor, Yishay Mansour: PAC Bounds for Multi-armed Bandit and Markov Decision Processes. COLT 2002: 255-270 |
134 | EE | Alexander Kesselman, Yishay Mansour: Harmonic Buffer Management Policy for Shared Memory Switches. INFOCOM 2002 |
133 | EE | Anat Bremler-Barr, Edith Cohen, Haim Kaplan, Yishay Mansour: Predicting and bypassing end-to-end internet service degradations. Internet Measurement Workshop 2002: 307-320 |
132 | Michael J. Kearns, Yishay Mansour: Efficient Nash Computation in Large Population Games with Bounded Influence. UAI 2002: 259-266 | |
131 | Alexander Kesselman, Yishay Mansour: QoS-Competitive Video Buffering. Computers and Artificial Intelligence 21(6): (2002) | |
130 | EE | Noga Alon, Oded Goldreich, Yishay Mansour: Almost k-wise independence versus k-wise independence Electronic Colloquium on Computational Complexity (ECCC)(048): (2002) |
129 | EE | Yishay Mansour, David A. McAllester: Boosting Using Branching Programs. J. Comput. Syst. Sci. 64(1): 103-112 (2002) |
128 | Michael J. Kearns, Yishay Mansour, Andrew Y. Ng: A Sparse Sampling Algorithm for Near-Optimal Planning in Large Markov Decision Processes. Machine Learning 49(2-3): 193-208 (2002) | |
127 | EE | Nader H. Bshouty, Yishay Mansour: Simple Learning Algorithms for Decision Trees and Multivariate Polynomials. SIAM J. Comput. 31(6): 1909-1925 (2002) |
2001 | ||
126 | EE | Shai Ben-David, Philip M. Long, Yishay Mansour: Agnostic Boosting. COLT/EuroCOLT 2001: 507-516 |
125 | EE | Eyal Even-Dar, Yishay Mansour: Learning Rates for Q-Learning. COLT/EuroCOLT 2001: 589-604 |
124 | EE | Eyal Even-Dar, Yishay Mansour: Convergence of Optimistic and Incremental Q-Learning. NIPS 2001: 1499-1506 |
123 | Alexander Kesselman, Yishay Mansour: QoS-Competitive Video Buffering. SIROCCO 2001: 217-230 | |
122 | EE | Alexander Kesselman, Yishay Mansour: Loss-bounded analysis for differentiated services. SODA 2001: 591-600 |
121 | EE | Ellen L. Hahne, Alexander Kesselman, Yishay Mansour: Competitve buffer management for shared-memory switches. SPAA 2001: 53-58 |
120 | EE | Alexander Kesselman, Zvi Lotker, Yishay Mansour, Boaz Patt-Shamir, Baruch Schieber, Maxim Sviridenko: Buffer overflow management in QoS switches. STOC 2001: 520-529 |
119 | EE | Yishay Mansour, Boaz Patt-Shamir: Jitter control in QoS networks. IEEE/ACM Trans. Netw. 9(4): 492-502 (2001) |
118 | Yishay Mansour, Mariano Schain: Learning with Maximum-Entropy Distributions. Machine Learning 45(2): 123-145 (2001) | |
2000 | ||
117 | Yishay Mansour, David A. McAllester: Boosting Using Branching Programs. COLT 2000: 220-224 | |
116 | Yishay Mansour, David A. McAllester: Generalization Bounds for Decision Trees. COLT 2000: 69-74 | |
115 | EE | William Aiello, Yishay Mansour, S. Rajagopolan, Adi Rosén: Competitive Queue Policies for Differentiated Services. INFOCOM 2000: 431-440 |
114 | EE | Yishay Mansour, Boaz Patt-Shamir, Ofer Lapid: Optimal smoothing schedules for real-time streams (extended abstract). PODC 2000: 21-29 |
113 | EE | Michael J. Kearns, Yishay Mansour, Satinder P. Singh: Fast Planning in Stochastic Games. UAI 2000: 309-316 |
112 | EE | Satinder P. Singh, Michael J. Kearns, Yishay Mansour: Nash Convergence of Gradient Dynamics in General-Sum Games. UAI 2000: 541-548 |
111 | EE | Yehuda Afek, Yishay Mansour, Zvi Ostfeld: Phantom: a simple and effective flow control scheme. Computer Networks 32(3): 277-305 (2000) |
110 | Yishay Mansour, Sigal Sahar: Implementation Issues in the Fourier Transform Algorithm. Machine Learning 40(1): 5-33 (2000) | |
1999 | ||
109 | EE | Yishay Mansour: Reinforcement Learning and Mistake Bounded Algorithms. COLT 1999: 183-192 |
108 | EE | Yoav Freund, Yishay Mansour: Estimating a Mixture of Two Product Distributions. COLT 1999: 53-62 |
107 | Michael J. Kearns, Yishay Mansour, Andrew Y. Ng: A Sparse Sampling Algorithm for Near-Optimal Planning in Large Markov Decision Processes. IJCAI 1999: 1324-1231 | |
106 | EE | Michael J. Kearns, Yishay Mansour, Andrew Y. Ng: Approximate Planning in Large POMDPs via Reusable Trajectories. NIPS 1999: 1001-1007 |
105 | EE | Richard S. Sutton, David A. McAllester, Satinder P. Singh, Yishay Mansour: Policy Gradient Methods for Reinforcement Learning with Function Approximation. NIPS 1999: 1057-1063 |
104 | EE | Yishay Mansour, David A. McAllester: Boosting with Multi-Way Branching in Decision Trees. NIPS 1999: 300-306 |
103 | EE | Dahlia Malkhi, Yishay Mansour, Michael K. Reiter: On Diffusing Updates in a Byzantine Environment. SRDS 1999: 134-143 |
102 | EE | Yishay Mansour, Satinder P. Singh: On the Complexity of Policy Iteration. UAI 1999: 401-408 |
101 | EE | Dahlia Malkhi, Yishay Mansour, Michael K. Reiter: On Propagating Updates in a Byzantine Environment CoRR cs.DC/9908010: (1999) |
100 | Yehuda Afek, Yishay Mansour, Zvi Ostfeld: Convergence Complexity of Optimistic Rate-Based Flow-Control Algorithms. J. Algorithms 30(1): 106-143 (1999) | |
99 | EE | Yishay Mansour, Noam Nisan, Uzi Vishkin: Trade-offs between Communication Throughput and Parallel Time. J. Complexity 15(1): 148-166 (1999) |
98 | Michael J. Kearns, Yishay Mansour: On the Boosting Ability of Top-Down Decision Tree Learning Algorithms. J. Comput. Syst. Sci. 58(1): 109-128 (1999) | |
97 | Amotz Bar-Noy, Ran Canetti, Shay Kutten, Yishay Mansour, Baruch Schieber: Bandwidth Allocation with Preemption. SIAM J. Comput. 28(5): 1806-1828 (1999) | |
1998 | ||
96 | EE | Yishay Mansour, Boaz Patt-Shamir: Jitter Control in QoS Networks. FOCS 1998: 50-59 |
95 | Michael J. Kearns, Yishay Mansour: A Fast, Bottom-Up Decision Tree Pruning Algorithm with Near-Optimal Generalization. ICML 1998: 269-277 | |
94 | EE | Amotz Bar-Noy, Yishay Mansour, Baruch Schieber: Competitive Dynamic Bandwidth Allocation. PODC 1998: 31-39 |
93 | Eyal Kushilevitz, Yishay Mansour: Computation in Noisy Radio Networks. SODA 1998: 236-243 | |
92 | EE | Michael J. Kearns, Yishay Mansour: Exact Inference of Hidden Structure from Sample Data in noisy-OR Networks. UAI 1998: 304-310 |
91 | EE | Yishay Mansour, Michal Parnas: Learning Conjunctions with Noise under Product Distributions. Inf. Process. Lett. 68(4): 189-196 (1998) |
90 | Eyal Kushilevitz, Yishay Mansour: An Omega(D log (N/D)) Lower Bound for Broadcast in Radio Networks. SIAM J. Comput. 27(3): 702-712 (1998) | |
89 | EE | Eyal Kushilevitz, Yishay Mansour, Michael O. Rabin, David Zuckerman: Lower Bounds for Randomized Mutual Exclusion. SIAM J. Comput. 27(6): 1550-1563 (1998) |
88 | Baruch Awerbuch, Israel Cidon, Shay Kutten, Yishay Mansour, David Peleg: Optimal Broadcast with Partial Knowledge. SIAM J. Comput. 28(2): 511-524 (1998) | |
1997 | ||
87 | EE | Yishay Mansour, Mariano Schain: Learning with Maximum-Entropy Distributions. COLT 1997: 201-210 |
86 | Yoav Freund, Yishay Mansour: Learning Under Persistent Drift. EuroCOLT 1997: 109-118 | |
85 | Yishay Mansour: Pessimistic decision tree pruning based Continuous-time. ICML 1997: 202-210 | |
84 | EE | Michael J. Kearns, Yishay Mansour, Andrew Y. Ng: An Information-Theoretic Analysis of Hard and Soft Assignment Methods for Clustering. UAI 1997: 282-293 |
83 | Howard J. Karloff, Yishay Mansour: On Construction of k-Wise Independent Random Variables. Combinatorica 17(1): 91-107 (1997) | |
82 | EE | Nader H. Bshouty, Yishay Mansour, Baruch Schieber, Prasoon Tiwari: A Tight Bound for Approximating the Square Root. Inf. Process. Lett. 63(4): 211-213 (1997) |
81 | Yehuda Afek, Baruch Awerbuch, Eli Gafni, Yishay Mansour, Adi Rosén, Nir Shavit: Slide-The Key to Polynomial End-to-End Communication. J. Algorithms 22(1): 158-186 (1997) | |
80 | Juan A. Garay, Inder S. Gopal, Shay Kutten, Yishay Mansour, Moti Yung: Efficient On-Line Call Control Algorithms. J. Algorithms 23(1): 180-194 (1997) | |
79 | Shimon Even, Yishay Mansour: A Construction of a Cipher from a Single Pseudorandom Permutation. J. Cryptology 10(3): 151-162 (1997) | |
78 | Michael J. Kearns, Yishay Mansour, Andrew Y. Ng, Dana Ron: An Experimental and Theoretical Comparison of Model Selection Methods. Machine Learning 27(1): 7-50 (1997) | |
77 | Shai Ben-David, Eyal Kushilevitz, Yishay Mansour: Online Learning versus Offline Learning. Machine Learning 29(1): 45-63 (1997) | |
76 | EE | Eyal Kushilevitz, Yishay Mansour: Randomness in Private Computations. SIAM J. Discrete Math. 10(4): 647-661 (1997) |
1996 | ||
75 | Thomas G. Dietterich, Michael J. Kearns, Yishay Mansour: Applying the Waek Learning Framework to Understand and Improve C4.5. ICML 1996: 96-104 | |
74 | Yehuda Afek, Menashe Cohen, Eyal Haalman, Yishay Mansour: Dynamic Bandwidth Allocation Policies. INFOCOM 1996: 880-887 | |
73 | Yishay Mansour, Michal Parnas: On Learning Conjunctions with Malicious Noise. ISTCS 1996: 170-175 | |
72 | Eyal Kushilevitz, Yishay Mansour: Randomness in Private Computations. PODC 1996: 181-190 | |
71 | Yehuda Afek, Yishay Mansour, Zvi Ostfeld: On the Convergence Complexity of Optimistic Rate Based Flow Control Algorithms (Brief Announcement). PODC 1996: 212 | |
70 | EE | Yehuda Afek, Yishay Mansour, Zvi Ostfeld: Phantom: A Simple and Effective Flow Control Scheme. SIGCOMM 1996: 169-182 |
69 | EE | Michael J. Kearns, Yishay Mansour: On the Boosting Ability of Top-Down Decision Tree Learning Algorithms. STOC 1996: 459-468 |
68 | EE | Yehuda Afek, Yishay Mansour, Zvi Ostfeld: Convergence Complexity of Optimistic Rate Based Flow Control Algorithms (Extended Abstract). STOC 1996: 89-98 |
1995 | ||
67 | EE | Michael J. Kearns, Yishay Mansour, Andrew Y. Ng, Dana Ron: An Experimental and Theoretical Comparison of Model Selection Methods. COLT 1995: 21-30 |
66 | Shai Ben-David, Eyal Kushilevitz, Yishay Mansour: Online learning versus offline learning. EuroCOLT 1995: 38-52 | |
65 | Nader H. Bshouty, Yishay Mansour: Simple Learning Algorithms for Decision Trees and Multivariate Polynomials. FOCS 1995: 304-311 | |
64 | Yoav Freund, Michael J. Kearns, Yishay Mansour, Dana Ron, Ronitt Rubinfeld, Robert E. Schapire: Efficient Algorithms for Learning to Play Repeated Games Against Computationally Bounded Adversaries. FOCS 1995: 332-341 | |
63 | Amos Fiat, Yishay Mansour, Adi Rosén, Orli Waarts: Competitive Access Time via Dynamic Storage Rearrangement (Preliminary Version). FOCS 1995: 392-401 | |
62 | EE | Yishay Mansour, Sigal Sahar: Implementation Issues in the Fourier Transform Algorithm. NIPS 1995: 260-266 |
61 | Iris Gaber, Yishay Mansour: Broadcast in Radio Networks. SODA 1995: 577-585 | |
60 | EE | Yishay Mansour, Boaz Patt-Shamir: Many-to-one packet routing on grids (Extended Abstract). STOC 1995: 258-267 |
59 | EE | Amotz Bar-Noy, Ran Canetti, Shay Kutten, Yishay Mansour, Baruch Schieber: Bandwidth allocation with preemption. STOC 1995: 616-625 |
58 | Baruch Awerbuch, Shay Kutten, Yishay Mansour, David Peleg: Optimal Broadcast with Partial Knowledge (Extended Abstract). WDAG 1995: 116-130 | |
57 | Shai Ben-David, Gyora M. Benedek, Yishay Mansour: A Parametrization Scheme for Classifying Models of PAC Learnability Inf. Comput. 120(1): 11-21 (1995) | |
56 | EE | Noga Alon, Yishay Mansour: epsilon-Discrepancy Sets and Their Application for Interpolation of Sparse Polynomials. Inf. Process. Lett. 54(6): 337-342 (1995) |
55 | Yishay Mansour: An O(n^(log log n)) Learning Algorithm for DNT under the Uniform Distribution. J. Comput. Syst. Sci. 50(3): 543-550 (1995) | |
54 | Israel Cidon, Shay Kutten, Yishay Mansour, David Peleg: Greedy Packet Scheduling. SIAM J. Comput. 24(1): 148-157 (1995) | |
53 | Yishay Mansour: Randomized Interpolation and Approximation of Sparse Polynomials. SIAM J. Comput. 24(2): 357-368 (1995) | |
52 | EE | Eyal Kushilevitz, Yishay Mansour, Michael O. Rabin: On Lotteries with Unique Winners. SIAM J. Discrete Math. 8(1): 93-98 (1995) |
1994 | ||
51 | EE | Avrim Blum, Merrick L. Furst, Jeffrey C. Jackson, Michael J. Kearns, Yishay Mansour, Steven Rudich: Weakly learning DNF and characterizing statistical query learning using Fourier analysis. STOC 1994: 253-262 |
50 | EE | Michael J. Kearns, Yishay Mansour, Dana Ron, Ronitt Rubinfeld, Robert E. Schapire, Linda Sellie: On the learnability of discrete distributions. STOC 1994: 273-282 |
49 | EE | Yishay Mansour, Noam Nisan, Uzi Vishkin: Trade-offs between communication throughput and parallel time. STOC 1994: 372-381 |
48 | EE | Yehuda Afek, Hagit Attiya, Alan Fekete, Michael J. Fischer, Nancy A. Lynch, Yishay Mansour, Da-Wei Wang, Lenore D. Zuck: Reliable Communication Over Unreliable Channels. J. ACM 41(6): 1267-1297 (1994) |
1993 | ||
47 | EE | Don Coppersmith, Hugo Krawczyk, Yishay Mansour: The Shrinking Generator. CRYPTO 1993: 22-39 |
46 | Juan A. Garay, Inder S. Gopal, Shay Kutten, Yishay Mansour, Moti Yung: Efficient On-Line Call Control Algorithms. ISTCS 1993: 285-293 | |
45 | Eyal Kushilevitz, Yishay Mansour: An Omega(D log(N/D)) Lower Bound for Broadcast in Radio Networks. PODC 1993: 65-74 | |
44 | EE | Eyal Kushilevitz, Yishay Mansour, Michael O. Rabin, David Zuckerman: Lower bounds for randomized mutual exclusion. STOC 1993: 154-163 |
43 | EE | Baruch Awerbuch, Shay Kutten, Yishay Mansour, Boaz Patt-Shamir, George Varghese: Time optimal self-stabilizing synchronization. STOC 1993: 652-661 |
42 | Yishay Mansour, James K. Park, Baruch Schieber, Sandeep Sen: Improved selection in totally monotone arrays. Int. J. Comput. Geometry Appl. 3(2): 115-132 (1993) | |
41 | EE | Nathan Linial, Yishay Mansour, Noam Nisan: Constant Depth Circuits, Fourier Transform, and Learnability. J. ACM 40(3): 607-620 (1993) |
40 | EE | Alan Fekete, Nancy A. Lynch, Yishay Mansour, John Spinelli: The Impossibility of Implementing Reliable Communication in the Face of Crashes. J. ACM 40(5): 1087-1107 (1993) |
39 | Yishay Mansour, Boaz Patt-Shamir: Greedy Packet Scheduling on Shortest Paths. J. Algorithms 14(3): 449-465 (1993) | |
38 | Eyal Kushilevitz, Yishay Mansour: Learning Decision Trees Using the Fourier Spectrum. SIAM J. Comput. 22(6): 1331-1348 (1993) | |
37 | Yishay Mansour, Noam Nisan, Prasoon Tiwari: The Computational Complexity of Universal Hashing. Theor. Comput. Sci. 107(1): 121-133 (1993) | |
1992 | ||
36 | EE | Yishay Mansour: An O(nlog log n) Learning Algorithm for DNF Under the Uniform Distribution. COLT 1992: 53-61 |
35 | Yishay Mansour: Randomized Interpolation and Approximation of Sparse Polynomials. ICALP 1992: 261-272 | |
34 | Baruch Awerbuch, Yishay Mansour: An Efficient Topology Update Protocol for Dynamic Networks. WDAG 1992: 185-202 | |
33 | Nader H. Bshouty, Yishay Mansour, Baruch Schieber, Prasoon Tiwari: Fast Exponentiation Using the Truncation Operation. Computational Complexity 2: 244-255 (1992) | |
32 | EE | Yishay Mansour, Baruch Schieber: The Intractability of Bounded Protocols for On-Line Sequence Transmission over Non-FIFO Channels. J. ACM 39(4): 783-799 (1992) |
1991 | ||
31 | Shimon Even, Yishay Mansour: A Construction of a Cioher From a Single Pseudorandom Permutation. ASIACRYPT 1991: 210-224 | |
30 | EE | Thomas R. Hancock, Yishay Mansour: Learning Monotone kµ DNF Formulas on Product Distributions. COLT 1991: 179-183 |
29 | Yishay Mansour, James K. Park, Baruch Schieber: Improved Selection on Totally Monotone Arrays. FSTTCS 1991: 347-359 | |
28 | Baruch Awerbuch, Israel Cidon, Shay Kutten, Yishay Mansour, David Peleg: Broadcast with Partial Knowledge (Preliminary Version). PODC 1991: 153-163 | |
27 | Yishay Mansour, Boaz Patt-Shamir: Greedy Packet Scheduling on Shortest Paths (Preliminary Version). PODC 1991: 165-175 | |
26 | Eyal Kushilevitz, Yishay Mansour: Learning Decision Trees Using the Fourier Sprectrum (Extended Abstract) STOC 1991: 455-464 | |
25 | Nathan Linial, Yishay Mansour, Ronald L. Rivest: Results on Learnability and the Vapnik-Chervonenkis Dimension Inf. Comput. 90(1): 33-49 (1991) | |
24 | EE | Yishay Mansour, Baruch Schieber, Prasoon Tiwari: A Lower Bound for Integer Greatest Common Divisor Computations. J. ACM 38(2): 453-471 (1991) |
23 | Yishay Mansour, Baruch Schieber, Prasoon Tiwari: Lower Bounds for Computations with the Floor Operation. SIAM J. Comput. 20(2): 315-327 (1991) | |
1990 | ||
22 | Yishay Mansour, Noam Nisan, Prasoon Tiwari: The Computational Complexity of Universal Hashing STOC 1990: 235-243 | |
21 | Yishay Mansour, Noam Nisan, Prasoon Tiwari: The Computational Complexity of Universal Hashing. Structure in Complexity Theory Conference 1990: 90 | |
20 | Israel Cidon, Shay Kutten, Yishay Mansour, David Peleg: Greedy Packet Scheduling. WDAG 1990: 169-184 | |
19 | Yishay Mansour, Leonard J. Schulman: Sorting on a Ring of Processors. J. Algorithms 11(4): 622-630 (1990) | |
1989 | ||
18 | EE | Shai Ben-David, Gyora M. Benedek, Yishay Mansour: A Parametrization Scheme for Classifying Models of Learnability. COLT 1989: 285-302 |
17 | Yishay Mansour, Baruch Schieber, Prasoon Tiwari: The Complexity of Approximating the Square Root (Extended Summary) FOCS 1989: 325-330 | |
16 | Baruch Awerbuch, Yishay Mansour, Nir Shavit: Polynomial End-To-End Communication (Extended Abstract) FOCS 1989: 358-363 | |
15 | Nathan Linial, Yishay Mansour, Noam Nisan: Constant Depth Circuits, Fourier Transform, and Learnability FOCS 1989: 574-579 | |
14 | Yishay Mansour, Baruch Schieber, Prasoon Tiwari: Lower Bounds for Computations with the Floor Operation. ICALP 1989: 559-573 | |
13 | David Bernstein, Dina Q. Goldin, Martin Charles Golumbic, Hugo Krawczyk, Yishay Mansour, Itai Nahshon, Ron Y. Pinter: Spill Code Minimization Techniques for Optimizing Compilers. PLDI 1989: 258-263 | |
12 | Yishay Mansour, Baruch Schieber: The Intractability of Bounded Protocols for Non-FIFO Channels. PODC 1989: 59-72 | |
11 | Oded Goldreich, Amir Herzberg, Yishay Mansour: Source to Destination Communication in the Presence of Faults. PODC 1989: 85-101 | |
10 | Ornan Ori Gerstel, Yishay Mansour, Shmuel Zaks: Bit Complexity of Order Statistics on a Distributed Star Network. Inf. Process. Lett. 30(3): 127-132 (1989) | |
9 | Yishay Mansour, Baruch Schieber: Finding the Edge Connectivity of Directed Graphs. J. Algorithms 10(1): 76-85 (1989) | |
1988 | ||
8 | EE | Nathan Linial, Yishay Mansour, Ronald L. Rivest: Results on Learnability and the Vapnick-Chervonenkis Dimension. COLT 1988: 56-68 |
7 | Nathan Linial, Yishay Mansour, Ronald L. Rivest: Results on learnability and the Vapnik-Chervonenkis dimension (Extended Abstract) FOCS 1988: 120-129 | |
6 | Yishay Mansour, Baruch Schieber, Prasoon Tiwari: Lower Bounds for Integer Greatest Common Divisor Computations (Extended Summary) FOCS 1988: 54-63 | |
5 | EE | Nancy A. Lynch, Yishay Mansour, Alan Fekete: Data Link Layer: Two Impossibility Results. PODC 1988: 149-170 |
1987 | ||
4 | Oded Goldreich, Yishay Mansour, Michael Sipser: Interactive Proof Systems: Provers that never Fail and Random Selection (Extended Abstract) FOCS 1987: 449-461 | |
3 | Yishay Mansour, Shmuel Zaks: On the Bit Complexity of Distributed Computations in a Ring with a Leader Inf. Comput. 75(2): 162-177 (1987) | |
2 | Hagit Attiya, Yishay Mansour: Language Complexity on the Synchronous Anonymous Ring. Theor. Comput. Sci. 53: 169-185 (1987) | |
1986 | ||
1 | Yishay Mansour, Shmuel Zaks: On the Bit Complexity of Distributed Computations in a Ring with a Leader. PODC 1986: 151-160 |