Antoni Kreczmar

According to our database1, Antoni Kreczmar authored at least 11 papers between 1973 and 1991.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

1991
Analysis of algorithms and data structures.
International computer science series, Addison-Wesley, ISBN: 978-0-201-41693-0, 1991

1990
LOGPLAN '88 - Report on the Programming Language
Lecture Notes in Computer Science 414, Springer, ISBN: 3-540-52325-1, 1990

1984
Programmed Deallocation Without Dangling Reference.
Inf. Process. Lett., 1984

Concatenation of program modules an algebraic approach to the semantic and implementation problems.
Proceedings of the Computation Theory, 1984

1980
Semantics and implementation of prefixing at many levels.
Proceedings of the Logics of Programs and Their Applications, 1980

1979
Some historical remarks on algorithmic logic.
Proceedings of the Algorithms in Modern Mathematics and Computer Science, 1979

1978
Dynamic Theories of Real and Complex Numbers.
Proceedings of the Mathematical Foundations of Computer Science 1978, 1978

1977
On Finite and Infinite Computations.
Proceedings of the Fundamentals of Computation Theory, 1977

1976
On Memory Requirements of Strassen's Algorithms.
Proceedings of the Mathematical Foundations of Computer Science 1976, 1976

1974
Effectivity Problems of Algorithmic Logic.
Proceedings of the Automata, Languages and Programming, 2nd Colloquium, University of Saarbrücken, Germany, July 29, 1974

1973
Algorithm for constructing of university timetables and criterion of consistency of requirements.
Acta Cybern., 1973


  Loading...