Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Basil Tampakas

dblp:79/1371 · DBLP profile ↗
← Back
7ranked-venue papers
0as first author
0since 2021 · last 1999
0000-0003-1799-6548ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 4Systems, architecture and hardware · 2Databases, data management, data science and information retrieval · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Distributed computing theory · 50% Algorithmic game theory and mechanism design · 50%
Databases, data mining, and information retrieval
1 paper
Information retrieval · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
High-performance computing · 100%
Network and information security
1 paper
Privacy and data protection · 100%

Topics — the 4 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Information retrieval › retrieval models
vector space model
0.011995
Parallel Text Retrieval on a High Performance Super Computer Using the Vector Space Model · SIGIR 1995
Privacy and data protection
privacy in distributed systems
0.011994
Distributed Pursuit-Evasion: Some Aspects of Privacy and Security in Distributed Computing · PODC 1994
Distributed computing theory
distributed algorithms
0.011994
Distributed Pursuit-Evasion: Some Aspects of Privacy and Security in Distributed Computing · PODC 1994
Algorithmic game theory and mechanism design › graph games
pursuit-evasion games
0.011994
Distributed Pursuit-Evasion: Some Aspects of Privacy and Security in Distributed Computing · PODC 1994

Methods — techniques the papers use, named apart from their topics

vector space model · 0.0parallel algorithm · 0.0
YearPublicationVenuePosition
1999 Parallel Processing of Multiple Text Queries on Hypercube Interconnection Networks
Basilis Mamalis, Paul G. Spirakis, Basil Tampakas
Euro-Par3
1999 Optimal High-Performance Parallel Text Retrieval via Fat-Trees
Basilis Mamalis, Paul G. Spirakis, Basil Tampakas
Theory Comput. Syst.3
1995 Parallel Text Retrieval on a High Performance Super Computer Using the Vector Space Model
abstract
This paperl discusses the efi-iciency of a parallel text retrieval system that is based on the Vector Space Model.Specifically, we describe a general parallel retrieval algorithm for use with this model, the application of the algorithm in the FIRE system [I], and its implementation on the high performance GCe131512 Parsytec parallel machine [2].The use of this machine's t we-dimensional grid of processors provides an efficient baais for the virtual tree that lies at the heart of our retrieval algorithm.Analytical and experimental evidence is presented to demonstrate the efficiency of the algorithm.
Pavlos S. Efraimidis, Christos Glymidakis, Basilis Mamalis, Paul G. Spirakis, Basil Tampakas
SIGIR5
1994 Distributed Pursuit-Evasion: Some Aspects of Privacy and Security in Distributed Computing
abstract
No abstract available.
Paul G. Spirakis, Basil Tampakas
PODC2
1994 Tentative and Definite Distributed Computations: An Optimistic Approach to Network Synchronization
John D. Garofalakis, Paul G. Spirakis, Basil Tampakas, Sergio Rajsbaum
Theor. Comput. Sci.3
1992 Distributed System Simulator (DSS)
Paul G. Spirakis, Basil Tampakas, Marina Papatriantafilou, K. Konstantoulis, K. Vlaxodimitropoulos, V. Antonopoulos, P. Kazazis, T. Metallidou, D. Spartiotis
STACS2
1988 Efficient Distributed Algorithms by Using the Archemedean Time Assumption
Paul G. Spirakis, Basil Tampakas
STACS2