Janos Simon - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 61 from 61

2022

Remembering JurisJanos Simon. sigact, 53(4):41-47, 2022. [doi]

2021

Artificial intelligence voice assistant implementation possibilities in interactive toy for preschool age childrenZoltán Pap, Zlatko Covic, Janos Simon. sisy 2021: 21-26 [doi]

2017

Selection of unmanned aerial vehicle for precision agriculture with multi-criteria decision making algorithmImre Petkovics, Janos Simon, Ármin Petkovics, Zlatko Covic. sisy 2017: 151-156 [doi]

2016

2015

Clicking for business English successLivia Szedmina, Piroska Stanic Molcer, Janos Simon, Zlatko Covic. sisy 2015: 313-317 [doi]

2014

Comparison of different mobile WSN node localization techniques within the controlled microclimatic environmentJanos Simon. sisy 2014: 79-82 [doi]

2007

The Undecidability of the Generalized Collatz ProblemStuart A. Kurtz, Janos Simon. tamc 2007: 542-553 [doi]

Analysis of multi-hop emergency message propagation in vehicular ad hoc networksGiovanni Resta, Paolo Santi, Janos Simon. mobihoc 2007: 140-149 [doi]

2004

Bounding the firing synchronization problem on a ringAndré Berthiaume, Todd Bittner, Ljubomir Perkovic, Amber Settle, Janos Simon. TCS, 320(2-3):213-228, 2004. [doi]

Silence Is Golden with High Probability: Maintaining a Connected Backbone in Wireless Sensor NetworksPaolo Santi, Janos Simon. ewsn 2004: 106-121 [doi]

2002

New Bounds for the Firing Squad Problem on a RingAndré Berthiaume, Ljubomir Perkovic, Amber Settle, Janos Simon. sirocco 2002: 17-31

Smaller solutions for the firing squadAmber Settle, Janos Simon. TCS, 276(1-2):83-109, 2002. [doi]

2001

Decidable Properties of Graphs of All-Optical NetworksLuciano Margara, Janos Simon. icalp 2001: 518-529 [doi]

2000

Wavelength Assignment Problem on All-Optical Networks with ::::k:::: Fibres per LinkLuciano Margara, Janos Simon. icalp 2000: 768-779 [doi]

On the bottleneck counting argumentJanos Simon, Shi-Chun Tsai. TCS, 237(1-2):429-437, 2000. [doi]

1998

Improved bounds for the firing synchronization problemAmber Settle, Janos Simon. sirocco 1998: 66-81

1997

On the Amount of Randomness Needed in Distributed ComputationsBruno Codenotti, Peter Gemmell, Petr Pudlak, Janos Simon. opodis 1997: 237-248

A Note on the Bottleneck Counting ArgumentJanos Simon, Shi-Chun Tsai. cocoon 1997: 297-301 [doi]

1996

Symmetry Breaking in Anonymous Networks: CharacterizationsPaolo Boldi, Shella Shammah, Sebastiano Vigna, Bruno Codenotti, Peter Gemmell, Janos Simon. istcs 1996: 16-26

Active transport in biological computingStuart A. Kurtz, Stephen R. Mahaney, James S. Royer, Janos Simon. dimacs 1999: 171-180

1995

Average Circuit Depth and Average Communication ComplexityBruno Codenotti, Peter Gemmell, Janos Simon. esa 1995: 102-112

Deterministic, Constant Space, Self-Stabilizing Leader Election on Uniform RingsGene Itkis, Chengdian Lin, Janos Simon. wdag 1995: 288-302

1992

Observing Self-StabilizationChengdian Lin, Janos Simon. podc 1992: 113-123

On the Complexity of RAM with Various Operation SetsJanos Simon, Mario Szegedy. stoc 1992: 624-631

1990

Milking the Aanderaa ArgumentRamamohan Paturi, Joel I. Seiferas, Janos Simon, Richard E. Newman-Wolfe. iandc, 88(1):88-104, September 1990.

A New Lower Bound Theorem for Read-Only-Once Branching Programs and its ApplicationsJanos Simon, Mario Szegedy. dimacs 1993: 183-194

1989

On the Computational Complexity of Continuous RoutingYukon Chang, Susanne E. Hambrusch, Janos Simon. jal, 10(1):86-108, 1989.

1988

Investigations of Fault-Tolerant Networks of Computers (Preliminary Version)Piotr Berman, Janos Simon. stoc 1988: 66-77

Universal Traversal Sequences of Length n^O(log n) for CliquesHoward J. Karloff, Ramamohan Paturi, Janos Simon. ipl, 28(5):241-243, 1988.

1986

Complexity classes in communication complexity theory (preliminary version)László Babai, Peter Frankl, Janos Simon. focs 1986: 337-347

Continous Routing and Batch Routing on the HypercubeYukon Chang, Janos Simon. podc 1986: 272-281

Hierarchical VLSI Design Systems Based on Attribute GrammarsLarry G. Jones, Janos Simon. POPL 1986: 58-69

Probabilistic Communication ComplexityRamamohan Paturi, Janos Simon. jcss, 33(1):106-123, 1986.

1985

Solving Undirected Graph Problems on VLSISusanne E. Hambrusch, Janos Simon. SICOMP, 14(3):527-544, 1985.

1984

Information Transfer under Different Sets of ProtocolsJoseph JáJá, Viktor K. Prasanna, Janos Simon. SICOMP, 13(4):840-849, 1984.

Probabilistic Communication Complexity (Preliminary Version)Ramamohan Paturi, Janos Simon. focs 1984: 118-126

Space-Bounded Hierarchies and Probabilistic ComputationsWalter L. Ruzzo, Janos Simon, Martin Tompa. jcss, 28(2):216-230, 1984.

1983

Lower Bounds on Graph Threading by Probabilistic Machines (Preliminary Version)Piotr Berman, Janos Simon. focs 1983: 304-311

Lower Bounds for Solving Undirected Graph Problems on VLSISusanne E. Hambrusch, Janos Simon. icalp 1983: 292-303

Lower Bounds on the Time of Probabilistic On-Line Simulations (Preliminary Version)Ramamohan Paturi, Janos Simon. focs 1983: 343-350

1982

Parallel Algorithms in Graph Theory: Planarity TestingJoseph JáJá, Janos Simon. SICOMP, 11(2):314-328, 1982.

Space Efficient Algorithms for Some Graph Theoretical ProblemsJoseph JáJá, Janos Simon. ACTA, 17:411-423, 1982.

Space-Bounded Hierarchies and Probabilistic ComputationsWalter L. Ruzzo, Janos Simon, Martin Tompa. stoc 1982: 215-223

1981

An Information-Theoretic Approach to Time Bounds for On-Line ComputationWolfgang J. Paul, Joel I. Seiferas, Janos Simon. jcss, 23(2):108-126, 1981.

On Tape-Bounded Probabilistic Turing Machine AcceptorsJanos Simon. TCS, 16:75-91, 1981.

Space-Bounded Probabilistic Turing Machine Complexity Classes Are Closed under Complement (Preliminary Version)Janos Simon. stoc 1981: 158-167

Division in Idealized Unit Cost RAMSJanos Simon. jcss, 22(3):421-441, 1981.

1980

Deterministic Simulation of Tape-Bounded Probabilistic Turing Machine TransducersJohn Gill, James Hunt, Janos Simon. TCS, 12:333-338, 1980.

Parallel Algorithms in Graph Theory: Planarity Testing (preliminary version)Joseph JáJá, Janos Simon. mfcs 1980: 305-319

An Information-Theoretic Approach to Time Bounds for On-Line Computation (Preliminary Version)Wolfgang J. Paul, Joel I. Seiferas, Janos Simon. stoc 1980: 357-367

1979

Division Is GoodJanos Simon. focs 1979: 411-420

1978

On Tape-Bounded Probabilistic Turing Machine Transducers (Extended Abstract)Janos Simon, John Gill, James Hunt. focs 1978: 107-112

1977

On Feasible Numbers (Preliminary Version)Janos Simon. stoc 1977: 195-207

On the Difference Between One and Many (Preliminary Version)Janos Simon. icalp 1977: 480-491

1976

A Note on Multiple-Entry Finite AutomataZvi Galil, Janos Simon. jcss, 12(3):350-351, 1976.

On the Structure of Feasible ComputationsJuris Hartmanis, Janos Simon. ac, 14:1-43, 1976.

A comment on do tracesJanos Simon. SIGPLAN, 11(10):49-52, 1976. [doi]

1974

On the Power of Multiplication in Random Access MachinesJuris Hartmanis, Janos Simon. focs 1974: 13-23

On the Structure of Feasible ComputationJuris Hartmanis, Janos Simon. gi 1975: 3-51

Sign in or sign up to see more results.

runs on WebDSL