Stop the war!

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

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Andreas Pavlogiannis

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 Prateesh Goyal

> Home > Persons > Andreas Pavlogiannis

Publications

2019
[j8]
- view
  authority control:
- export record
  dblp key:
  - journals/toplas/ChatterjeeGGIP19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/toplas/ChatterjeeGGIP19
Krishnendu Chatterjee, Amir Kafshdar Goharshady, Prateesh Goyal, Rasmus Ibsen-Jensen, Andreas Pavlogiannis:
Faster Algorithms for Dynamic Algebraic Queries in Basic RSMs with Constant Treewidth. ACM Trans. Program. Lang. Syst. 41(4): 23:1-23:46 (2019)
2015
[c6]
- view
  authority control:
- export record
  dblp key:
  - conf/popl/ChatterjeeIPG15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/popl/ChatterjeeIPG15
Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Andreas Pavlogiannis, Prateesh Goyal:
Faster Algorithms for Algebraic Path Properties in Recursive State Machines with Constant Treewidth. POPL 2015: 97-109
2014
[i3]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/ChatterjeeIPG14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/ChatterjeeIPG14
Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Andreas Pavlogiannis, Prateesh Goyal:
Faster Algorithms for Algebraic Path Properties in RSMs with Constant Treewidth. CoRR abs/1410.7724 (2014)

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.