Krzysztof Lorys

According to our database1, Krzysztof Lorys authored at least 35 papers between 1987 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2018
Communication Complexity in Vertex Partition Whiteboard Model.
Proceedings of the Structural Information and Communication Complexity, 2018

2017
Fault-Tolerant Online Packet Scheduling on Parallel Channels.
Proceedings of the 2017 IEEE International Parallel and Distributed Processing Symposium, 2017

2014
Online Packet Scheduling Under Adversarial Jamming.
Proceedings of the Approximation and Online Algorithms - 12th International Workshop, 2014

2009
On the Size of Permutation Networks and Consequences for Efficient Simulation of Hypercube Algorithms on Bounded-Degree Networks.
SIAM J. Discrete Math., 2009

2007
Lower bound technique for length-reducing automata.
Inf. Comput., 2007

2005
Leftist Grammars and the Chomsky Hierarchy.
Proceedings of the Fundamentals of Computation Theory, 15th International Symposium, 2005

2004
Some Results on RWW- and RRWW-Automata and their Relation to the Class of Growing Context-Sensitive Languages.
Journal of Automata, Languages and Combinatorics, 2004

2003
New approximation algorithm for RTILE problem.
Theor. Comput. Sci., 2003

2002
Church-Rosser Languages vs. UCFL.
Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

Approximation Algorithm for the Maximum Leaf Spanning Tree Problem for Cubic Graphs.
Proceedings of the Algorithms, 2002

2000
Periodification scheme: constructing sorting networks with constant period.
J. ACM, 2000

Rectangle tiling.
Proceedings of the Approximation Algorithms for Combinatorial Optimization, 2000

1999
Delayed Path Coupling and Generating Random Permutations via Distributed Stochastic Processes.
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

Efficient Approximation Algorithms for the Achromatic Number.
Proceedings of the Algorithms, 1999

Multi-party Finite Computations.
Proceedings of the Computing and Combinatorics, 5th Annual International Conference, 1999

1998
Power of Cooperation and Multihead Finite Systems.
Proceedings of the Automata, Languages and Programming, 25th International Colloquium, 1998

1996
Fast Generation of Random Permutations via Networks Simulation
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1996

Periodic Merging Networks.
Proceedings of the Algorithms and Computation, 7th International Symposium, 1996

Limitations of the QRQW and EREW PRAM Models.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1996

Fast Generation of Random Permutations via Networks Simulation.
Proceedings of the Algorithms, 1996

1995
Retrieval of Scattered Information by EREW, CREW, and CRCW PRAMs.
Computational Complexity, 1995

On the Sizes of Permutation Networks and Consequences for Efficient Simulation of Hypercube Algorithms on Bounded-Degree Networks.
Proceedings of the STACS 95, 1995

1994
The Variable Membership Problem: Succinctness Versus Complexity.
Proceedings of the STACS 94, 1994

Fast and Feasible Periodic Sorting Networks of Constant Depth
Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 1994

1992
Retrieval of scattered information by EREW, CREW and CRCW PRAMs.
Proceedings of the Algorithm Theory, 1992

New Time Hierarchy Results for Deterministic TMs.
Proceedings of the STACS 92, 1992

On Growing Context-Sensitive Languages.
Proceedings of the Automata, Languages and Programming, 19th International Colloquium, 1992

1990
Fast Simulations of Time-Bounded One-Tape Turing Machines by Space-Bounded Ones.
SIAM J. Comput., 1990

Reversal Complexity Classes for Alternating Turing Machines.
SIAM J. Comput., 1990

1989
On Reversal Complexity for Alternating Turing Machines (Extended Abstract)
Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989

Some Time-Space Bounds for One-Tape Deterministic Turing Machines.
Proceedings of the Fundamentals of Computation Theory, 1989

1988
Alternating Real-Time Computations.
Inf. Process. Lett., 1988

Two Applications of Fürer's Counter to One-Tape Nondeterministic TMs.
Proceedings of the Mathematical Foundations of Computer Science 1988, 1988

1987
On Reversal Bounded Alternating Turing Machines.
Theor. Comput. Sci., 1987

A Note on "ℰ.
Math. Log. Q., 1987


  Loading...