◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

János Tapolcai

Department of Telecommunications and Media Informatics, MTA-BME Future Internet Research Group, MTA-BME Information Systems Research Group, Budapest University of Technology and Economics, Budapest, H

4 papers hereh-index 292.8k citations198 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • sole author1
  • first author1
  • middle author2

Across the 4 of 4 papers where every author was matched, so the position is known.

fields
  • cs.DS2
  • cs.DL1
  • cs.IT1
affiliations
  • Department of Telecommunications and Media Informatics, MTA-BME Future Internet Research Group, MTA-BME Information Systems Research Group, Budapest University of Technology and Economics, Budapest, H
Homepage
same name
  • János Tapolcai — 3 papers, h 2

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20132017
most citedCompressing IP Forwarding Tables: Towards Entropy Bounds and Beyond

34 citations · 41 across the 4 of their papers we have counts for

collaborators

4 papers

cs.DL2017

Digital Encyclopedia of Scientific Results

János Tapolcai

This study describes a vision, how technology can help improving the efficiency in research. We propose a new clean-slate design, where more emphasis is given on the correctness an…

cs.DS2014★ 34 cited

Compressing IP Forwarding Tables: Towards Entropy Bounds and Beyond

Gábor Rétvári, János Tapolcai, Attila Kőrösi +2

Lately, there has been an upsurge of interest in compressed data structures, aiming to pack ever larger quantities of information into constrained memory without sacrificing the ef…

cs.IT2014★ 7 cited

Resilient Flow Decomposition of Unicast Connections with Network Coding

Peter Babarczi, Janos Tapolcai, Lajos Ronyai +1

In this paper we close the gap between end-to-end diversity coding and intra-session network coding for unicast connections resilient against single link failures. In particular, w…

cs.DS2013

Memory size bounds of prefix DAGs

János Tapolcai, Gábor Rétvári, Attila Kőrösi

In this report an entropy bound on the memory size is given for a compression method of leaf-labeled trees. The compression converts the tree into a Directed Acyclic Graph (DAG) by…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.