56 results on '"Lingas, Andrzej"'
Search Results
2. The complexity of approximating PSPACE-complete problems for hierarchical specifications : Extended abstract
3. Problems on pairs of trees and the four colour problem of planar graphs : Extended abstract
4. A confluent reduction for the extensional typed λ-calculus with pairs, sums, recursion and terminal object
5. Efficient analysis of concurrent constraint logic programs
6. Primal-dual approximation algorithms for integral flow and multicut in trees, with applications to matching and set cover : Extended abstract
7. The approximation of maximum subgraph problems : Extended abstract
8. Polynomially bounded minimization problems which are hard to approximate
9. From domains to automata with concurrency
10. What is a universal higher-order programming language?
11. Modularity of termination and confluence in combinations of rewrite systems with λω
12. The fork calculus
13. Timed testing of concurrent systems
14. Computing on structures
15. A partial solution for D-unification based on a reduction to AC 1-unification
16. Local model checking for context-free processes
17. Decidability of a partial order based temporal logic
18. Temporal logic and categories of Petri nets
19. Extended transition systems for parametric bisimulation
20. If a DOL language is k-power free then it is circular
21. On the power of periodic iteration of morphisms
22. Deciding true concurrency equivalences on finite safe nets (preliminary report)
23. Cobham's Theorem seen through Büchi's Theorem
24. Products of finite state machines with full coverage
25. Searching among intervals and compact routing tables
26. An effective version of Stallings' theorem in the case of context-free groups
27. On regular compatibility of semi-commutations
28. Algebraic aspects of B-regular series
29. Fast parallel constraint satisfaction
30. The product of rational languages
31. Sparse networks supporting efficient reliable broadcasting
32. Fast parallel computation of characteristic polynomials by Leverrier's power sum method adapted to fields of finite characteristic
33. Strongly adaptive token distribution
34. Finite automata as characterizations of minor closed tree families (extended abstract)
35. On distributed algorithms in a broadcast domain
36. On the computational power of discrete Hopfield nets
37. Optimal bounds for the change-making problem
38. Algebras for classifying regular tree languages and an application to frontier testability : Extended abstract
39. Logical definability on infinite traces
40. New decidability results concerning two-way counter machines and applications
41. Dynamic interpolation search in o(log log n) time
42. Learnability: Admissible, co-finite, and hypersimple languages
43. Computational depth and reducibility : Extended abstract
44. Inclusion is undecidable for pattern languages : Extended abstract
45. Secure and efficient off-line digital money (extended abstract)
46. Lower bounds for one-way probabilistic communication complexity
47. Maintaining discrete probability distributions optimally
48. On randomized versus deterministic computation
49. Reversal-space trade-offs for simultaneous resource-bounded nondeterministic Turing machines
50. Fault-tolerance and complexity (Extended abstract)
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.