The following pages link to Paris C. Kanellakis (Q579956):
Displayed 36 items.
- Partition semantics for relations (Q579957) (← links)
- CCS expressions, finite state processes, and three problems of equivalence (Q918211) (← links)
- (Q960521) (redirect page) (← links)
- Method schemas. (Q960523) (← links)
- Is distributed locking harder? (Q1061510) (← links)
- On the analysis of cooperation and antagonism in networks of communicating processes (Q1098279) (← links)
- On the relationship of congruence closure and unification (Q1124338) (← links)
- On the computational complexity of cardinality constraints in relational databases (Q1154820) (← links)
- On the representation and querying of sets of possible worlds (Q1174717) (← links)
- Efficient parallel algorithms can be made robust (Q1189859) (← links)
- A data structure for arc insertion and regular path finding (Q1360677) (← links)
- Bounds in the propagation of selection into logic programs (Q1813949) (← links)
- Database query languages embedded in the typed lambda calculus (Q1923099) (← links)
- Indexing for data models with constraints and classes (Q1924391) (← links)
- Undecidable boundedness problems for datalog programs (Q3128622) (← links)
- (Q3138873) (← links)
- Object identity as a query language primitive (Q3158521) (← links)
- On Concurrency Control by Multiple Versions (Q3339325) (← links)
- (Q3341921) (← links)
- Polynomial-time implication problems for unary inclusion dependencies (Q3476305) (← links)
- The Complexity of Distributed Concurrency Control (Q3678697) (← links)
- (Q3696560) (← links)
- On the sequential nature of unification (Q3716320) (← links)
- (Q3777459) (← links)
- (Q3786016) (← links)
- (Q3786037) (← links)
- Parallel Algorithms for Term Matching (Q3796803) (← links)
- Local Search for the Asymmetric Traveling Salesman Problem (Q3893693) (← links)
- Flowshop scheduling with limited temporary storage (Q3930628) (← links)
- (Q4344152) (← links)
- (Q4385543) (← links)
- (Q4490722) (← links)
- An analysis of the Core-ML language: Expressive power and type reconstruction (Q4632418) (← links)
- (Q4847020) (← links)
- Parallel Algorithms with Processor Failures and Delays (Q4864434) (← links)
- Efficient parallel algorithms on restartable fail-stop processors (Q5255803) (← links)