Skip to content

Janos Simon

Publication record assembled from the DBLP archive of ranked conferences.

Papers indexed

36

Venues

14

Active years

1974–2021

Best venue rank

A*

Where they publish

Papers

36 indexed papers, newest first.

YearVenueTitleAuthors
2021SISYArtificial intelligence voice assistant implementation possibilities in interactive toy for preschool age children.Zoltn Pap, Zlatko Covic, Janos Simon
2017SISYSelection of unmanned aerial vehicle for precision agriculture with multi-criteria decision making algorithm.Imre Petkovics, Janos Simon, rmin Petkovics, Zlatko Covic
2016SISYUsage of QR codes in web based system for the electronic market research.Zlatko Covic, Urmos Viktor, Janos Simon, Dalibor Dobrilovic, Zeljko Stojanov
2016SISYModel of data center temperature monitoring system with the use of open source hardware.Dalibor Dobrilovic, Zeljko Stojanov, Zlatko Covic, Janos Simon, Nikola Petrov
2016SISYA survey of ICT: Evolution of architectures, models and layers.Imre Petkovics, rmin Petkovics, Janos Simon
2015SISYClicking for business English success.Livia Szedmina, Piroska Stanic Molcer, Janos Simon, Zlatko Covic
2014SISYComparison of different mobile WSN node localization techniques within the controlled microclimatic environment.Janos Simon
2007MOBIHOCAnalysis of multi-hop emergency message propagation in vehicular ad hoc networks.Giovanni Resta, Paolo Santi, Janos Simon
2007TAMCThe Undecidability of the Generalized Collatz Problem.Stuart A. Kurtz, Janos Simon
2004EWSNSilence Is Golden with High Probability: Maintaining a Connected Backbone in Wireless Sensor Networks.Paolo Santi, Janos Simon
2002SIROCCONew Bounds for the Firing Squad Problem on a Ring.Andr Berthiaume, Ljubomir Perkovic, Amber Settle, Janos Simon
2001ICALPDecidable Properties of Graphs of All-Optical Networks.Luciano Margara, Janos Simon
2000ICALPWavelength Assignment Problem on All-Optical Networks withLuciano Margara, Janos Simon
1998SIROCCOImproved bounds for the firing synchronization problem.Amber Settle, Janos Simon
1997OPODISOn the Amount of Randomness Needed in Distributed Computations.Bruno Codenotti, Peter Gemmell, Petr Pudlk, Janos Simon
1995ESAAverage Circuit Depth and Average Communication Complexity.Bruno Codenotti, Peter Gemmell, Janos Simon
1992PODCObserving Self-Stabilization.Chengdian Lin, Janos Simon
1992STOCOn the Complexity of RAM with Various Operation SetsJanos Simon, Mario Szegedy
1988STOCInvestigations of Fault-Tolerant Networks of Computers (Preliminary Version)Piotr Berman, Janos Simon
1986FOCSComplexity classes in communication complexity theory (preliminary version)Lszl Babai, Peter Frankl, Janos Simon
1986PODCContinous Routing and Batch Routing on the Hypercube.Yukon Chang, Janos Simon
1986POPLHierarchical VLSI Design Systems Based on Attribute Grammars.Larry G. Jones, Janos Simon
1984FOCSProbabilistic Communication Complexity (Preliminary Version)Ramamohan Paturi, Janos Simon
1983FOCSLower Bounds on Graph Threading by Probabilistic Machines (Preliminary Version)Piotr Berman, Janos Simon
1983FOCSLower Bounds on the Time of Probabilistic On-Line Simulations (Preliminary Version)Ramamohan Paturi, Janos Simon
1983ICALPLower Bounds for Solving Undirected Graph Problems on VLSI.Susanne E. Hambrusch, Janos Simon
1982STOCSpace-Bounded Hierarchies and Probabilistic ComputationsWalter L. Ruzzo, Janos Simon, Martin Tompa
1981STOCSpace-Bounded Probabilistic Turing Machine Complexity Classes Are Closed under Complement (Preliminary Version)Janos Simon
1980MFCSParallel Algorithms in Graph Theory: Planarity Testing (preliminary version).Joseph F. JJ, Janos Simon
1980STOCAn Information-Theoretic Approach to Time Bounds for On-Line Computation (Preliminary Version)Wolfgang J. Paul, Joel I. Seiferas, Janos Simon
1979FOCSDivision Is GoodJanos Simon
1978FOCSOn Tape-Bounded Probabilistic Turing Machine Transducers (Extended Abstract)Janos Simon, John Gill, James Hunt
1977ICALPOn the Difference Between One and Many (Preliminary Version).Janos Simon
1977STOCOn Feasible Numbers (Preliminary Version)Janos Simon
1974FOCSOn the Power of Multiplication in Random Access MachinesJuris Hartmanis, Janos Simon
1974GIOn the Structure of Feasible Computation.Juris Hartmanis, Janos Simon