default search action

combined dblp search
author search
venue search
publication search

ask others

Information and Computation, Volume 265

> Home > Journals > Information and Computation

Refine list

refinements active!

zoomed in on ?? of ?? records

view refined list in

export refined list as

showing all ?? records

Volume 265, April 2019

- view
  authority control:
- export record
  dblp key:
  - journals/iandc/FerradaN19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/iandc/FerradaN19
Héctor Ferrada, Gonzalo Navarro:
Lempel-Ziv compressed structures for document retrieval. 1-25
- view
  authority control:
- export record
  dblp key:
  - journals/iandc/CournierRV19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/iandc/CournierRV19
Alain Cournier, Stephane Rovedakis, Vincent Villain:
The first fully polynomial stabilizing algorithm for BFS tree construction. 26-56
- view
  authority control:
- export record
  dblp key:
  - journals/iandc/BlumD19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/iandc/BlumD19
Johannes Blum, Frank Drewes:
Language theoretic properties of regular DAG languages. 57-76
- view
  authority control:
- export record
  dblp key:
  - journals/iandc/HolubMT19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/iandc/HolubMT19
Stepan Holub, Tomás Masopust, Michaël Thomazo:
On the height of towers of subsequences and prefixes. 77-93
- view
  authority control:
- export record
  dblp key:
  - journals/iandc/BrodaHMMR19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/iandc/BrodaHMMR19
Sabine Broda, Markus Holzer, Eva Maia, Nelma Moreira, Rogério Reis:
A mesh of automata. 94-111

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.