Alex Thomo

According to our database1, Alex Thomo authored at least 106 papers between 2000 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2019
Triad Enumeration at Trillion-Scale Using a Single Commodity Machine.
Proceedings of the Advances in Database Technology, 2019

Fast Truss Decomposition in Large-scale Probabilistic Graphs.
Proceedings of the Advances in Database Technology, 2019

Efficient Computation of Probabilistic Core Decomposition at Web-Scale.
Proceedings of the Advances in Database Technology, 2019

2018
Social Web Search.
Proceedings of the Encyclopedia of Social Network Analysis and Mining, 2nd Edition, 2018

Anonymization and De-anonymization of Social Network Data.
Proceedings of the Encyclopedia of Social Network Analysis and Mining, 2nd Edition, 2018

Scalable Misinformation Prevention in Social Networks.
CoRR, 2018

NoSingles: a space-efficient algorithm for influence maximization.
Proceedings of the 30th International Conference on Scientific and Statistical Database Management, 2018

Data Structures for Efficient Computation of Influence Maximization and Influence Estimation.
Proceedings of the 21th International Conference on Extending Database Technology, 2018

K-Truss Decomposition of Large Networks on a Single Consumer-Grade Machine.
Proceedings of the IEEE/ACM 2018 International Conference on Advances in Social Networks Analysis and Mining, 2018

2017
Computing source-to-target shortest paths for complex networks in RDBMS.
J. Comput. Syst. Sci., 2017

Computation of K-Core Decomposition on Giraph.
CoRR, 2017

Zero-Knowledge-Private Counting of Group Triangles in Social Networks.
Comput. J., 2017

k-core Decomposition on Giraph and GraphChi.
Proceedings of the Advances in Intelligent Networking and Collaborative Systems, 2017

Conflict-Aware Weighted Bipartite b-Matching and Its Application to E-Commerce.
Proceedings of the 33rd IEEE International Conference on Data Engineering, 2017

Efficient Implementation of Anchored 2-core Algorithm.
Proceedings of the 2017 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2017, Sydney, Australia, July 31, 2017

2016
Clearing Contamination in Large Networks.
IEEE Trans. Knowl. Data Eng., 2016

Conflict-Aware Weighted Bipartite B-Matching and Its Application to E-Commerce.
IEEE Trans. Knowl. Data Eng., 2016

Efficient Computation of Feedback Arc Set at Web-Scale.
PVLDB, 2016

A new approach to distinguish migraine from stroke by mining structured and unstructured clinical data-sources.
NetMAHIB, 2016

ACon: A learning-based approach to deal with uncertainty in contextual requirements at runtime.
Information & Software Technology, 2016

Fuzzy joins in MapReduce: Edit and Jaccard distance.
Proceedings of the 7th International Conference on Information, 2016

Efficient Computation of Importance Based Communities in Web-Scale Networks Using a Single Machine.
Proceedings of the 25th ACM International Conference on Information and Knowledge Management, 2016

From Recommendation to Profile Inference (Rec2PI): A Value-added Service to Wi-Fi Data Mining.
Proceedings of the 25th ACM International Conference on Information and Knowledge Management, 2016

Group-Aware Weighted Bipartite B-Matching.
Proceedings of the 25th ACM International Conference on Information and Knowledge Management, 2016

An experimental evaluation of giraph and GraphChi.
Proceedings of the 2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, 2016

2015
Fuzzy Joins in MapReduce: An Experimental Study.
PVLDB, 2015

K-Core Decomposition of Large Networks on a Single PC.
PVLDB, 2015

Erratum to: Mining clinical text for stroke prediction.
NetMAHIB, 2015

Mining clinical text for stroke prediction.
NetMAHIB, 2015

Dynamis: Effective Context-Aware Web Service Selection Using Dynamic Attributes.
Future Internet, 2015

A model for learning the news in social networks.
Ann. Math. Artif. Intell., 2015

Mining Association Rules in the BCCA Liver Cancer Data Set.
Proceedings of the Driving Quality in Informatics: Fulfilling the Promise, 2015

2014
Anonymization and De-anonymization of Social Network Data.
Encyclopedia of Social Network Analysis and Mining, 2014

Computing k-Regret Minimizing Sets.
PVLDB, 2014

Clearing Contamination in Large Networks.
CoRR, 2014

Three-Way Joins on MapReduce: An Experimental Study.
CoRR, 2014

Buyer to Seller Recommendation under Constraints.
CoRR, 2014

Comparing the staples in latent factor models for recommender systems.
Proceedings of the Symposium on Applied Computing, 2014

A case study of applying data mining to sensor data for contextual requirements analysis.
Proceedings of the IEEE 1st International Workshop on Artificial Intelligence for Requirements Engineering, 2014

Three-way joins on MapReduce: An experimental study.
Proceedings of the 5th International Conference on Information, 2014

View-Based Tree-Language Rewritings for XML.
Proceedings of the Foundations of Information and Knowledge Systems, 2014

Zero-Knowledge Private Computation of Node Bridgeness in Social Networks.
Proceedings of the Advanced Information Systems Engineering Workshops, 2014

Incorporating User Reviews as Implicit Feedback for Improving Recommender Systems.
Proceedings of the 2014 IEEE Fourth International Conference on Big Data and Cloud Computing, 2014

Utilizing Favorites Lists for Better Recommendations.
Proceedings of the 2014 IEEE Fourth International Conference on Big Data and Cloud Computing, 2014

Clearing contamination in large networks.
Proceedings of the 2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, 2014

How do biological networks differ from social networks? (an experimental study).
Proceedings of the 2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, 2014

Semantic Graph Compression with Hypergraphs.
Proceedings of the 28th IEEE International Conference on Advanced Information Networking and Applications, 2014

2013
Trust prediction from user-item ratings.
Social Netw. Analys. Mining, 2013

Why Waldo befriended the dummy? k-Anonymization of social networks with pseudo-nodes.
Social Netw. Analys. Mining, 2013

Probabilistic Graph Summarization.
Proceedings of the Web-Age Information Management - 14th International Conference, 2013

Differential Privacy: Improving Utility via Differential Noise.
Proceedings of the 21st Italian Symposium on Advanced Database Systems, 2013

Extracting association rules from liver cancer data using the FP-growth algorithm.
Proceedings of the IEEE 3rd International Conference on Computational Advances in Bio and Medical Sciences, 2013

Indexing Reverse Top-k Queries in Two Dimensions.
Proceedings of the Database Systems for Advanced Applications, 2013

Zero-knowledge private graph summarization.
Proceedings of the 2013 IEEE International Conference on Big Data, 2013

LINK RECOMMENDER: Collaborative-Filtering for Recommending URLs to Twitter Users.
Proceedings of the 4th International Conference on Ambient Systems, 2013

2012
Regular Path Queries on Graph-Structured Data.
Proceedings of the Handbook of Finite State Based Models and Applications., 2012

PredictingTrust from User Ratings.
Proceedings of the 3rd International Conference on Ambient Systems, 2012

Computing optimal k-regret minimizing sets with top-k depth contours
CoRR, 2012

Indexing Reverse Top-k Queries
CoRR, 2012

Implication of regular expressions.
Appl. Math. Lett., 2012

Differential Privacy in Practice.
Proceedings of the Secure Data Management - 9th VLDB Workshop, 2012

Learning the News in Social Networks.
Proceedings of the Foundations of Information and Knowledge Systems, 2012

SmarterDeals: a context-aware deal recommendation system based on the smartercontext engine.
Proceedings of the Center for Advanced Studies on Collaborative Research, 2012

Large-Scale Mining of Co-occurrences: Challenges and Solutions.
Proceedings of the 2012 Seventh International Conference on P2P, 2012

2011
Full-Text (Substring) Indexes in External Memory
Synthesis Lectures on Data Management, Morgan & Claypool Publishers, 2011

Rewriting of visibly pushdown languages for XML data integration.
Theor. Comput. Sci., 2011

Evolving schemas for streaming XML.
Theor. Comput. Sci., 2011

Suffix trees for inputs larger than main memory.
Inf. Syst., 2011

On supporting dynamic web service selection with histogramming.
Proceedings of the 5th IEEE International Workshop on the Maintenance and Evolution of Service-Oriented and Cloud-Based Systems, 2011

Indexing for Vector Projections.
Proceedings of the Database Systems for Advanced Applications, 2011

k-Anonymization of Social Networks by Vertex Addition.
Proceedings of the ADBIS 2011, 2011

2010
A survey of practical algorithms for suffix tree construction in external memory.
Softw., Pract. Exper., 2010

Certain answers and rewritings for local regular path queries on graph-structured data.
Proceedings of the Fourteenth International Database Engineering and Applications Symposium (IDEAS 2010), 2010

Evolving Schemas for Streaming XML.
Proceedings of the Foundations of Information and Knowledge Systems, 2010

Online update of b-trees.
Proceedings of the 19th ACM Conference on Information and Knowledge Management, 2010

2009
Fault-tolerant computation of distributed regular path queries.
Theor. Comput. Sci., 2009

Bounded regular path queries in view-based data integration.
Inf. Process. Lett., 2009

Harnessing the power of "favorites" lists for recommendation systems.
Proceedings of the 2009 ACM Conference on Recommender Systems, 2009

Preferential Infinitesimals for Information Retrieval.
Proceedings of the Artificial Intelligence Applications and Innovations III, 2009

Scalable APRIORI-Based Frequent Pattern Discovery.
Proceedings of the 12th IEEE International Conference on Computational Science and Engineering, 2009

Trust-Based Infinitesimals for Enhanced Collaborative Filtering.
Proceedings of the 15th International Conference on Management of Data, 2009

Suffix trees for very large genomic sequences.
Proceedings of the 18th ACM Conference on Information and Knowledge Management, 2009

2008
A graph approach to the threshold all-against-all substring matching problem.
ACM Journal of Experimental Algorithmics, 2008

Preferential Regular Path Queries.
Fundam. Inform., 2008

Scalable Ubiquitous Data Access in Clustered Sensor Networks.
Proceedings of the Scientific and Statistical Database Management, 2008

Visibly Pushdown Transducers for Approximate Validation of Streaming XML.
Proceedings of the Foundations of Information and Knowledge Systems, 2008

Rewriting of visibly pushdown languages for xml data integration.
Proceedings of the 17th ACM Conference on Information and Knowledge Management, 2008

A new method for indexing genomes using on-disk suffix trees.
Proceedings of the 17th ACM Conference on Information and Knowledge Management, 2008

2007
Distributed Multi-source Regular Path Queries.
Proceedings of the Frontiers of High Performance Computing and Networking ISPA 2007 Workshops, 2007

Boundedness of Regular Path Queries in Data Integration Systems.
Proceedings of the Eleventh International Database Engineering and Applications Symposium (IDEAS 2007), 2007

Preferentially Annotated Regular Path Queries.
Proceedings of the Database Theory, 2007

Towards practically feasible answering of regular path queries in lav data integration.
Proceedings of the Sixteenth ACM Conference on Information and Knowledge Management, 2007

Shortest Path Approaches for the Longest Common Subsequence of a Set of Strings.
Proceedings of the 7th IEEE International Conference on Bioinformatics and Bioengineering, 2007

Grid-Aware Evaluation of Regular Path Queries on Spatial Networks.
Proceedings of the 21st International Conference on Advanced Information Networking and Applications (AINA 2007), 2007

2006
Regular path queries under approximate semantics.
Ann. Math. Artif. Intell., 2006

A New Algorithm for Fast All-Against-All Substring Matching.
Proceedings of the String Processing and Information Retrieval, 2006

Enhanced Regular Path Queries on Semistructured Databases.
Proceedings of the Current Trends in Database Technology - EDBT 2006, 2006

2005
Exchange, integration, and consistency of data: report on the ARISE/NISR workshop.
SIGMOD Record, 2005

Distributed evaluation of generalized path queries.
Proceedings of the 2005 ACM Symposium on Applied Computing (SAC), 2005

2004
Query Answering and Containment for Regular Path Queries under Distortions.
Proceedings of the Foundations of Information and Knowledge Systems, 2004

2003
Algebraic rewritings for optimizing regular path queries.
Theor. Comput. Sci., 2003

Query containment and rewriting using views for regular path queries under constraints.
Proceedings of the Twenty-Second ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2003

New Rewritings and Optimizations for Regular Path Queries.
Proceedings of the Database Theory, 2003

2001
Approximate Reasoning in Semistructured Data.
Proceedings of the 8th International Workshop on Knowledge Representation meets Databases (KRDB 2001), 2001

Algebraic Rewritings for Optimizing Regular Path Queries.
Proceedings of the Database Theory, 2001

2000
An Optimization Technique for Answering Regular Path Queries.
Proceedings of the Third International Workshop on the Web and Databases, 2000


  Loading...