“A polynomial-time approximation scheme for planar multiway cut”, Mohammadhossein Bateni, MohammadTaghi Hajiaghayi, Philip Klein, Claire Mathieu, Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2012.
[cs.brown.edu] [pdf] [search]
“Impact Of Ranking Of Organic Search Results On The Incrementality Of Search Ads”, David Chan, Deepak Kumar, Sheng Ma, Jim Koehler, 2012.
[abstract] [pdf] [search]
“Simultaneous Approximations for Adversarial and Stochastic Online Budgeted Allocation”, Vahab Mirrokni, Shayan Oveis Gharan, Morteza Zadimoghaddam, Symposium on Discrete Algorithms (SODA) 2012 (to appear).
[search]
“A Filter-based Algorithm for Efficient Composition of Finite-State Transducers”, Cyril Allauzen, Michael Riley, Johan Schalkwyk, International Journal of Foundations of Computer Science (2011).
[pdf] [search]
“A Perfect Price Discrimination Market Model with Production, and a Rational Convex Program for it.”, Gagan Goel, Vijay Vazirani, Math of Operations Research, vol. 36 (2011), pp. 762-782.
[mor.journal.informs.org] [pdf] [search]
“Adapting Online Advertising Techniques to Television”, Sundar Dorai-Raj, Yannet Interian, Igor Naverniouk, Dan Zigmond, Online Multimedia Advertising: Techniques and Technologies, 2011, pp. 148-165.
[abstract] [pdf] [search]
“Advertising and Traffic: Learning from online video data”, Sundar Dorai-Raj, Dan Zigmond, Audience Measurement 6.0, 2011.
[abstract] [pdf] [search]
“Advertising and Traffic: Learning from online video data”, Dan Zigmond, Audience Measurement 6.0, 2011.
[abstract] [search]
“Approximation Schemes for Capacitated Geometric Network Design”, Anna Adamaszek, Artur Czumaj, Andrzej Lingas, Jakub Onufry Wojtaszczyk, ICALP 2011 (to appear).
[abstract] [pdf] [search]
“Data Augmentation, Frequentist Estimation, and the Bayesian Analysis of Multinomial Logit Models”, Steven L. Scott, Statistical Papers, vol. 52 (2011), pp. 87-109.
[springerlink.com] [search]
“Data augmentation for support vector machines”, Nicholas G. Polson, Steven L. Scott, Bayesian Analysis, vol. 6 (2011), pp. 1-24.
[ba.stat.cmu.edu] [search]
“Distinct counting with a self-learning bitmap”, Aiyou Chen, Jin Cao, Larry Shepp, Tuan Nguyen, Journal of American Statistical Association, vol. 106 (2011), 879–890.
[abstract] [search]
“Distributed Verification and Hardness of Distributed Approximation”, Atish Das Sarma, Stephan Holzer, Liah Kor, Amos Korman, Danupon Nanongkai, Gopal Pandurangan, David Peleg, Roger Wattenhofer, ACM Symposium on Theory of Computing (STOC), 2011.
[search]
“Entire Relaxation Path for Maximum Entropy Problems”, Moshe Dubiner, Yoram Singer, EMNLP 2011 (to appear).
[abstract] [pdf] [search]
“Estimating PageRank on Graph Streams”, Atish Das Sarma, Sreenivas Gollapudi, Rina Panigrahy, Journal of the ACM (JACM) (2011).
[search]
“Extracting Patterns from Location History”, Andrew Kirmse, Tushar Udeshi, Pablo Bellver, Jim Shuma, ACM SIGSPATIAL GIS 2011, pp. 397-400.
[abstract] [pdf] [search]
“Filtering: a method for solving graph problems in MapReduce.”, Silvio Lattanzi, Benjamin Moseley, Siddharth Suri, Sergei Vassilvitskii, SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, pp. 85-94.
[abstract] [search]
“General Algorithms for Testing the Ambiguity of Finite Automata and the Double-Tape Ambiguity of Finite-State Transducers”, Cyril Allauzen, Mehryar Mohri, Ashish Rastogi, International Journal of Foundations of Computer Science, vol. 22 (2011), pp. 883-904.
[pdf] [search]
“Hiring a secretary from a poset.”, Ravi Kumar, Silvio Lattanzi, Sergei Vassilvitskii, Andrea Vattani, Proceedings 12th ACM Conference on Electronic Commerce (EC-2011), pp. 39-48.
[abstract] [search]
“Incremental Clicks Impact Of Search Advertising”, David Chan, Yuan Yuan, Jim Koehler, Deepak Kumar, 2011.
[pdf] [search]
“Inner Product Spaces for MinSum Coordination Mechanisms”, Richard Cole, Jose R. Correa, Vasilis Gkatzelis, Vahab Mirrokni, Neil Olver, STOC, 2011.
[arxiv.org] [search]
“Large-Scale Parallel Statistical Forecasting Computations in R”, Murray Stokely, Farzan Rohani, Eric Tassone, JSM Proceedings, Section on Physical and Engineering Sciences, 2011.
[abstract] [pdf] [search]
“Measuring the Impact of Advertising on YouTube Traffic”, Sundar Dorai-Raj, The Market Research Event, 2011.
[abstract] [search]
“Milgram-routing in social networks.”, Silvio Lattanzi, Alessandro Panconesi, D. Sivakumar, Proceedings of the 20th International Conference on World Wide Web, WWW 2011, pp. 725-734.
[abstract] [search]
“Multicut in trees viewed through the eyes of vertex cover”, Jianer Chen, Jiahao Fan, Iyad A. Kanj, Yang Liu, Fenghui Zhang, WADS 2011.
[abstract] [pdf] [search]
“Near-oracle performance of greedy block-sparse estimation techniques from noisy measurements”, Zvika Ben-Haim, Yonina C. Eldar, Selected Topics in Signal Processing, vol. 5 (2011), pp. 1032-1047.
[search]
“New Exact and Approximation Algorithms for the Star Packing Problem in Undirected Graphs”, Maxim Babenko, Alexey Gusakov, 28th International Symposium on Theoretical Aspects of Computer Science, 2011, pp. 519-530.
[pdf] [search]
“On Multiway Cut paramterized above lower bounds”, Marek Cygan, Marcin Pilipczuk, Michał Pilipczuk, Jakub Onufry Wojtaszczyk, IPEC 2011 (to appear).
[abstract] [arxiv.org] [search]
“On the number of shortest descending paths on the surface of a convex terrain”, Mustaq Ahmed, Anil Maheshwari, Subhas C. Nandy, Sasanka Roy, Journal of Discrete Algorithms, vol. 9(2) (2011), pp. 182-189.
[dx.doi.org] [search]
“Online Stochastic Weighted Matching: Improved Approximation Algorithms”, Bernard Haeupler, Vahab Mirrokni, Morteza Zadimoghaddam, Workshop of Network and Internet Economics (WINE) 2011 (to appear).
[search]
“Online Vertex-Weighted Bipartite Matching and Single-bid Budgeted Allocations”, Gagan Aggarwal, Gagan Goel, Chinmay Karande, Aranyak Mehta, SODA 2011.
[abstract] [arxiv.org] [pdf] [search]
“Online bipartite matching with unknown distributions”, Chinmay Karande, Aranyak Mehta, Pushkar Tripathi, STOC '11, 2011.
[dl.acm.org] [pdf] [search]
“Reducing the size of resolution proofs in linear time”, Omer Bar Ilan, Oded Fuhrmann, Ofer Strichman, Ohad Shacham, Shlomo Hoory, International Journal on Software Tools for Technology Transfer, vol. 13 (2011).
[abstract] [search]
“Scheduling partially ordered jobs faster than 2^n”, Marek Cygan, Marcin Pilipczuk, Michał Pilipczuk, Jakub Onufry Wojtaszczyk, ESA (2011) (to appear).
[abstract] [pdf] [search]
“Sharing-aware algorithms for virtual machine colocation”, Michael Sindelar, Ramesh Sitaraman, Prashant Shenoy, Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures, 2011, pp. 367-378.
[abstract] [pdf] [search]
“Shortest descending paths: Towards an exact algorithm”, Mustaq Ahmed, Anna Lubiw, International J. Computational Geometry and Applications, vol. 21(4) (2011), pp. 431-466.
[dx.doi.org] [search]
“Simple Adaptive Cognition for PSO”, Christopher K. Monson, In Proceedings of the Congress on Evolutionary Computation (CEC 2011).
[bouncingchairs.net] [search]
“Solving connectivity problems parameterized by treewidth in single exponential time”, Marek Cygan, Jesper Nederlof, Marcin Pilipczuk, Michał Pilipczuk, Johann M. M. van Rooij, Jakub Onufry Wojtaszczyk, Foundations of Computer Science 2011 (to appear).
[abstract] [pdf] [search]
“Space-Filling Trees: A New Perspective on Incremental Search for Motion Planning”, James J. Kuffner, Steven M. LaValle, Proc. IEEE/RSJ International Conference on Intelligent Robots and Systems, 2011 (to appear).
[abstract] [pdf] [search]
“Subset Feedback Vertex Set is fixed parameter tractable”, Marek Cygan, Marcin Pilipczuk, Michał Pilipczuk, Jakub Onufry Wojtaszczyk, ICALP 2011 (to appear).
[abstract] [pdf] [search]
“Telling Two Distributions Apart: a Tight Characterization”, Eyal Even-Dar, Mark Sandler, 2011.
[search]
“The Method of Moments and Degree Distributions for Network Models”, Peter Bickel, Aiyou Chen, Liza Levina, Annals of Statistics (2011) (to appear).
[abstract] [pdf] [search]
“The provably total search problems of bounded arithmetic”, Alan Skelley, Neil Thapen, Proceedings of the London Mathematical Society (2011), pp. 1-33.
[plms.oxfordjournals.org] [search]
“Traffic Light Mapping and Detection”, Nathaniel Fairfield, Chris Urmson, Proceedings of ICRA 2011.
[abstract] [pdf] [search]
“Yield Optimization of Display Advertising with Ad Exchange”, Santiago Balseiro, Jon Feldman, Vahab Mirrokni, S. Muthukrishnan, ACM Conference on Electronic Commerce, 2011.
[abstract] [arxiv.org] [search]
“A 1.43-Competitive Online Graph Edge Coloring Algorithm in the Random Order Arrival Model.”, Bahman Bahmani, Aranyak Mehta, Rajeev Motwani, Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2010,, pp. 31-39.
[siam.org] [pdf] [search]
“A modern Bayesian look at the multi-armed bandit”, Steven L. Scott, Applied Stochastic Models in Business and Industry, vol. 26 (2010), pp. 639-658.
[onlinelibrary.wiley.com] [search]
“Beyond Position Bias: Examining Result Attractiveness as a Source of Presentation Bias in Clickthrough Data”, Yisong Yue, Rajan Patel, Hein Roehrig, WWW, 2010.
[pdf] [search]
“Bucketing coding and information theory for the statistical high-dimensional nearest-neighbor problem”, Moshe Dubiner, IEEE Transactions on Information Theory, vol. 56(8) (2010), pp. 4166-4179.
[pdf] [search]
“Evaluating Online Ad Campaigns in a Pipeline: Causal Models at Scale”, David Chan, Rong Ge, Ori Gershony, Tim Hesterberg, Diane Lambert, Proceedings of ACM SIGKDD 2010, pp. 7-15.
[abstract] [pdf] [search]
“Evaluating TV Ad Campaigns Using Set-Top Box Data”, Sundar Dorai-Raj, Yannet Interian, Dan Zigmond, Re:Think 2010.
[abstract] [pdf] [search]
“Fast Routing in Very Large Public Transportation Networks Using Transfer Patterns”, Hannah Bast, Erik Carlsson, Arno Eigenwillig, Robert Geisberger, Chris Harrelson, Veselin Raychev, Fabien Viger, Algorithms - ESA 2010, 18th Annual European Symposium. Proceedings, Part I, pp. 290-301.
[abstract] [dx.doi.org] [search]
“Filters for Efficient Composition of Weighted Finite-State Transducers”, Cyril Allauzen, Michael Riley, Johan Schalkwyk, CIAA, 2010, pp. 28-38.
[pdf] [search]
“How Surfers Watch: Measuring audience response to video advertising online”, Sundar Dorai-Raj, Dan Zigmond, Proceedings of ADKDD, 2010.
[abstract] [pdf] [search]
“Inferring strings from runs”, Wataru Matsubara, Akira Ishino, Ayumi Shinohara, In Proc. The Prague Stringology Conference '10 (PSC'10), 2010.
[search]
“Market Equilibrium with Transaction Costs”, Sourav Chakraborty, Nikhil Devanur, Chinmay Karande, WINE 2010.
[search]
“Max-Cover in Map-Reduce”, Flavio Chierichetti, Ravi Kumar, Andrew Tomkins, Proceedings of the 19th international conference on World Wide Web, 2010, pp. 231-240.
[abstract] [search]
“Maximizing Nonmonotone Submodular Functions under Matroid or Knapsack Constraints”, Jon Lee, Vahab S. Mirrokni, Viswanath Nagarajan, Maxim Sviridenko, SIAM J. Discrete Math., vol. 23 (2010), pp. 2053-2078.
[doi] [search]
“Monitoring Algorithms for Negative Feedback Systems”, Mark Sandler, S. Muthukrishnan, WWW, 2010, pp. 871-880.
[search]
“Online Stochastic Packing Applied to Display Ad Allocation”, Jon Feldman, Monika Henzinger, Nitish Korula, Vahab S. Mirrokni, Clifford Stein, ESA (1), 2010, pp. 182-194.
[doi] [search]
“Optimal marketing and pricing over social networks”, Nicole Immorlica, Vahab S. Mirrokni, WWW, 2010, pp. 1349-1350.
[doi.acm.org] [search]
“Quasi-Proportional Mechanisms: Prior-free Revenue Maximization”, Vahab S. Mirrokni, S. Muthukrishnan, Uri Nadav, Latin, 2010, to appear.
[search]
“Recent Books in Public Opinion, Survey Methods, and Survey Statistics”, Mario Callegaro, Survey Practice, vol. April (2010).
[surveypractice.org] [search]
“Revenue Management of Reusable Resources - Provably Near-Optimal LP-Based Policies”, Retsef Levi, Ana Radovanovic, Operations Research, vol. 58(2) (2010).
[search]
“Revenue Maximization in Reservation-based Online Advertising Through Dynamic Inventory Management”, Ana Radovanovic, Assaf Zeevi, 48th Annual Allerton Conference on Communication, Control and Computing, 2010, pp. 1502-1509.
[ieeexplore.ieee.org] [pdf] [search]
“Robust self-assembly of graphs”, Stanislav Angelov, Sanjeev Khanna, Mirkó Visontai, Natural Computing, vol. 9 (2010), pp. 111-133.
[search]
“SemWebVid - Making Video a First Class Semantic Web Citizen and a First Class Web Bourgeois”, Thomas Steiner, International Semantic Web Conference 2010 (ISWC2010).
[abstract] [lsi.upc.edu] [pdf] [search]
“Statistical verification of probabilistic properties with unbounded until”, Håkan L. S. Younes, Edmund M. Clarke, Paolo Zuliani, Proceedings of the 13th Brazilian Symposium on Formal Methods, 2010, pp. 144-160.
[abstract] [dx.doi.org] [search]
“Trawling Traffic under Attack, Overcoming DDoS Attacks by Target-Controlled Traffic Filtering”, Shlomi Dolev, Yuval Elovici, Alex Kesselman, Polina Zilberman, econd International Workshop on Reliability, Availability, and Security (WRAS), 2010, pp. 336-341.
[search]
“A Complete, Co-Inductive Syntactic Theory of Sequential Control and State”, Kristian Støvring, Soren B. Lassen, Semantics and Algebraic Specification: Essays Dedicated to Peter D. Mosses on the Occasion of His 60th Birthday, 2009, pp. 329-375.
[abstract] [dx.doi.org] [search]
“A new family of Markov branching trees: the alpha-gamma model”, Bo Chen, Daniel Ford, Matthias Winkel, Electronic Journal of Probability (2009), pp. 400-430.
[emis.de] [pdf] [search]
“Adaptive Dynamic of Realistic Small World Networks”, Olof Mogren, Oskar Sandberg, Vilhelm Verendel, Devdatt Dubhashi, 2009 European Conference on Complex Systems (to appear).
[abstract] [search]
“Affiliation Networks”, Silvio Lattanzi, D. Sivakumar, Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009, pp. 427-434.
[abstract] [portal.acm.org] [search]
“Algorithms for Secretary Problems on Graphs and Hypergraphs”, Nitish Korula, Martin Pál, ICALP 2009.
[abstract] [front.math.ucdavis.edu] [search]
“Approximating Submodular Functions Everywhere”, Michel Goemans, Nick Harvey, S. Iwata, Vahab Mirrokni, Symposium on Discrete Algorithms (SODA), 2009.
[search]
“Approximation Hardness of Deadline-TSP Reoptimization”, Hans-Joachim Böckenhauer, Joachim Kneis, Joachim Kupke, Theory of Computing Systems, vol. 410 (2009), pp. 2241-2249.
[doi] [search]
“Asymptotic Optimality of the Static Frequency Caching in the Presence of Correlated Requests”, Predrag Jelenkovic, Ana Radovanovic, Operations Research Letters, vol. 37 (2009), pp. 307-311.
[pdf] [search]
“Average Value of Sum of Exponents of Runs in a String”, Kazuhiko Kusano, Wataru Matsubara, Akira Ishino, Ayumi Shinohara, International Journal of Foundations of Computer Science, vol. 20(6) (2009), pp. 1135-1146.
[stringology.org] [search]
“Competitive Routing over Time”, Martin Hoefer, Vahab S. Mirrokni, Heiko Röglin, Shang-Hua Teng, Workshop of Internet Economics (WINE), 2009, pp. 18-29.
[doi] [search]
“Competitive buffer management with packet dependencies”, Alex Kesselman, Boaz Patt-Shamir, Gabriel Scalosub, 2009 IEEE International Symposium on Parallel&Distributed Processing, pp. 1-12.
[search]
“Coordination mechanisms for selfish scheduling”, Nicole Immorlica, Li (Erran) Li, Vahab S. Mirrokni, Andreas S. Schulz, Theor. Comput. Sci., vol. 410 (2009), pp. 1589-1598.
[doi] [search]
“Detecting The Origin Of Text Segments Efficiently”, Ossama Abdel-Hamid, Behshad Behzadi, Stefan Christoph, Monika Henzinger, Proceedings of WWW'2009 (to appear).
[search]
“Differential Synchronization”, Neil Fraser, DocEng'09, Proceedings of the 2009 ACM Symposium on Document Engineering, pp. 13-20.
[abstract] [neil.fraser.name] [pdf] [search]
“Efficient Algorithms to Compute Compressed Longest Common Substrings and Compressed Palindromes”, Wataru Matsubara, Shunsuke Inenaga, Akira Ishino, Ayumi Shinohara, Tomoyuki Nakamura, Kazuo Hashimoto, Theoretical Computer Science, vol. 410 (8--10) (2009), pp. 900-913.
[dx.doi.org] [search]
“General Auction Mechanism for Search Advertising”, Gagan Aggarwal, S. Muthukrishnan, Dávid Pál, Martin Pál, WWW 2009.
[front.math.ucdavis.edu] [search]
“General Suffix Automaton Construction Algorithm and Space Bounds”, Mehryar Mohri, Pedro Moreno, Eugene Weinstein, Theoretical Computer Science, vol. 410 (2009).
[cs.nyu.edu] [pdf] [search]
“Measuring Advertising Quality on Television: Deriving Meaningful Metrics from Audience Retention Data”, Dan Zigmond, Sundar Dorai-Raj, Yannet Interian, Igor Naverniouk, Journal of Advertising Research, vol. 49 (2009), pp. 419-428.
[abstract] [pdf] [search]
“Metric Embeddings with Relaxed Guarantees”, T H Hubert Chan, Kedar Dhamdhere, Anupam Gupta, Jon m Kleinberg, Aleksandrs Slivkins, SIAM Journal on Computing, vol. 38 (2009), pp. 2303-2329.
[abstract] [search]
“N-Way Composition of Weighted Finite-State Transducers”, Cyril Allauzen, Mehryar Mohri, International Journal of Foundations of Computer Science, vol. 20 (2009), pp. 613-627.
[cs.nyu.edu] [pdf] [search]
“Non-monotone submodular maximization under matroid and knapsack”, Jon Lee, Vahab S. Mirrokni, Viswanath Nagarajan, Maxim Sviridenko, STOC, 2009, pp. 323-332.
[doi.acm.org] [search]
“On the Convergence of Regret Minimization Dynamics in Concave Games”, Eyal Even-Dar, Yishay Mansour, Uri Nadav, 41st Annual ACM Symposium on Theory of Computing, STOC, 2009, pp. 523-532.
[abstract] [portal.acm.org] [search]
“On the Fourier spectrum of symmetric Boolean functions”, Mihail N. Kolountzakis, Richard J. Lipton, Evangelos Markakis, Aranyak Mehta, Nisheeth K. Vishnoi, Combinatorica, vol. 29 (2009), pp. 363-387.
[doi] [search]
“On the complexity of nash dynamics and sink equilibria”, Vahab S. Mirrokni, Alexander Skopalik, ACM Conference on Electronic Commerce, 2009, pp. 1-10.
[doi.acm.org] [search]
“Online Ad Assignment with Free Disposal”, Jon Feldman, Nitish Korula, Vahab S. Mirrokni, S. Muthukrishnan, Martin Pál, Workshop of Internet Economics (WINE), 2009, pp. 374-385.
[doi] [search]
“Online Learning with Global Cost Functions”, Eyal Even-Dar, Robert Kleinberg, Shie Mannor, Yishay Mansour, 22nd Annual Conference on Learning Theory, COLT, 2009.
[abstract] [cs.mcgill.ca] [search]
“Online Markov Decision Processes”, Eyal Even-Dar, Sham. M. Kakade, Yishay Mansour, Math. Oper. Res., vol. 34 (2009), pp. 726-736.
[doi] [search]
“Online Stochastic Matching: Beating 1-1/e”, Jon Feldman, Aranyak Mehta, Vahab Mirrokni, S. Muthukrishnan, Symposium on the Foundations of Computer Science (FOCS), 2009.
[arxiv.org] [search]
“PASS Approximation”, Uriel Feige, Nicole Immorlica, Vahab S. Mirrokni, Hamid Nazerzadeh, APPROX-RANDOM, 2009, pp. 111-124.
[doi] [search]
“Solving Maximum Flow Problems on Real World Bipartite Graphs”, Cosmin Silvestru Negruseri, Mircea Bogdan Pasoi, Barbara Stanley, Clifford Stein, Cristian George Strat, ALENEX, 2009, pp. 14-28.
[siam.org] [pdf] [search]
“Stochastic Data Streams”, S. Muthukrishnan, MFCS '09: Proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science 2009, pp. 55-55.
[doi] [search]
“The Price of Uncertainty”, Maria-Florina Balcan, Avrim Blum, Yishay Mansour, ACM Conference on Electronic Commerce, 2009, pp. 285-294.
[portal.acm.org] [search]
“Tutorial summary: Convergence of natural dynamics to equilibria”, Eyal Even-Dar, Vahab S. Mirrokni, ICML, 2009, pp. 173.
[doi.acm.org] [search]
“Typicality Effects and the Logic of Reciprocity”, Nir Kerem, Naama Friedmann, Yoad Winter, Proceedings of SALT XIX (2009), pp. 257-274.
[abstract] [elanguage.net] [pdf] [search]
“Weighted Automata Algorithms”, Mehryar Mohri, Handbook of weighted automata, 2009.
[cs.nyu.edu] [pdf] [search]
“3-Way Composition of Weighted Finite-State Transducers”, Cyril Allauzen, Mehryar Mohri, Proceedings of the 13th International Conference on Implementation and Application of Automata (CIAA 2008), pp. 262-273.
[cs.nyu.edu] [pdf] [search]
“Algorithmen für dynamische geometrische Datenströme”, Gereon Frahling, Ausgezeichnete Informatikdissertationen 2006 (Outstanding Informatics dissertations 2006), 2008 (to appear).
[pdf] [search]
“Algorithms for Distributed Functional Monitoring”, Graham Cormode, S. Muthukrishnan, Ke Yi, Proc. 19th ACM-SIAM Symposium on Discrete Algorithms, 2008, pp. 1076-1085.
[search]
“An approximate string matching approach for handling incorrectly typed urls”, Mihai Stroe, Radu Berinde, Cosmin Negruseri, Dan Popovici, CIKM, 2008, pp. 1339-1340.
[doi.acm.org] [search]
“Asymptotic Performance of the Non-Forced Idle Time Scheduling Policies in the Presence of Variable Demand for Resources”, Ana Radovanovic, Cliff Stein, Proceedings of the 46th Annual Conference on Communication, Control, and Computing, 2008, pp. 499-503.
[abstract] [pdf] [search]
“Attack Resistant Collaborative Filtering”, Bhaskar Mehta, Wolfgang Nejdl, The 31st Annual International ACM SIGIR Conference (SIGIR) (2008).
[pdf] [search]
“Best Effort and Priority Queuing Policies for Buffered Crossbar Switches”, Alex Kesselman,, Kirill Kogan,, Michael Segal,, SIROCCO '08: Proceedings of the 15th international colloquium on Structural Information and Communication Complexity, 2008, pp. 170-184.
[doi] [search]
“Binary operations on automatic functions”, Juhani Karhumäki, Jarkko Kari, Joachim Kupke, RAIRO-Theor. Inf. Appl., vol. 42 (2008), pp. 217-236.
[doi] [search]
“Combinational Collaborative Filtering for Personalized Community Recommendation”, Wen-Yen Chen, Dong Zhang, Edward Chang, ACM SIGKDD Int'l Conference on Knowledge Discovery and Data Mining (KDD), 2008, pp. 115-123.
[abstract] [pdf] [search]
“Competitive buffer management for shared-memory switches”, William Aiello,, Alex Kesselman,, Yishay Mansour,, ACM Trans. Algorithms, vol. 5 (2008), pp. 1-16.
[doi.acm.org] [search]
“Corrigendum to Efficient Similarity Search and Classification via Rank Aggregation”, Alexandr Andoni, Ronald Fagin, Ravi Kumar, Mihai Patrascu, D. Sivakumar, Proc. ACM SIGMOD International Conference on Management of Data, 2008, pp. 1375-1376.
[doi.acm.org] [search]
“Delaunay Graphs of Point Sets in the Plane with Respect to Axis-parallel Rectangles”, Xiaomin Chen, János Pach, Mario Szegedy, Gábor Tardos, Proc. 19th ACM-SIAM Symposium on Discrete Algorithms, 2008, pp. 94-101.
[search]
“Dense fast random projections and Lean Walsh Transforms,”, Nir Ailon, Edo Liberty, RANDOM, 2008 (to appear).
[pdf] [search]
“Dimension Reduction Using Rademacher Series on Dual BCH Codes”, Nir Ailon, Edo Liberty, Proc. 19th ACM-SIAM Symposium on Discrete Algorithms, 2008, pp. 1-9.
[search]
“Edge Splitting and Edmonds' Arborescence Construction for Unweighted Graphs”, Anand Bhalgat, Ramesh Hariharan, Telikepalli Kavitha, Debmalya Panigrahi, Proc. ACM-SIAM Symposium on Discrete Algorithms, 2008, pp. 455-464.
[search]
“Estimation of Web Page Change Rates”, Carrie Grimes, Daniel Ford, JSM 2008.
[pdf] [search]
“General Algorithms for Testing the Ambiguity of Finite Automata”, Cyril Allauzen, Mehryar Mohri, Ashish Rastogi, DLT 2008, LNCS 5257, pp. 108-120.
[pdf] [search]
“General Algorithms for Testing the Ambiguity of Finite Automata”, Cyril Allauzen, Mehryar Mohri, Ashish Rastogi, Proceedings of Twelfth International Conference Developments in Language Theory (DLT 2008).
[cs.nyu.edu] [pdf] [search]
“Improved Algorithms for Orienteering and Related Problems”, Chandra Chekuri, Nitish Korula, Martin Pál, Proc. 19th Annual Symposium on Discrete Algorithms (SODA), 2008.
[cs.uiuc.edu] [pdf] [search]
“Improved Competitive Performance Bounds for CIOQ Switches”, Alex Kesselman,, Kirill Kogan,, Michael Segal,, ESA '08: Proceedings of the 16th annual European symposium on Algorithms, 2008, pp. 577-588.
[doi] [search]
“It's Time To Retire the "n >= 30" rule.”, Tim Hesterberg, Proceedings of the Joint Statistical Meetings, 2008.
[abstract] [home.comcast.net] [pdf] [search]
“Keeping a Search Engine Fresh: Risk and Optimality in estimating refresh rates for web pages”, Carrie Grimes, Daniel Ford, Eric Tassone, Proceedings of INTERFACE 2008.
[pdf] [search]
“Linear-Space Computation of the Edit-Distance between a String and a Finite Automaton”, Cyril Allauzen, Mehryar Mohri, London Algorithmics 2008: Theory and Practice.
[cs.nyu.edu] [pdf] [search]
“Modularity-Maximizing Graph Communities via Mathematical Programming”, Gaurav Agarwal, David Kempe, European Physics Journal B (2008), pp. 409-418.
[pdf] [search]
“On Distributing Symmetric Streaming Computations”, Jon Feldman, S. Muthukrishnan, Anastasios Sidiropoulos, Cliff Stein, Zoya Svitkina, Proc. 19th Annual Symposium on Discrete Algorithms (SODA), 2008.
[cs.dartmouth.edu] [pdf] [search]
“On the Computation of the Relative Entropy of Probabilistic Automata”, Corinna Cortes, Mehryar Mohri, Ashish Rastogi, Michael Riley, International Journal of Foundations of Computer Science, vol. 19 (2008), pp. 219-242.
[cs.nyu.edu] [search]
“Online Effects of Offline Ads”, Diane Lambert, Daryl Pregibon, AdKDD08 (in the ACM digital library), 2008, pp. 10-17.
[abstract] [research.microsoft.com] [pdf] [search]
“Packet mode and QoS algorithms for buffered crossbar switches with FIFO queuing”, Alex Kesselman,, Kirill Kogan,, Michael Segal,, PODC '08: Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing, 2008, pp. 335-344.
[doi.acm.org] [search]
“Permutation betting markets: singleton betting with extra information”, Mohammad Ghodsi, Hamid Mahini, Vahab S. Mirrokni, Morteza Zadimoghaddam, ACM Conference on Electronic Commerce, 2008, pp. 180-189.
[doi.acm.org] [search]
“Physics, Topology, Logic and Computation: A Rosetta Stone”, John Baez, Michael Stay, New Structures in Physics, 2008 (to appear).
[math.ucr.edu] [pdf] [search]
“Potential-Driven Load Distribution for Distributed Data Stream Processing”, Weihan Wang, Mohamed A. Sharaf, Shimin Guo, M. Tamer Özsu, Proc. 2nd International Workshop on Scalable Stream Processing Systems, 2008, pp. 13-22.
[doi.acm.org] [search]
“Robust Self-assembly of Graphs”, Stanislav Angelov, Sanjeev Khanna, Mirkó Visontai, DNA Computing, 2008, pp. 127-143.
[search]
“Span-program-based quantum algorithm for evaluating formulas”, Ben Reichardt, Robert Spalek, Proc. of 40th ACM STOC, 2008, pp. 103-112.
[abstract] [arxiv.org] [search]
“The One-Way Communication Complexity of Hamming Distance”, T. S. Jayram, Ravi Kumar, D. Sivakumar, Theory of Computing, vol. 4 (2008), pp. 129-135.
[abstract] [theoryofcomputing.org] [search]
“The Persistent-Access-Caching Algorithm”, Predrag Jelenkovic, Ana Radovanovic, Random Structures & Algorithms, vol. 33 (2008), pp. 219-251.
[portal.acm.org] [search]
“Theory research at Google”, Gagan Aggarwal, Nir Ailon, Florin Constantin, Eyal Even-Dar, Jon Feldman, Gereon Frahling, Monika R. Henzinger, S. Muthukrishnan, Noam Nisan, Martin Pál, Mark Sandler, Anastasios Sidiropoulos, SIGACT News, vol. 39 (2008), pp. 10-28.
[doi.acm.org] [search]
“Two-Stage Robust Network Design with Exponential Scenarios”, Rohit Khandekar, Guy Kortsarz, Vahab S. Mirrokni, Mohammad R. Salavatipour, ESA, 2008, pp. 589-600.
[doi] [search]
“Typed Normal Form Bisimulation for Parametric Polymorphism”, Soren B. Lassen, Paul Blain Levy, Proceedings of the 23rd Annual IEEE Symposium on Logic in Computer Science (LICS' 08), 2008, pp. 341-352.
[abstract] [doi.ieeecomputersociety.org] [search]
“Using Mixture Models for Collaborative Filtering”, Jon Kleinberg, Mark Sandler, Journal of Computer and System Science, vol. 74, no. 1 (2008), pp. 49-69.
[doi] [pdf] [search]
“A Fast k-Means Implementation using Coresets”, Gereon Frahling, Christian Sohler, International Journal of Computational Geometry and Applications (IJCGA) (2007).
[doi.acm.org] [pdf] [search]
“A Heterogeneous High Dimensional Approximate Nearest Neighbor Algorithm”, Moshe Dubiner, IEEE Transactions on Information Theory (2007) (to appear).
[pdf] [search]
“A Statistical View of the Transient Signals that Support a Wireless Call”, A. Buvaneswari, John M. Graybeal, David A. James, Diane Lambert, Chuanhai Liu, W. Michael MacDonald, Technometrics, vol. 49, no. 3 (2007), pp. 305-317.
[pdf] [search]
“A complete, co-inductive syntactic theory of sequential control and state”, Kristian Støvring, Soren B. Lassen, Proc. 34th Annual ACM Symposium on Principles of Programming Languages, 2007, pp. 161-172.
[doi.acm.org] [pdf] [search]
“AdWords and Generalized Online Matching”, Aranyak Mehta, Amin Saberi, Umesh Vazirani, Vijay Vazirani, Journal of the ACM, vol. 54, no. 5 (2007).
[doi.acm.org] [search]
“Algorithms for Efficient Near-Perfect Phylogenetic Tree Reconstruction in Theory and Practice”, Srinath Sridhar, Kedar Dhamdhere, Guy E. Blelloch, Eran Halperin, R. Ravi, Russell Schwartz, IEEE/ACM Trans. Comput. Biology Bioinform., vol. 4 (2007), pp. 561-571.
[doi.acm.org] [search]
“An Algorithm for Fast, Model-Free Tracking Indoors”, Aiyou Chen, Christina Harko, Diane Lambert, P. A. Whiting, ACM SIGMOBILE Mobile Computing and Communications Review (2007).
[pdf] [search]
“Approximation via Cost Sharing: Simpler and Better Approximation Algorithms for Network Design”, Anupam Gupta, Amit Kumar, Martin Pál, Tim Roughgarden, Journal of the ACM, vol. 54, no 3 (2007), pp. 11.
[doi.acm.org] [search]
“Combinatorial algorithms for web search engines: three success stories”, Monika Henzinger, Proc. ACM SODA Symposium on Discrete Algorithms, 2007, pp. 1022-1026.
[pdf] [search]
“Efficient Algorithms for Large-Scale Asteroid Discovery”, Jeremy Kubica, Larry Denneau Jr., Andrew Moore, Robert Jedicke, Andrew Connolly, Astronomical Data Analysis Software and Systems XVI, 2007, pp. 395-404.
[search]
“Efficient Pebbling for List Traversal Synopses with Application to Program Rollback”, Yossi Matias, Ely Porat, Theoretical Computer Science, vol. 379, issue 3 (2007), pp. 418-436.
[search]
“Efficient kinetic data structures for MaxCut”, Artur Czumaj, Gereon Frahling, Christian Sohler, Proc. of the 19th Canadian Conference on Computational Geometry, 2007.
[pdf] [search]
“Efficiently Computing Minimax Expected-Size Confidence Regions”, Brent Bryan, H. Brendan McMahan, Chad M. Schafer, Jeff Schneider, Proc. 24th ICML, 2007, pp. 97-104.
[doi.acm.org] [pdf] [search]
“Estimating Clustering Indexes in Data Streams”, Luciana Buriol, Gereon Frahling, Stefano Leonardi, Christian Sohler, Proc. 15th European Symposium on Algorithms (ESA), 2007 (to appear).
[pdf] [search]
“Factor Automata of Automata and Applications”, Mehryar Mohri, Pedro J. Moreno, Eugene Weinstein, Proceedings of the 12th International Conference on Implementation and Application of Automata (CIAA2007), July.
[cs.nyu.edu] [pdf] [search]
“Hierarchical Mixture Models: A probabilistic Analysis”, Mark Sandler, KDD, 2007, pp. 580-589.
[doi.acm.org] [pdf] [search]
“Integrity and its Applications”, Qunwei Zheng, Sibabrata Ray, Xiaoyan Hong, Lei Tang, Li Gao, ACM Southeast Regional Conference, 2007, pp. 350-354.
[doi.acm.org] [search]
“Lp Distance and Equivalence of Probabilistic Automata”, Corinna Cortes, Mehryar Mohri, Ashish Rastogi, International Journal of Foundations of Computer Science, vol. 18 (2007), pp. 761-780.
[cs.nyu.edu] [search]
“Maximizing a Submodular Set Function subject to a Matroid Constraint”, Chandra Chekuri, Gruia Calinescu, Martin Pál, Jan Vondrák, Proceedings of the Twelfth Conference on Integer Programming and Combinatorial Optimization (IPCO) 2007.
[cs.uiuc.edu] [search]
“Minimizing Weighted Flow Time”, Nikhil Bansal, Kedar Dhamdhere, ACM Transactions on Algorithms, vol. 3, no. 4 (2007), pp. 1-14.
[doi.acm.org] [search]
“More Bang for Their Bucks: Assessing New Features for Online Advertisers”, Diane Lambert, Daryl Pregibon, AdKDD07 (in the ACM digital library), 2007.
[abstract] [pdf] [search]
“On the (im)possibility of non-interactive correlation distillation”, Ke Yang, Theoretical Computer Science, vol. 382, no 2. (2007), pp. 157-166.
[doi] [search]
“On the Approximability of TSP on Local Modifications of Optimally Solved Instances”, Hans-Joachim Böckenhauer, Luca Forlizzi, Juraj Hromkovič, Joachim Kneis, Joachim Kupke, Guido Proietti, Peter Widmayer, Algorithmic Operations Research, vol. 2/2 (2007), pp. 83-93.
[journals.hil.unb.ca] [search]
“OpenFst: a General and Efficient Weighted Finite-State Transducer Library”, Cyril Allauzen, Michael Riley, Johan Schalkwyk, Wojciech Skut, Mehryar Mohri, Proceedings of the 12th International Conference on Implementation and Application of Automata (CIAA 2007).
[search]
“Optimal Suffix Selection”, Gianni Frenceschini, S. Muthukrishnan, Proceedings of the Symposium on Theory of Computation, 2007, pp. 328-339.
[doi.acm.org] [search]
“RadixZip: Linear Time Compression of Token Streams”, Binh Vo, Gurmeet Singh Manku, VLDB 2007 (33rd Intl. Conf. on Very Large Data Bases).
[search]
“Robust Collaborative Filtering”, Bhaskar Mehta, Thomas Hofmann, Wolfgang Nejdl, ACM Conference on Recommender Systems, 2007, pp. 49-56.
[doi.acm.org] [search]
“Sharing the cost more efficiently: Improved approximation for multicommodity rent-or-buy”, L. Becchetti, J. Könemann, S. Leonardi, Martin Pál, ACM Transactions on Algorithms, vol. 3, no 2 (2007), pp. 23.
[doi.acm.org] [search]
“Skip Graphs”, James Aspnes, Gauri Shah, ACM Transactions on Algorithms, vol. 3, no 4 (2007), pp. 1-25.
[doi.acm.org] [pdf] [search]
“Subtyping a la Church”, Adriana Compagnoni, Healfdene Goguen, Henk Barendregt Festschrift (2007) (to appear).
[cs.stevens.edu] [search]
“The Parameterized Approximability of TSP with Deadlines”, Hans-Joachim Böckenhauer, Juraj Hromkovič, Joachim Kneis, Joachim Kupke, Theory of Computing Systems, vol. 41/3 (2007), pp. 431-444.
[doi] [search]
“The k-Traveling Repairmen Problem”, Jittat Fakcharoenphol, Chris Harrelson, ACM Transactions on Algorithms, vol. 3, no. 4 (2007), pp. 1-16.
[doi.acm.org] [pdf] [search]
“Typed Normal Form Bisimulation”, Soren B. Lassen, Paul Blain Levy, Proceedings of the 21st International Workshop on Computer Science Logic (CSL'07), 2007, pp. 283-297.
[doi] [pdf] [search]
“L_p Distance and Equivalence of Probabilistic Automata”, Corinna Cortes, Mehryar Mohri, Ashish Rastogi, International Journal of Foundations of Computer Science, vol. to appear (2007).
[cs.nyu.edu] [search]
“On the Computation of the Relative Entropy of Probabilistic Automata”, Corinna Cortes, Mehryar Mohri, Ashish Rastogi, Michael Riley, International Journal of Foundations of Computer Science, vol. to appear (2007).
[cs.nyu.edu] [search]
“Achieving Anonymity via Clustering in a Metric Space”, Gagan Aggarwal, Tomás Feder, Krishnaram Kenthapadi, Samir Khuller, Rina Panigrahy, Dilys Thomas, An Zhu, PODS, 2006, pp. 153-162.
[doi.acm.org] [search]
“An Assertional Correctness Proof of a Self-Stabilizing l-Exclusion Algorithm”, Milos Besta, Frank Stomp, 11th IEEE International Conference on Engineering of Complex Computer Systems (ICECCS'06), 2006, pp. 199-208.
[abstract] [csdl2.computer.org] [search]
“An O(log n) Approximation Ratio for the Asymmetric Traveling Salesman Path Problem”, Chandra Chekuri, Martin Pál, Proceedings of APPROX 2006.
[search]
“Approximate reasoning for real-time probabilistic processes”, Vineet Gupta, Radha Jagadeesan, Prakash Panangaden, Logical Methods in Computer Science, vol. 2 (2006).
[doi] [pdf] [search]
“Eliminating Dependent Pattern Matching”, Healfdene Goguen, Conor McBride, James McKinna, Essays Dedicated to Joseph A. Goguen, 2006, pp. 521-540.
[doi] [pdf] [search]
“Head Normal Form Bisimulation for Pairs and the Lambda Mu-Calculus (Extended Abstract)”, Soren B. Lassen, Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science (LICS' 06), 2006, pp. 297-306.
[doi.ieeecomputersociety.org] [search]
“Knapsack auctions”, Gagan Aggarwal, Jason D. Hartline, SODA, 2006, pp. 1083-1092.
[doi.acm.org] [pdf] [search]
“Linear work suffix array construction”, Juha Kärkkäinen, Peter Sanders, Stefan Burkhardt, Journal of the ACM, vol. 6 (2006), pp. 918-936.
[doi.acm.org] [search]
“Monitoring Networked Applications with Incremental Quantile Estimation (with discussion)”, John M. Chambers, David A. James, Diane Lambert, Scott Vander Wiel, Statistical Science, vol. 21 (2006), pp. 463-475.
[search]
“Normal Form Simulation for McCarthy's Amb”, Soren B. Lassen, Proceedings of the 21st Annual Conference on Mathematical Foundations of Programming Semantics (MFPS XXI), 2006, pp. 445-465.
[doi] [pdf] [search]
“On boundaries of highly visible spaces and applications”, John H. Reif, Zheng Sun, Theor. Comput. Sci., vol. 354 (2006), pp. 379-390.
[doi] [search]
“On discretization methods for approximating optimal paths in regions with direction-dependent costs”, Zheng Sun, Tian-Ming Bu, Inf. Process. Lett., vol. 97 (2006), pp. 146-152.
[doi] [search]
“Parallel Assignments in Software Model Checking”, Murray Stokely, Sagar Chaki, Joel Ouaknine, Electr. Notes Theor. Comput. Sci., vol. 157 (2006), pp. 77-94.
[doi] [search]
“Programmable clustering”, Sreenivas Gollapudi, Ravi Kumar, D. Sivakumar, PODS, 2006, pp. 348-354.
[doi.acm.org] [search]
“Quantum Algorithms for Some Hidden Shift Problems”, Wim van Dam, Sean Hallgren, Lawrence Ip, SIAM Journal on Computing, vol. 36 (2006), pp. 763-778.
[lawrenceip.com] [search]
“Using Many Machines to Handle an Enormous Error-Correcting Code”, Jon Feldman, Proc. IEEE Information Theory Workshop (ITW), 2006.
[pdf] [search]
“A Unified Construction of the Glushkov, Follow, and Antimirov Automata”, Cyril Allauzen, Mehryar Mohri, Proceedings of the 31st International Symposium on Mathematical Foundations of Computer Science (MFCS 2006), pp. 110-121.
[cs.nyu.edu] [search]
“Efficient Computation of the Relative Entropy of Probabilistic Automata”, Corinna Cortes, Mehryar Mohri, Ashish Rastogi, Michael Riley, Proceedings of the 7th Latin American Symposium (LATIN 2006).
[cs.nyu.edu] [search]
“On the Computation of Some Standard Distances between Probabilistic Automata”, Corinna Cortes, Mehryar Mohri, Ashish Rastogi, Proceedings of the 11th International Conference on Implementation and Application of Automata (CIAA 2006).
[cs.nyu.edu] [search]
“A Loopless Gray Code for Minimal Signed-Binary Representations”, Gurmeet Singh Manku, Joe Sawada, ESA 2005 (13th Annual European Symposium on Algorithms), pp. 438-447.
[doi] [pdf] [search]
“Eager Normal Form Bisimulation”, Soren B. Lassen, Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05), 2005, pp. 345-354.
[doi.ieeecomputersociety.org] [search]
“The design principles and algorithms of a weighted grammar library”, Cyril Allauzen, Mehryar Mohri, Brian Roark, Int. J. Found. Comput. Sci., vol. 16 (2005), pp. 403-421.
[doi] [search]
“Metrics for labelled Markov processes”, Josee Desharnais, Vineet Gupta, Radha Jagadeesan, Prakash Panangaden, Theor. Comput. Sci., vol. 318 (2004), pp. 323-354.
[doi] [search]
“On the Streaming Model Augmented with a Sorting Primitive”, Gagan Aggarwal, Mayur Datar, Sridhar Rajagopalan, Matthias Ruhl, FOCS, 2004, pp. 540-549.
[csdl.computer.org] [search]