Iftah Gamzu

According to our database1, Iftah Gamzu authored at least 36 papers between 2007 and 2024.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Robust Training of Sequential Recommender Systems with Missing Input Data.
Proceedings of the Workshop Design, 2024

2021
Identifying Helpful Sentences in Product Reviews.
Proceedings of the 2021 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, 2021

2020
Query Rewriting for Voice Shopping Null Queries.
Proceedings of the 43rd International ACM SIGIR conference on research and development in Information Retrieval, 2020

2019
A polynomial-time approximation scheme for the airplane refueling problem.
J. Sched., 2019

2018
Automated Extractions for Machine Generated Mail.
Proceedings of the Companion of the The Web Conference 2018 on The Web Conference 2018, 2018

Unsubscription: A Simple Way to Ease Overload in Email.
Proceedings of the Eleventh ACM International Conference on Web Search and Data Mining, 2018

Advertisement Allocation and Mechanism Design in Native Stream Advertising.
Proceedings of the Complex Networks and Their Applications VII, 2018

2017
A Sublogarithmic Approximation for Tollbooth Pricing on Trees.
Math. Oper. Res., 2017

2016
Structural Clustering of Machine-Generated Mail.
Proceedings of the 25th ACM International Conference on Information and Knowledge Management, 2016

2015
Offline and Online Models of Budget Allocation for Maximizing Influence Spread.
CoRR, 2015

You Will Get Mail!Predicting the Arrival of Future Email.
Proceedings of the 24th International Conference on World Wide Web Companion, 2015

Improved Theoretical and Practical Guarantees for Chromatic Correlation Clustering.
Proceedings of the 24th International Conference on World Wide Web, 2015

2014
Mobile facility location: combinatorial filtering via weighted occupancy.
J. Comb. Optim., 2014

Generalized Reordering Buffer Management.
Proceedings of the 31st International Symposium on Theoretical Aspects of Computer Science, 2014

2013
The Asymmetric Matrix Partition Problem.
Proceedings of the Web and Internet Economics - 9th International Conference, 2013

The loss of serving in the dark.
Proceedings of the Symposium on Theory of Computing Conference, 2013

2012
Optimizing budget allocation among channels and influencers.
Proceedings of the 21st World Wide Web Conference 2012, 2012

Improved Approximation for Orienting Mixed Graphs.
Proceedings of the Structural Information and Communication Complexity, 2012

Signaling schemes for revenue maximization.
Proceedings of the 13th ACM Conference on Electronic Commerce, 2012

Efficient Submodular Function Maximization under Linear Packing Constraints.
Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

2011
On the Approximability of Reachability-Preserving Network Orientations.
Internet Math., 2011

Ranking with Submodular Valuations.
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Submodular Max-SAT.
Proceedings of the Algorithms - ESA 2011, 2011

2010
Web search ranking and allocation mechanisms
PhD thesis, 2010

A polylogarithmic approximation for computing non-metric terminal Steiner trees.
Inf. Process. Lett., 2010

Improved Orientations of Physical Networks.
Proceedings of the Algorithms in Bioinformatics, 10th International Workshop, 2010

A Sublogarithmic Approximation for Highway and Tollbooth Pricing.
Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

2009
Improved online algorithms for the sorting buffer problem on line metrics.
ACM Trans. Algorithms, 2009

Multiple intents re-ranking.
Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009

Buffer management for colored packets with deadlines.
Proceedings of the SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2009

Truthful Mechanisms via Greedy Iterative Packing.
Proceedings of the Approximation, 2009

2008
Group Renaming.
Proceedings of the Principles of Distributed Systems, 12th International Conference, 2008

Truthful Unification Framework for Packing Integer Programs with Choices.
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

2007
Improved Lower Bounds for Non-utilitarian Truthfulness.
Proceedings of the Approximation and Online Algorithms, 5th International Workshop, 2007

Improved Online Algorithms for the Sorting Buffer Problem.
Proceedings of the STACS 2007, 2007

Truthful unsplittable flow for large capacity networks.
Proceedings of the SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2007


  Loading...