| * | 2002 |
|---|
| 11 | EE | Krisztián Monostori,
Arkady B. Zaslavsky,
Heinz W. Schmidt:
Suffix Vector: Space- and Time-Efficient Alternative to Suffix Trees.
ACSC 2002: 157-165 |
| 10 | EE | Raphael A. Finkel,
Arkady B. Zaslavsky,
Krisztián Monostori,
Heinz W. Schmidt:
Signature Extraction for Overlap Detection in Documents.
ACSC 2002: 59-64 |
| 9 | EE | Krisztián Monostori,
Raphael A. Finkel,
Arkady B. Zaslavsky,
Gábor Hodász,
Máté Pataki:
Comparison of Overlap Detection Techniques.
International Conference on Computational Science (1) 2002: 51-60 |
| 2001 |
|---|
| 8 | EE | Krisztián Monostori,
Arkady B. Zaslavsky,
Heinz W. Schmidt:
Efficiency of Data Structures for Detecting Overlaps in Digital Documents.
ACSC 2001: 140-147 |
| 7 | EE | Arkady B. Zaslavsky,
Alejandro Bia,
Krisztián Monostori:
Using Copy-Detection and Text Comparison Algorithms for Cross-Referencing Multiple Editions of Literary Works.
ECDL 2001: 103-114 |
| 6 | EE | Krisztián Monostori,
Arkady B. Zaslavsky,
István Vajk:
Suffix Vector: A Space-Efficient Suffix Tree Representation.
ISAAC 2001: 707-718 |
| 2000 |
|---|
| 5 | EE | Krisztián Monostori,
Arkady B. Zaslavsky,
Heinz W. Schmidt:
Document overlap detection system for distributed digital libraries.
ACM DL 2000: 226-227 |
| 4 | EE | Krisztián Monostori,
Arkady B. Zaslavsky,
Heinz W. Schmidt:
Digital documents in educational environment (poster session): misuse, appropriation and detection issues.
ACSE 2000: 254-255 |
| 3 | | Krisztián Monostori,
Arkady B. Zaslavsky,
Heinz W. Schmidt:
MatchDetectReveal: finding overlapping and similar digital documents.
IRMA Conference 2000: 955-957 |
| 2 | EE | Krisztián Monostori,
Arkady B. Zaslavsky,
Heinz W. Schmidt:
Parallel and Distributed Document Overlap Detection on the Web.
PARA 2000: 206-214 |
| 1998 |
|---|
| 1 | | Krisztián Monostori:
Teaching Control Theory Interactively.
Teleteaching 1998: 579-588 |
