Travelled to:1 × Canada
1 × Finland
1 × Greece
1 × Spain
1 × Switzerland
6 × USA
Collaborated with:∅ L.Margara M.Szegedy P.Berman L.G.Jones S.E.Hambrusch W.L.Ruzzo M.Tompa W.J.Paul J.I.Seiferas
Talks about:bound (4) network (3) comput (3) probabilist (2) problem (2) complex (2) space (2) optic (2) graph (2) vlsi (2)
Person: Janos Simon
DBLP: Simon:Janos
Facilitated 1 volumes:
EdContributed to:
2001200019921988
1986198319821981198019771977Wrote 11 papers:
- ICALP-2001-MargaraS #decidability #graph #network
- Decidable Properties of Graphs of All-Optical Networks (LM, JS), pp. 518–529.
- ICALP-2000-MargaraS #network #problem
- Wavelength Assignment Problem on All-Optical Networks with k Fibres per Link (LM, JS), pp. 768–779.
- STOC-1992-SimonS #complexity #on the #ram #set
- On the Complexity of RAM with Various Operation Sets (JS, MS), pp. 624–631.
- STOC-1988-BermanS #fault tolerance #network
- Investigations of Fault-Tolerant Networks of Computers (PB, JS), pp. 66–77.
- POPL-1986-JonesS #attribute grammar #design
- Hierarchical VLSI Design Systems Based on Attribute Grammars (LGJ, JS), pp. 58–69.
- ICALP-1983-HambruschS #bound #graph #problem
- Lower Bounds for Solving Undirected Graph Problems on VLSI (SEH, JS), pp. 292–303.
- STOC-1982-RuzzoST #bound #probability
- Space-Bounded Hierarchies and Probabilistic Computations (WLR, JS, MT), pp. 215–223.
- STOC-1981-Simon #bound #complexity #probability #turing machine
- Space-Bounded Probabilistic Turing Machine Complexity Classes Are Closed under Complement (JS), pp. 158–167.
- STOC-1980-PaulSS #approach #bound #online
- An Information-Theoretic Approach to Time Bounds for On-Line Computation (WJP, JIS, JS), pp. 357–367.
- ICALP-1977-Simon #difference #on the
- On the Difference Between One and Many (JS), pp. 480–491.
- STOC-1977-Simon #on the
- On Feasible Numbers (JS), pp. 195–207.