About
Technology
Issues
FAQ
Search
Profile
Top Authors
Prolific Authors
Top Journals
Main Disciplines
Main Topics
Most Cited Articles
Scientometrics
Avg Impact Factor
★★
Articles
★★★
Articles
Citing Bodies
Top Citing Authors
Top Citing Institutions
Top Citing Schools
Top Citing Journals
Top Citing Disciplines
exaly
›
Schools
›
Department of Computer Science
›
top-articles
Department of Computer Science
522
(top 1%)
papers
8.6K
(top 1%)
citations
42
(top 1%)
h
-index
74
(top 1%)
g
-index
671
all documents
10.0K
doc citations
1.4K
citing journals
Top Articles
#
Title
Journal
Year
Citations
1
A Proof of Security of Yao’s Protocol for Two-Party Computation
Journal of Cryptology
2009
472
2
Computational methods in authorship attribution
Journal of the Association for Information Science and Technology
2009
364
3
An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
Lecture Notes in Computer Science
2007
260
4
Mining the Biomedical Literature in the Genomic Era: An Overview
Journal of Computational Biology
2003
203
5
Universally Composable Password-Based Key Exchange
Lecture Notes in Computer Science
2005
169
6
Evaluating practical negotiating agents: Results and analysis of the 2011 international competition
Artificial Intelligence
2013
137
7
GENIUS: AN INTEGRATED ENVIRONMENT FOR SUPPORTING THE DESIGN OF GENERIC AUTOMATED NEGOTIATORS
Computational Intelligence
2014
135
8
Efficient high-throughput SARS-CoV-2 testing to detect asymptomatic carriers
Science Advances
2020
135
9
An Algorithm for Approximate Tandem Repeats
Journal of Computational Biology
2001
134
10
DeepSign: Deep learning for automatic malware signature generation and classification
2015
121
11
Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries
2007
121
12
Determining if two documents are written by the same author
Journal of the Association for Information Science and Technology
2014
117
13
Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries
Journal of Cryptology
2010
115
14
THE IMPORTANCE OF NEUTRAL EXAMPLES FOR LEARNING SENTIMENT
Computational Intelligence
2006
112
15
Bidding in sealed-bid and English multi-attribute auctions
Decision Support Systems
2006
107
16
A statistical theory for quantitative association rules
1999
104
17
Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer
Lecture Notes in Computer Science
2011
103
18
Everlasting security in the bounded storage model
IEEE Transactions on Information Theory
2002
92
19
A Statistical Theory for Quantitative Association Rules
Journal of Intelligent Information Systems
2003
91
20
Secure Multi-Party Computation without Agreement
Journal of Cryptology
2005
82
21
Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries
Lecture Notes in Computer Science
2008
82
22
An Efficient SIFT-Based Mode-Seeking Algorithm for Sub-Pixel Registration of Remotely Sensed Images
IEEE Geoscience and Remote Sensing Letters
2015
81
23
Efficient frontier detection for robot exploration
International Journal of Robotics Research
2014
80
24
Skin cancer detection by deep learning and sound analysis algorithms: A prospective clinical study of an elementary dermoscope
EBioMedicine
2019
80
25
On Dynamic Shortest Paths Problems
Algorithmica
2011
73
26
Training Deterministic Parsers with Non-Deterministic Oracles
Transactions of the Association for Computational Linguistics
2013
72
27
The “Fundamental Problem” of Authorship Attribution
English Studies
2012
71
28
Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer
Journal of Cryptology
2012
71
29
Online data-driven anomaly detection in autonomous robots
Knowledge and Information Systems
2015
70
30
Efficient Constant Round Multi-party Computation Combining BMR and SPDZ
Lecture Notes in Computer Science
2015
69
31
Resolving crises through automated bilateral negotiations
Artificial Intelligence
2008
67
32
Fragmentation Considered Poisonous, or: One-domain-to-rule-them-all.org
2013
64
33
On the Limitations of Universally Composable Two-Party Computation Without Set-Up Assumptions
Journal of Cryptology
2006
63
34
Efficient Set Intersection with Simulation-Based Security
Journal of Cryptology
2016
63
35
The giving tree: constructing trees for efficient offline and online multi-robot coverage
Annals of Mathematics and Artificial Intelligence
2008
60
36
Keeping Denial-of-Service Attackers in the Dark
IEEE Transactions on Dependable and Secure Computing
2007
59
37
Explicit Non-adaptive Combinatorial Group Testing Schemes
Lecture Notes in Computer Science
2008
59
38
Realtime Classification for Encrypted Traffic
Lecture Notes in Computer Science
2010
59
39
Intelligent agent supporting human–multi-robot team collaboration
Artificial Intelligence
2017
56
40
Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries
Journal of Cryptology
2010
54
41
On the Usefulness of Fibonacci Compression Codes
Computer Journal
2010
52
42
A Genetic Algorithm-Based Solver for Very Large Jigsaw Puzzles
2013
50
43
CLOSED SUBGROUPS IN PRO-V TOPOLOGIES AND THE EXTENSION PROBLEM FOR INVERSE AUTOMATA
International Journal of Algebra and Computation
2001
49
44
Why Johnny can't surf (safely)? Attacks and defenses for web users
Computers and Security
2009
48
45
A Full Proof of the BGW Protocol for Perfectly Secure Multiparty Computation
Journal of Cryptology
2017
48
46
Mining fall-related information in clinical notes: Comparison of rule-based and novel word embedding-based machine learning approaches
Journal of Biomedical Informatics
2019
48
47
Distributed Algorithms for Network Diameter and Girth
Lecture Notes in Computer Science
2012
48
48
First order temporal logic monitoring with BDDs
2017
46
49
Combining psychological models with machine learning to better predict people’s decisions
SynthÈse
2012
45
50
Unsupervised and supervised exploitation of semantic domains in lexical disambiguation
Computer Speech and Language
2004
43
site/software ©
exaly
; All materials licenced under
CC by-SA
.