EDBT 2026 Demo / reviewers in the wild / expert

Sushant Patnaik

dblp:05/217 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
0since 2021 · last 1997
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 2 · 1 first-authorTheory of computation · 2 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
2 papers
Computational complexity · 100%
Databases, data mining, and information retrieval
1 paper
Data models and query languages · 44% Database theory · 44% Transaction processing and concurrency control · 13%

Topics — the 6 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Computational complexity › complexity classes
dynamic complexity		 0.011994
Dyn-FO: A Parallel, Dynamic Complexity Class · PODS 1994
Computational complexity › parallel complexity
parallel complexity classes		 0.011994
Dyn-FO: A Parallel, Dynamic Complexity Class · PODS 1994
Database theory
expressive power		 0.011991
The Expressiveness of a Family of Finite Set Languages · PODS 1991
Data models and query languages
query language		 0.011991
The Expressiveness of a Family of Finite Set Languages · PODS 1991
Computational complexity
descriptive complexity		 0.011991
The Expressiveness of a Family of Finite Set Languages · PODS 1991
Transaction processing and concurrency control › correctness criteria
order independence		 0.011991
The Expressiveness of a Family of Finite Set Languages · PODS 1991
YearPublicationVenuePosition
1997 Dyn-FO: A Parallel, Dynamic Complexity Class
Sushant Patnaik, Neil Immerman
 J. Comput. Syst. Sci.1
1996 The Expressiveness of a Family of Finite Set Languages
Neil Immerman, Sushant Patnaik, David W. Stemple
 Theor. Comput. Sci.2
1994 Dyn-FO: A Parallel, Dynamic Complexity Class
abstract
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, NP, and PSPACE are defined in terms of the complexity of checking—upon presentation of an entire input—whether the input satisfies a certain property.
Sushant Patnaik, Neil Immerman
 PODS1
1991 The Expressiveness of a Family of Finite Set Languages
abstract
In this paper we characterise exactly the complexity of a set based database language called SRL, which presents a unified framework for queries and updates.By imposing simple synt act ic restrictions on it, we are able to express exactly the classes, P and L OGSPA CE.We also discuss the role of ordering in database query languages and show that the hom operator of Machiavelli language in [OBB89]does not capture all the order-independent properties.Complexity
Neil Immerman, Sushant Patnaik, David W. Stemple
 PODS2