Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Martin Dietzfelbinger

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Georg Schnitger

> Home > Persons > Martin Dietzfelbinger

Publications

1996
[j9]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/tcs/DietzfelbingerHS96
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/DietzfelbingerHS96
Martin Dietzfelbinger, Juraj Hromkovic, Georg Schnitger:
A Comparison of Two Lower-Bound Methods for Communication Complexity. Theor. Comput. Sci. 168(1): 39-51 (1996)
1994
[c16]
- view
  authority control:
- export record
  dblp key:
  - conf/mfcs/DietzfelbingerHS94
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/mfcs/DietzfelbingerHS94
Martin Dietzfelbinger, Juraj Hromkovic, Georg Schnitger:
A Comparison of Two Lower Bound Methods for Communication Complexity. MFCS 1994: 326-335
1991
[j4]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/tcs/DietzfelbingerMS91
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/DietzfelbingerMS91
Martin Dietzfelbinger, Wolfgang Maass, Georg Schnitger:
The Complexity of Matrix Transposition on One-Tape Off-Line Turing Machines. Theor. Comput. Sci. 82(1): 113-129 (1991)

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.