S. Muthukrishnan

Affiliations:
  • Rutgers University, Department of Computer Science, Piscataway, NJ, USA
  • Google Inc., New York, NY, USA
  • DIMACS, Piscataway, NJ, USA
  • AT&T Shannon Laboratories, Florham Park, NJ, USA
  • Bell Laboratories, Murray Hill, NJ, USA
  • University of Warwick, Department of Computer Science, UK
  • New York University, Courant Institute of Mathematical Sciences, NY, USA (PhD)


According to our database1, S. Muthukrishnan authored at least 298 papers between 1993 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Avoiding Flow Size Overestimation in Count-Min Sketch With Bloom Filter Constructions.
IEEE Trans. Netw. Serv. Manag., 2021

EX3: Explainable Attribute-aware Item-set Recommendations.
Proceedings of the RecSys '21: Fifteenth ACM Conference on Recommender Systems, Amsterdam, The Netherlands, 27 September 2021, 2021

EXACTA: Explainable Column Annotation.
Proceedings of the KDD '21: The 27th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2021

2020
Neural-Symbolic Reasoning over Knowledge Graph for Multi-stage Explainable Recommendation.
CoRR, 2020

Constructions and Applications for Accurate Counting of the Bloom Filter False Positive Free Zone.
Proceedings of the SOSR '20: Symposium on SDN Research, San Jose, CA, USA, March 3, 2020, 2020

Carpe Elephants: Seize the Global Heavy Hitters.
Proceedings of the 2020 ACM SIGCOMM 2020 Workshop on Secure Programmable Network Infrastructure, 2020

CAFE: Coarse-to-Fine Neural Symbolic Reasoning for Explainable Recommendation.
Proceedings of the CIKM '20: The 29th ACM International Conference on Information and Knowledge Management, 2020

2019
Waterfall Bandits: Learning to Sell Ads Online.
CoRR, 2019

Reinforcement Knowledge Graph Reasoning for Explainable Recommendation.
Proceedings of the 42nd International ACM SIGIR Conference on Research and Development in Information Retrieval, 2019

2018
Finding Subcube Heavy Hitters in Analytics Data Streams.
Proceedings of the 2018 World Wide Web Conference on World Wide Web, 2018

Offline Evaluation of Ranking Policies with Click Models.
Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, 2018

Arbitrage-free Pricing in User-based Markets.
Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, 2018

2017
Stochastic Low-Rank Bandits.
CoRR, 2017

Finding Subcube Heavy Hitters in Data Streams.
CoRR, 2017

Heavy-Hitter Detection Entirely in the Data Plane.
Proceedings of the Symposium on SDN Research, 2017

Streaming Algorithms for Measuring H-Impact.
Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2017

Testable Bounded Degree Graph Properties Are Random Order Streamable.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

Revenue-Maximizing Stable Pricing in Online Labor Markets.
Proceedings of the Fifth AAAI Conference on Human Computation and Crowdsourcing, 2017

The Sparse Awakens: Streaming Algorithms for Matching Size Estimation in Sparse Graphs.
Proceedings of the 25th Annual European Symposium on Algorithms, 2017

2016
How Much is Your Attention Worth?: Analysis of Prices in LinkedIn Advertising Network - Short talk.
SIGMETRICS Perform. Evaluation Rev., 2016

Smoking Out the Heavy-Hitter Flows with HashPipe.
CoRR, 2016

40 years of suffix trees.
Commun. ACM, 2016

An Empirical Study of Web Cookies.
Proceedings of the 25th International Conference on World Wide Web, 2016

Graphical Model Sketch.
Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2016

Ad allocation with secondary metrics.
Proceedings of the 2016 IEEE International Conference on Big Data (IEEE BigData 2016), 2016

Optimizing callout in unified ad markets.
Proceedings of the 2016 IEEE International Conference on Big Data (IEEE BigData 2016), 2016

Targeting algorithms for online social advertising markets.
Proceedings of the 2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, 2016

Joining user profiles across online social networks: From the perspective of an adversary.
Proceedings of the 2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, 2016

App2Vec: Vector modeling of mobile apps and applications.
Proceedings of the 2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, 2016

What's in the community cookie jar?
Proceedings of the 2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, 2016

Approximate Histogram and Wavelet Summaries of Streaming Data.
Proceedings of the Data Stream Management - Processing High-Speed Data Streams, 2016

2015
Analyses of Cardinal Auctions.
Algorithmica, 2015

2014
Modeling the value of information granularity in targeted advertising.
SIGMETRICS Perform. Evaluation Rev., 2014

Yield Optimization of Display Advertising with Ad Exchange.
Manag. Sci., 2014

Frugal Streaming for Estimating Quantiles: One (or two) memory suffices.
CoRR, 2014

Modeling collaboration in academia: a game theoretic approach.
Proceedings of the 23rd International World Wide Web Conference, 2014

People like us: mining scholarly data for comparable researchers.
Proceedings of the 23rd International World Wide Web Conference, 2014

Adscape: harvesting and analyzing online display ads.
Proceedings of the 23rd International World Wide Web Conference, 2014

The Shapley Value in Knapsack Budgeted Games.
Proceedings of the Web and Internet Economics - 10th International Conference, 2014

Budget Feasible Mechanisms for Experimental Design.
Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

The Sublinear Approach to Big Data Problems.
Proceedings of the 20th International Conference on Management of Data, 2014

Large-Scale Optimistic Adaptive Submodularity.
Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

2013
Socializing the h-index.
J. Informetrics, 2013

A Consensus-Focused Group Recommender System.
CoRR, 2013

Stochastic Budget Optimization in Internet Advertising.
Algorithmica, 2013

A Time and Space Efficient Algorithm for Contextual Linear Bandits.
Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2013

Adaptive Submodular Maximization in Bandit Setting.
Proceedings of the Advances in Neural Information Processing Systems 26: 27th Annual Conference on Neural Information Processing Systems 2013. Proceedings of a meeting held December 5-8, 2013

Market Approach to Social Ads: The MyLikes Example and Related Problems.
Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

Private decayed predicate sums on streams.
Proceedings of the Joint 2013 EDBT/ICDT Conferences, 2013

Nearly Optimal Private Convolution.
Proceedings of the Algorithms - ESA 2013, 2013

Forty Years of Text Indexing.
Proceedings of the Combinatorial Pattern Matching, 24th Annual Symposium, 2013

First author advantage: citation labeling in research.
Proceedings of the 2013 workshop on Computational scientometrics: theory & applications, 2013

Frugal Streaming for Estimating Quantiles.
Proceedings of the Space-Efficient Data Structures, 2013

2012
Approximating Data with the Count-Min Sketch.
IEEE Softw., 2012

Studying the source code of scientific research.
SIGKDD Explor., 2012

Large-Scale Distributed Computation (NII Shonan Meeting 2012-1).
NII Shonan Meet. Rep., 2012

Continuous sampling from distributed streams.
J. ACM, 2012

Doubleclick Ad Exchange Auction
CoRR, 2012

Scienceography: the study of how science is written
CoRR, 2012

Group recommendations via multi-armed bandits.
Proceedings of the 21st World Wide Web Conference, 2012

Budget Optimization for Online Campaigns with Positive Carryover Effects.
Proceedings of the Internet and Network Economics - 8th International Workshop, 2012

Optimal private halfspace counting via discrepancy.
Proceedings of the 44th Symposium on Theory of Computing Conference, 2012

SocialCDN: Caching techniques for distributed social networks.
Proceedings of the 12th IEEE International Conference on Peer-to-Peer Computing, 2012

Strictly-Black-Box Zero-Knowledge and Efficient Validation of Financial Transactions.
Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

Scienceography: The Study of How Science Is Written.
Proceedings of the Fun with Algorithms - 6th International Conference, 2012

2011
Algorithms for distributed functional monitoring.
ACM Trans. Algorithms, 2011

Faster least squares approximation.
Numerische Mathematik, 2011

Partial Data Compression and Text Indexing via Optimal Suffix Multi-Selection
CoRR, 2011

Private Decayed Sum Estimation under Continual Observation
CoRR, 2011

Node Classification in Social Networks
CoRR, 2011

Finding hierarchy in directed online social networks.
Proceedings of the 20th International Conference on World Wide Web, 2011

Social Butterfly: Social Caches for Distributed Social Networks.
Proceedings of the PASSAT/SocialCom 2011, Privacy, 2011

Theory of data stream computing: where to go.
Proceedings of the 30th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2011

Pan-private algorithms via statistics on sketches.
Proceedings of the 30th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2011

Node Classification in Social Networks.
Proceedings of the Social Network Data Analytics, 2011

2010
On distributing symmetric streaming computations.
ACM Trans. Algorithms, 2010

Periodicity testing with sublinear samples and space.
ACM Trans. Algorithms, 2010

Data Management and Mining in Internet Ad Systems.
Proc. VLDB Endow., 2010

Thresholding random geometric graph properties motivated by ad hoc sensor networks.
J. Comput. Syst. Sci., 2010

Pan-private Algorithms: When Memory Does Not Help
CoRR, 2010

Stochastic Models for Budget Optimization in Search-Based Advertising.
Algorithmica, 2010

Monitoring algorithms for negative feedback systems.
Proceedings of the 19th International Conference on World Wide Web, 2010

Mining advertiser-specific user behavior using adfactors.
Proceedings of the 19th International Conference on World Wide Web, 2010

Approximation Schemes for Sequential Posted Pricing in Multi-unit Auctions.
Proceedings of the Internet and Network Economics - 6th International Workshop, 2010

Selective Call Out and Real Time Bidding.
Proceedings of the Internet and Network Economics - 6th International Workshop, 2010

Auctions with intermediaries: extended abstract.
Proceedings of the Proceedings 11th ACM Conference on Electronic Commerce (EC-2010), 2010

Optimal sampling from distributed streams.
Proceedings of the Twenty-Ninth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2010

Quasi-Proportional Mechanisms: Prior-Free Revenue Maximization.
Proceedings of the LATIN 2010: Theoretical Informatics, 2010

Data Mining Problems in Internet Ad Systems.
Proceedings of the 16th International Conference on Management of Data, 2010

2009
AdX: a model for ad exchanges.
SIGecom Exch., 2009

Compressing and indexing labeled trees, with applications.
J. ACM, 2009

Bid optimization for broad match ad auctions.
Proceedings of the 18th International Conference on World Wide Web, 2009

General auction mechanism for search advertising.
Proceedings of the 18th International Conference on World Wide Web, 2009

Ad Exchanges: Research Issues.
Proceedings of the Internet and Network Economics, 5th International Workshop, 2009

Online Ad Assignment with Free Disposal.
Proceedings of the Internet and Network Economics, 5th International Workshop, 2009

Optimal Cache-Aware Suffix Selection.
Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, 2009

An online mechanism for ad slot reservations with cancellations.
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

Stochastic Data Streams.
Proceedings of the Mathematical Foundations of Computer Science 2009, 2009

Pricing guidance in ad sale negotiations: the PrintAds example.
Proceedings of the 3rd ACM SIGKDD Workshop on Data Mining and Audience Intelligence for Advertising, 2009

Functionally Private Approximations of Negligibly-Biased Estimators.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2009

Online Stochastic Matching: Beating 1-1/e.
Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, 2009

Bidding on Configurations in Internet Ad Auctions.
Proceedings of the Computing and Combinatorics, 15th Annual International Conference, 2009

2008
Estimating statistical aggregates on probabilistic data streams.
ACM Trans. Database Syst., 2008

Finding hierarchical heavy hitters in streaming data.
ACM Trans. Knowl. Discov. Data, 2008

The Magnus-Derek game.
Theor. Comput. Sci., 2008

Data management projects at Google.
SIGMOD Rec., 2008

Theory research at Google.
SIGACT News, 2008

Relative-Error CUR Matrix Decompositions.
SIAM J. Matrix Anal. Appl., 2008

Algorithmic Methods for Sponsored Search Advertising
CoRR, 2008

Online Ad Slotting With Cancellations
CoRR, 2008

Position Auctions with Bidder-Specific Minimum Prices.
Proceedings of the Internet and Network Economics, 4th International Workshop, 2008

Sponsored Search Auctions with Markovian Users.
Proceedings of the Internet and Network Economics, 4th International Workshop, 2008

Summarizing Two-Dimensional Data with Skyline-Based Statistical Descriptors.
Proceedings of the Scientific and Statistical Database Management, 2008

A Truthful Mechanism for Offline Ad Slot Scheduling.
Proceedings of the Algorithmic Game Theory, First International Symposium, 2008

Query-Aware Partitioning for Monitoring Massive Network Data Streams.
Proceedings of the 24th International Conference on Data Engineering, 2008

On Signatures for Communication Graphs.
Proceedings of the 24th International Conference on Data Engineering, 2008

Internet Ad Auctions: Insights and Directions.
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

Theory of Sponsored Search Auctions.
Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, 2008

Range Medians.
Proceedings of the Algorithms, 2008

08341 Executive Summary - Sublinear Algorithms.
Proceedings of the Sublinear Algorithms, 17.08. - 22.08.2008, 2008

08341 Abstracts Collection - Sublinear Algorithms.
Proceedings of the Sublinear Algorithms, 17.08. - 22.08.2008, 2008

2007
Foreword.
Theor. Comput. Sci., 2007

The string edit distance matching problem with moves.
ACM Trans. Algorithms, 2007

A data structure for a sequence of string accesses in external memory.
ACM Trans. Algorithms, 2007

Optimal suffix selection.
Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007

Budget optimization in search-based advertising auctions.
Proceedings of the Proceedings 8th ACM Conference on Electronic Commerce (EC-2007), 2007

DoWitcher: Effective Worm Detection and Containment in the Internet Core.
Proceedings of the INFOCOM 2007. 26th IEEE International Conference on Computer Communications, 2007

No Blog is an Island - Analyzing Connections Across Information Networks.
Proceedings of the First International Conference on Weblogs and Social Media, 2007

Sequential Change Detection on Data Streams.
Proceedings of the Workshops Proceedings of the 7th IEEE International Conference on Data Mining (ICDM 2007), 2007

Query-Aware Sampling for Data Streams.
Proceedings of the 23rd International Conference on Data Engineering Workshops, 2007

Monitoring Regular Expressions on Out-of-Order Streams.
Proceedings of the 23rd International Conference on Data Engineering, 2007

Conquering the Divide: Continuous Clustering of Distributed Data Streams.
Proceedings of the 23rd International Conference on Data Engineering, 2007

How to scalably and accurately skip past streams.
Proceedings of the 23rd International Conference on Data Engineering Workshops, 2007

In-Place Suffix Sorting.
Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007

Streaming Algorithms for Data in Motion.
Proceedings of the Combinatorics, 2007

Radix Sorting with No Extra Space.
Proceedings of the Algorithms, 2007

Stringology: Some Classic and Some Modern Problems.
Proceedings of the Combinatorial Pattern Matching, 18th Annual Symposium, 2007

2006
Preface.
Theor. Comput. Sci., 2006

The Graham-Knowlton Problem Revisited.
Theory Comput. Syst., 2006

Estimating Entropy and Entropy Norm on Data Streams.
Internet Math., 2006

Estimating Aggregate Properties on Probabilistic Streams
CoRR, 2006

On the Complexity of Processing Massive, Unordered, Distributed Data
CoRR, 2006

Compressing and searching XML data via two zips.
Proceedings of the 15th international conference on World Wide Web, 2006

Bidding to the Top: VCG and Equilibria of Position-Based Auctions.
Proceedings of the Approximation and Online Algorithms, 4th International Workshop, 2006

Sampling algorithms for <i>l</i><sub>2</sub> regression and applications.
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

Combinatorial Algorithms for Compressed Sensing.
Proceedings of the Structural Information and Communication Complexity, 2006

Modeling skew in data streams.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2006

Space- and time-efficient deterministic algorithms for biased quantiles over data streams.
Proceedings of the Twenty-Fifth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2006

Fractal Modeling of IP Network Traffic at Streaming Speeds.
Proceedings of the 22nd International Conference on Data Engineering, 2006

What's Different: Distributed, Continuous Monitoring of Duplicate-Resilient Aggregates on Data Streams.
Proceedings of the 22nd International Conference on Data Engineering, 2006

Subspace Sampling and Relative-Error Matrix Approximation: Column-Row-Based Methods.
Proceedings of the Algorithms, 2006

Subspace Sampling and Relative-Error Matrix Approximation: Column-Based Methods.
Proceedings of the Approximation, 2006

2005
What's new: finding significant differences in network data streams.
IEEE/ACM Trans. Netw., 2005

What's hot and what's not: tracking most frequent items dynamically.
ACM Trans. Database Syst., 2005

Domain-Driven Data Synopses for Dynamic Quantiles.
IEEE Trans. Knowl. Data Eng., 2005

Parallel scheduling problems in next generation wireless networks.
Networks, 2005

Approximation algorithms for array partitioning problems.
J. Algorithms, 2005

An improved data stream summary: the count-min sketch and its applications.
J. Algorithms, 2005

Data Streams: Algorithms and Applications.
Found. Trends Theor. Comput. Sci., 2005

A Heartbeat Mechanism and Its Application in Gigascope.
Proceedings of the 31st International Conference on Very Large Data Bases, Trondheim, Norway, August 30, 2005

Summarizing and Mining Inverse Distributions on Data Streams via Dynamic Inverse Sampling.
Proceedings of the 31st International Conference on Very Large Data Bases, Trondheim, Norway, August 30, 2005

The bin-covering technique for thresholding random geometric graph properties.
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

Substring compression problems.
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

Improved range-summable random variable construction algorithms.
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

Sampling Algorithms in a Stream Operator.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2005

Holistic Aggregates in a Networked World: Distributed Tracking of Approximate Quantiles.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2005

Summarizing and Mining Skewed Data Streams.
Proceedings of the 2005 SIAM International Conference on Data Mining, 2005

Editorial message: special track on data streams.
Proceedings of the 2005 ACM Symposium on Applied Computing (SAC), 2005

Space efficient mining of multigraph streams.
Proceedings of the Twenty-fourth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2005

Detecting malicious network traffic using inverse distributions of packet contents.
Proceedings of the 1st Annual ACM Workshop on Mining Network Data, 2005

MoDB: Database System for Synthesizing Human Motion.
Proceedings of the 21st International Conference on Data Engineering, 2005

Effective Computation of Biased Quantiles over Data Streams.
Proceedings of the 21st International Conference on Data Engineering, 2005

Subquadratic Algorithms for Workload-Aware Haar Wavelet Synopses.
Proceedings of the FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science, 2005

Structuring labeled trees for optimal succinctness, and beyond.
Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 2005

Workload-Optimal Histograms on Streams.
Proceedings of the Algorithms, 2005

Efficient String Matching Algorithms for Combinatorial Universal Denoising.
Proceedings of the 2005 Data Compression Conference (DCC 2005), 2005

Streams, Security and Scalability.
Proceedings of the Data and Applications Security XIX, 2005

05291 Abstracts Collection -- Sublinear Algorithms.
Proceedings of the Sublinear Algorithms, 17.07. - 22.07.2005, 2005

2004
An efficient algorithm for sequence comparison with block reversals.
Theor. Comput. Sci., 2004

Online Scheduling to Minimize Average Stretch.
SIAM J. Comput., 2004

Approximation Algorithms for Average Stretch Scheduling.
J. Sched., 2004

Average stretch without migration.
J. Comput. Syst. Sci., 2004

Parallel two dimensional witness computation.
Inf. Comput., 2004

Mining Deviants in Time Series Data Streams.
Proceedings of the 16th International Conference on Scientific and Statistical Database Management (SSDBM 2004), 2004

Holistic UDAFs at streaming speeds.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2004

Diamond in the Rough: Finding Hierarchical Heavy Hitters in Multi-Dimensional Data.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2004

Sublinear Methods for Detecting Periodic Trends in Data Streams.
Proceedings of the LATIN 2004: Theoretical Informatics, 2004

2003
One-Pass Wavelet Decompositions of Data Streams.
IEEE Trans. Knowl. Data Eng., 2003

Comparing Data Streams Using Hamming Norms (How to Zero In).
IEEE Trans. Knowl. Data Eng., 2003

Efficient Approximation of Correlated Sums on Data Streams.
IEEE Trans. Knowl. Data Eng., 2003

Two-dimensional substring indexing.
J. Comput. Syst. Sci., 2003

Generalized substring selectivity estimation.
J. Comput. Syst. Sci., 2003

Approximation algorithms for MAX-MIN tiling.
J. Algorithms, 2003

Checks and Balances: Monitoring Data Quality Problems in Network Traffic Databases.
Proceedings of 29th International Conference on Very Large Data Bases, 2003

Finding Hierarchical Heavy Hitters in Data Streams.
Proceedings of 29th International Conference on Very Large Data Bases, 2003

Inferring tree topologies using flow tests.
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

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

Approximation of functions over redundant dictionaries using coherence.
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

IPSOFACTO: A Visual Correlation Tool for Aggregate Network Traffic Data.
Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data, 2003

Improved sparse approximation over quasiincoherent dictionaries.
Proceedings of the 2003 International Conference on Image Processing, 2003

LHP: an end-to-end reliable transport protocol over wireless data networks.
Proceedings of IEEE International Conference on Communications, 2003

Maintenance of Multidimensional Histograms.
Proceedings of the FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science, 2003

Comparing Sequences with Segment Rearrangements.
Proceedings of the FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science, 2003

Estimating Dominance Norms of Multiple Data Streams.
Proceedings of the Algorithms, 2003

2002
Exact Size of Binary Space Partitionings and Improved Rectangle Tiling Algorithms.
SIAM J. Discret. Math., 2002

An Adversarial Model for Distributed Dynamic Load Balancing.
J. Interconnect. Networks, 2002

Algorithmic issues in modeling motion.
ACM Comput. Surv., 2002

Reverse Nearest Neighbor Aggregates Over Data Streams.
Proceedings of 28th International Conference on Very Large Data Bases, 2002

How to Summarize the Universe: Dynamic Maintenance of Quantiles.
Proceedings of 28th International Conference on Very Large Data Bases, 2002

Near-optimal sparse fourier representations via sampling.
Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002

Fast, small-space algorithms for approximate histogram maintenance.
Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002

Efficient algorithms for document retrieval problems.
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

Simple approximation algorithm for nonoverlapping local alignments.
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

Slice and dice: a simple, improved approximate tiling recipe.
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

Improved algorithms for stretch scheduling.
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

Mining database structure; or, how to build a data quality browser.
Proceedings of the 2002 ACM SIGMOD International Conference on Management of Data, 2002

An Improved Algorithm for Sequence Comparison with Block Reversals.
Proceedings of the LATIN 2002: Theoretical Informatics, 2002

Fast Mining of Massive Tabular Data via Approximate Distance Computations.
Proceedings of the 18th International Conference on Data Engineering, San Jose, CA, USA, February 26, 2002

Histogramming Data Streams with Fast Per-Item Processing.
Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

Static Optimality Theorem for External Memory String Access.
Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS 2002), 2002

Estimating Rarity and Similarity over Data Stream Windows.
Proceedings of the Algorithms, 2002

Range Searching in Categorical Data: Colored Range Searching on Grid.
Proceedings of the Algorithms, 2002

Simple and Practical Sequence Nearest Neighbors with Block Operations.
Proceedings of the Combinatorial Pattern Matching, 13th Annual Symposium, 2002

2001
Efficient Approximation Algorithms for Tiling and Packing Problems with Rectangles.
J. Algorithms, 2001

Using q-grams in a DBMS for Approximate String Processing.
IEEE Data Eng. Bull., 2001

Approximate String Joins in a Database (Almost) for Free.
Proceedings of the VLDB 2001, 2001

Surfing Wavelets on Streams: One-Pass Summaries for Approximate Aggregate Queries.
Proceedings of the VLDB 2001, 2001

Internet packet filter management and rectangle geometry.
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

Improved approximation algorithms for rectangle tiling and packing.
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

Optimal and Approximate Computation of Summary Statistics for Range Aggregates.
Proceedings of the Twentieth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2001

Design issues in multimedia messaging for next generation wireless systems.
Proceedings of the Second ACM International Workshop on Data Engineering for Wireless and Mobile Access, 2001

Location based services in a wireless WAN using cellular digital packet data (CDPD).
Proceedings of the Second ACM International Workshop on Data Engineering for Wireless and Mobile Access, 2001

Counting Twig Matches in a Tree.
Proceedings of the 17th International Conference on Data Engineering, 2001

Permutation Editing and Matching via Embeddings.
Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

2000
Quadtree-structured variable-size block-matching motion estimation with minimal error.
IEEE Trans. Circuits Syst. Video Technol., 2000

Simple Optimal Parallel Multiple Pattern Matching.
J. Algorithms, 2000

On the sorting-complexity of suffix tree construction.
J. ACM, 2000

Identifying Representative Trends in Massive Time Series Data Sets Using Sketches.
Proceedings of the VLDB 2000, 2000

Approximate nearest neighbors and sequence comparison with block operations.
Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000

On the temporal HZY compression scheme.
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

Engineering the compression of massive tables: an experimental approach.
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

Scheduling to minimize average stretch without migration.
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

Minimizing maximum response time in scheduling broadcasts.
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

Influence Sets Based on Reverse Nearest Neighbor Queries.
Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data, 2000

Optimal Histograms for Hierarchical Range Queries.
Proceedings of the Nineteenth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2000

Selectivity Estimation for Boolean Queries.
Proceedings of the Nineteenth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2000

Layered Multicast Recovery.
Proceedings of the Proceedings IEEE INFOCOM 2000, 2000

Scalable, Low-Overhead Network Delay Estimation.
Proceedings of the Proceedings IEEE INFOCOM 2000, 2000

Tradeoffs for Packet Classification.
Proceedings of the Proceedings IEEE INFOCOM 2000, 2000

1999
Tight Analyses of Two Local Load Balancing Algorithms.
SIAM J. Comput., 1999

Mining Deviants in a Time Series Database.
Proceedings of the VLDB'99, 1999

Compact Grid Layouts of Multi-Level Networks.
Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999

Multi-Method Dispatching: A Geometric Approach With Applications to String Matching Problems.
Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999

Efficient Sequencing Tape-Resident Jobs.
Proceedings of the Eighteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, May 31, 1999

On Rectangular Partitionings in Two Dimensions: Algorithms, Complexity, and Applications.
Proceedings of the Database Theory, 1999

1998
A Constant Time Optimal Parallel Algorithm for Two-Dimensional Pattern Matching.
SIAM J. Comput., 1998

First- and Second-Order Diffusive Methods for Rapid, Coarse, Distributed Load Balancing.
Theory Comput. Syst., 1998

Optimal Histograms with Quality Guarantees.
Proceedings of the VLDB'98, 1998

Layout of the Batcher Bitonic Sorter (Extended Abstract).
Proceedings of the Tenth Annual ACM Symposium on Parallel Algorithms and Architectures, 1998

On Approximating Rectangle Tiling and Packing.
Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998

Flow and Stretch Metrics for Scheduling Continuous Job Streams.
Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998

Second-Order Methods for Distributed Approximate Single- and Multicommodity Flow.
Proceedings of the Randomization and Approximation Techniques in Computer Science, 1998

Scheduling On-Demand Broadcasts: New Metrics and Algorithms.
Proceedings of the MOBICOM '98, 1998

Randomization in Parallel Stringology.
Proceedings of the Parallel and Distributed Processing, 10 IPPS/SPDP'98 Workshops Held in Conjunction with the 12th International Parallel Processing Symposium and 9th Symposium on Parallel and Distributed Processing, Orlando, Florida, USA, March 30, 1998

Overcoming the Memory Bottleneck in Suffix Tree Construction.
Proceedings of the 39th Annual Symposium on Foundations of Computer Science, 1998

Augmenting Suffix Trees, with Applications.
Proceedings of the Algorithms, 1998

1997
Algorithms for an FPGA switch module routing problem with application to global routing.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1997

Hardness of Flip-Cut Problems from Optical Mapping.
J. Comput. Biol., 1997

Local Rules for Protein Folding on a Triangular Lattice and Generalized Hydrophobicity in the HP Model.
J. Comput. Biol., 1997

Optimal Parallel Randomized Renaming.
Inf. Process. Lett., 1997

Detecting False Matches in String-Matching Algorithms.
Algorithmica, 1997

The Architecture of a Software Library for String Processing.
Proceedings of the Workshop on Algorithm Engineering, 1997

Group testing problems with sequences in experimental molecular biology.
Proceedings of the Compression and Complexity of SEQUENCES 1997, 1997

Hardness of flip-cut problems from optical mapping [DNA molecules application].
Proceedings of the Compression and Complexity of SEQUENCES 1997, 1997

Towards constructing physical maps by optical mapping (extended abstract): an effective, simple, combinatorial approach.
Proceedings of the First Annual International Conference on Research in Computational Molecular Biology, 1997

Engineering Diffusive Load Balancing Algorithms Using Experiments.
Proceedings of the Solving Irregularly Structured Problems in Parallel, 1997

Efficient Array Partitioning.
Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997

Graph Editing to Bipartite Interval Graphs: Exact and Asymtotic Bounds.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1997

1996
Dynamic Load Balancing by Random Matchings.
J. Comput. Syst. Sci., 1996

First and Second Order Diffusive Methods for Rapid, Coarse, Distributed Load Balancing (Extended Abstract).
Proceedings of the 8th Annual ACM Symposium on Parallel Algorithms and Architectures, 1996

Resource Scheduling for Parallel Database and Scientific Applications.
Proceedings of the 8th Annual ACM Symposium on Parallel Algorithms and Architectures, 1996

Time and Space Efficient Method-Lookup for Object-Oriented Programs (Extended Abstract).
Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 1996

Optimal Logarithmic Time Randomized Suffix Tree Construction.
Proceedings of the Automata, Languages and Programming, 23rd International Colloquium, 1996

Efficient Dynamic Method-Lookup for Object Oriented Languages (Extended Abstract).
Proceedings of the Algorithms, 1996

Perfect Hashing for Strings: Formalization and Algorithms.
Proceedings of the Combinatorial Pattern Matching, 7th Annual Symposium, 1996

1995
String Matching Under a General Matching Relation
Inf. Comput., October, 1995

Optimal Parallel Dictionary Matching and Compression (Extended Abstract).
Proceedings of the 7th Annual ACM Symposium on Parallel Algorithms and Architectures, 1995

New Results and Open Problems Related to Non-Standard Stringology.
Proceedings of the Combinatorial Pattern Matching, 6th Annual Symposium, 1995

Computing Similarity between RNA Strings.
Proceedings of the Combinatorial Pattern Matching, 6th Annual Symposium, 1995

1994
Searching for Strings and Searching in Presence of Errors.
PhD thesis, 1994

Alphabet Dependence in Parameterized Matching.
Inf. Process. Lett., 1994

Non-standard stringology: algorithms and complexity.
Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 1994

Dynamic Load Balancing in Parallel and Distributed Networks by Random Matchings (Extended Abstract).
Proceedings of the 6th Annual ACM Symposium on Parallel Algorithms and Architectures, 1994

On Optimal Strategies for Searching in Presence of Errors.
Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, 1994

Optimal Parallel Algorithms for Prefix Matching.
Proceedings of the Automata, Languages and Programming, 21st International Colloquium, 1994

Algorithms for a switch module routing problem.
Proceedings of the Proceedings EURO-DAC'94, 1994

1993
Highly Efficient Dictionary Matching in Parallel.
Proceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures, 1993

Optimally fast parallel algorithms for preprocessing and pattern matching in one and two dimensions
Proceedings of the 34th Annual Symposium on Foundations of Computer Science, 1993


  Loading...