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
Demo Data from EDBT 2026 / reviewers in the wild / expert

Joydip Mitra

dblp:23/255 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
0since 2021 · last 2005
0000-0001-5508-1563ORCID · corroborated

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

Security and privacy · 2 · 2 first-authorArtificial intelligence and machine learning · 1 · 1 first-authorDatabases, data management, data science and information retrieval · 1 · 1 first-author

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.

Network and information security
2 papers
Cryptographic primitives and cryptanalysis · 100%

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

TopicWeightPapersLastEvidence papers
Cryptographic primitives and cryptanalysis
block cipher cryptanalysis		 0.112005
A Near-Practical Attack Against B Mode of HBB · ASIACRYPT 2005
Cryptographic primitives and cryptanalysis › generic attacks
time-memory tradeoff		 0.012004
Time-Memory Trade-Off Attacks on Multiplications and T-Functions · ASIACRYPT 2004
YearPublicationVenuePosition
2005 A Near-Practical Attack Against B Mode of HBB
Joydip Mitra
 ASIACRYPT1
2004 Time-Memory Trade-Off Attacks on Multiplications and T-Functions
Joydip Mitra, Palash Sarkar 0001
 ASIACRYPT1
2003 Automatic Understanding of Structures in Printed Mathematical Expressions
abstract
Recognizing mathematical expressions from document image is a key problem in automatic conversion of scientific documents into electronic form. In this paper, we propose a simple grammar-based approach to recognize complex two-dimensional structures of printed mathematical expressions with high accuracy. The proposed technique is based on the structural information of symbols in an expression. An efficient implementation of the grammar is presented. The system generates a TEX string for the input expression. A new criterion for defining structural complexity of a mathematical expression has been formulated to measure the performance of the proposed technique. Experiment using a good representative sample of mathematical expressions shows a reasonably high efficiency of the system.
Joydip Mitra, Utpal Garain, Bidyut B. Chaudhuri, Kumar Swamy H. V., Tamaltaru Pal
 ICDAR1