Paris C. Kanellakis

Available identifiers

zbMath Open kanellakis.paris-christosDBLPk/ParisCKanellakisWikidataQ7137316 ScholiaQ7137316MaRDI QIDQ579956

List of research outcomes

Publication	Date of Publication	Type
An analysis of the Core-ML language: Expressive power and type reconstruction	2019-04-29	Paper
Efficient parallel algorithms on restartable fail-stop processors	2015-06-19	Paper
Method schemas.	2008-12-21	Paper
Object identity as a query language primitive	2005-01-25	Paper
https://portal.mardi4nfdi.de/entity/Q4490722	2000-07-20	Paper
https://portal.mardi4nfdi.de/entity/Q4385543	1998-05-14	Paper
A data structure for arc insertion and regular path finding	1997-11-27	Paper
https://portal.mardi4nfdi.de/entity/Q4344152	1997-07-15	Paper
Undecidable boundedness problems for datalog programs	1997-04-17	Paper
Indexing for data models with constraints and classes	1996-11-26	Paper
Database query languages embedded in the typed lambda calculus	1996-10-01	Paper
Parallel Algorithms with Processor Failures and Delays	1996-02-20	Paper
https://portal.mardi4nfdi.de/entity/Q4847020	1995-09-10	Paper
https://portal.mardi4nfdi.de/entity/Q3138873	1994-01-02	Paper
Efficient parallel algorithms can be made robust	1992-09-27	Paper
On the representation and querying of sets of possible worlds	1992-06-25	Paper
Bounds in the propagation of selection into logic programs	1992-06-25	Paper
Polynomial-time implication problems for unary inclusion dependencies	1990-01-01	Paper
CCS expressions, finite state processes, and three problems of equivalence	1990-01-01	Paper
On the relationship of congruence closure and unification	1989-01-01	Paper
On the analysis of cooperation and antagonism in networks of communicating processes	1988-01-01	Paper
Parallel Algorithms for Term Matching	1988-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3777459	1987-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3786037	1986-01-01	Paper
Partition semantics for relations	1986-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3786016	1986-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3696560	1985-01-01	Paper
The Complexity of Distributed Concurrency Control	1985-01-01	Paper
On the sequential nature of unification	1984-01-01	Paper
Is distributed locking harder?	1984-01-01	Paper
On Concurrency Control by Multiple Versions	1984-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3341921	1983-01-01	Paper
Local Search for the Asymmetric Traveling Salesman Problem	1980-01-01	Paper
Flowshop scheduling with limited temporary storage	1980-01-01	Paper
On the computational complexity of cardinality constraints in relational databases	1980-01-01	Paper

Research outcomes over time

This page was built for person: Paris C. Kanellakis