Janos Simon
According to our database1, Janos Simon
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
On csauthors.net:
Bibliography
2017
Selection of unmanned aerial vehicle for precision agriculture with multi-criteria decision making algorithm.
Proceedings of the 15th IEEE International Symposium on Intelligent Systems and Informatics, 2017
2016
A survey of ICT: Evolution of architectures, models and layers.
Proceedings of the 14th IEEE International Symposium on Intelligent Systems and Informatics, 2016
Model of data center temperature monitoring system with the use of open source hardware.
Proceedings of the 14th IEEE International Symposium on Intelligent Systems and Informatics, 2016
Usage of QR codes in web based system for the electronic market research.
Proceedings of the 14th IEEE International Symposium on Intelligent Systems and Informatics, 2016
2015
Clicking for business English success.
Proceedings of the 13th IEEE International Symposium on Intelligent Systems and Informatics, 2015
2014
Comparison of different mobile WSN node localization techniques within the controlled microclimatic environment.
Proceedings of the IEEE 12th International Symposium on Intelligent Systems and Informatics, 2014
2007
The Undecidability of the Generalized Collatz Problem.
Proceedings of the Theory and Applications of Models of Computation, 2007
Analysis of multi-hop emergency message propagation in vehicular ad hoc networks.
Proceedings of the 8th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, 2007
2004
Bounding the firing synchronization problem on a ring.
Theor. Comput. Sci., 2004
Silence Is Golden with High Probability: Maintaining a Connected Backbone in Wireless Sensor Networks.
Proceedings of the Wireless Sensor Networks, First European Workshop, 2004
2002
Smaller solutions for the firing squad.
Theor. Comput. Sci., 2002
New Bounds for the Firing Squad Problem on a Ring.
Proceedings of the SIROCCO 9, 2002
2001
Decidable Properties of Graphs of All-Optical Networks.
Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001
2000
On the bottleneck counting argument.
Theor. Comput. Sci., 2000
Wavelength Assignment Problem on All-Optical Networks with k Fibres per Link.
Proceedings of the Automata, Languages and Programming, 27th International Colloquium, 2000
1998
Improved bounds for the firing synchronization problem.
Proceedings of the SIROCCO'98, 1998
1997
On the Amount of Randomness Needed in Distributed Computations.
Proceedings of the On Principles Of Distributed Systems, 1997
A Note on the Bottleneck Counting Argument.
Proceedings of the Twelfth Annual IEEE Conference on Computational Complexity, 1997
1996
Symmetry Breaking in Anonymous Networks: Characterizations.
Proceedings of the Fourth Israel Symposium on Theory of Computing and Systems, 1996
Active transport in biological computing.
Proceedings of the DNA Based Computers, 1996
1995
Deterministic, Constant Space, Self-Stabilizing Leader Election on Uniform Rings.
Proceedings of the Distributed Algorithms, 9th International Workshop, 1995
Average Circuit Depth and Average Communication Complexity.
Proceedings of the Algorithms, 1995
1992
On the Complexity of RAM with Various Operation Sets
Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992
Observing Self-Stabilization.
Proceedings of the Eleventh Annual ACM Symposium on Principles of Distributed Computing, 1992
1990
Milking the Aanderaa Argument
Inf. Comput., September, 1990
A New Lower Bound Theorem for Read-Only-Once Branching Programs and its Applications.
Proceedings of the Advances In Computational Complexity Theory, 1990
1989
On the Computational Complexity of Continuous Routing.
J. Algorithms, 1989
1988
Universal Traversal Sequences of Length n^O(log n) for Cliques.
Inf. Process. Lett., 1988
Investigations of Fault-Tolerant Networks of Computers (Preliminary Version)
Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988
1986
Probabilistic Communication Complexity.
J. Comput. Syst. Sci., 1986
Hierarchical VLSI Design Systems Based on Attribute Grammars.
Proceedings of the Conference Record of the Thirteenth Annual ACM Symposium on Principles of Programming Languages, 1986
Continous Routing and Batch Routing on the Hypercube.
Proceedings of the Fifth Annual ACM Symposium on Principles of Distributed Computing, 1986
Complexity classes in communication complexity theory (preliminary version)
Proceedings of the 27th Annual Symposium on Foundations of Computer Science, 1986
1985
Solving Undirected Graph Problems on VLSI.
SIAM J. Comput., 1985
1984
Information Transfer under Different Sets of Protocols.
SIAM J. Comput., 1984
Space-Bounded Hierarchies and Probabilistic Computations.
J. Comput. Syst. Sci., 1984
Probabilistic Communication Complexity (Preliminary Version)
Proceedings of the 25th Annual Symposium on Foundations of Computer Science, 1984
1983
Lower Bounds for Solving Undirected Graph Problems on VLSI.
Proceedings of the Automata, 1983
Lower Bounds on the Time of Probabilistic On-Line Simulations (Preliminary Version)
Proceedings of the 24th Annual Symposium on Foundations of Computer Science, 1983
Lower Bounds on Graph Threading by Probabilistic Machines (Preliminary Version)
Proceedings of the 24th Annual Symposium on Foundations of Computer Science, 1983
1982
Parallel Algorithms in Graph Theory: Planarity Testing.
SIAM J. Comput., 1982
Space Efficient Algorithms for Some Graph Theoretical Problems.
Acta Inf., 1982
Space-Bounded Hierarchies and Probabilistic Computations
Proceedings of the 14th Annual ACM Symposium on Theory of Computing, 1982
1981
On Tape-Bounded Probabilistic Turing Machine Acceptors.
Theor. Comput. Sci., 1981
Division in Idealized Unit Cost RAMS.
J. Comput. Syst. Sci., 1981
An Information-Theoretic Approach to Time Bounds for On-Line Computation.
J. Comput. Syst. Sci., 1981
Space-Bounded Probabilistic Turing Machine Complexity Classes Are Closed under Complement (Preliminary Version)
Proceedings of the 13th Annual ACM Symposium on Theory of Computing, 1981
1980
Deterministic Simulation of Tape-Bounded Probabilistic Turing Machine Transducers.
Theor. Comput. Sci., 1980
An Information-Theoretic Approach to Time Bounds for On-Line Computation (Preliminary Version)
Proceedings of the 12th Annual ACM Symposium on Theory of Computing, 1980
Parallel Algorithms in Graph Theory: Planarity Testing (preliminary version).
Proceedings of the Mathematical Foundations of Computer Science 1980 (MFCS'80), 1980
1979
Division Is Good
Proceedings of the 20th Annual Symposium on Foundations of Computer Science, 1979
1978
On Tape-Bounded Probabilistic Turing Machine Transducers (Extended Abstract)
Proceedings of the 19th Annual Symposium on Foundations of Computer Science, 1978
1977
On Feasible Numbers (Preliminary Version)
Proceedings of the 9th Annual ACM Symposium on Theory of Computing, 1977
On the Difference Between One and Many (Preliminary Version).
Proceedings of the Automata, 1977
1976
A Note on Multiple-Entry Finite Automata.
J. Comput. Syst. Sci., 1976
On the Structure of Feasible Computations.
Advances in Computers, 1976
1974
On the Structure of Feasible Computation.
Proceedings of the GI - 4. Jahrestagung, Berlin, 9.-12. Oktober 1974, 1974
On the Power of Multiplication in Random Access Machines
Proceedings of the 15th Annual Symposium on Switching and Automata Theory, 1974