Travelled to:1 × Austria
1 × France
1 × Switzerland
4 × USA
Collaborated with:∅ P.Beame M.Tompa J.A.Brzozowski A.Borodin F.M.a.d.Heide A.Wigderson M.Adler L.A.Goldberg M.Paterson P.Ragde D.Dolev W.J.Paul E.Upfal
Talks about:bound (6) parallel (3) problem (3) two (3) lower (2) predecessor (1) dictionari (1) exponenti (1) character (1) tradeoff (1)
Person: Faith E. Fich
DBLP: Fich:Faith_E=
Contributed to:
2000
199919861985198319811979Wrote 9 papers:
- ICALP-2000-AdlerFGP #bound
- Tight Size Bounds for Packet Headers in Narrow Meshes (MA, FEF, LAG, MP), pp. 756–767.
- STOC-1999-BeameF #bound #problem
- Optimal Bounds for the Predecessor Problem (PB, FEF), pp. 295–304.
- ICALP-1986-BorodinFHUW #problem #taxonomy #trade-off
- A Tradeoff Between Search and Update Time for the Implicit Dictionary Problem (AB, FEF, FMadH, EU, AW), pp. 50–59.
- STOC-1985-FichHRW #bound #infinity #parallel
- One, Two, Three … Infinity: Lower Bounds for Parallel Computation (FEF, FMadH, PR, AW), pp. 48–58.
- STOC-1985-FichT #complexity #finite #parallel
- The Parallel Complexity of Exponentiating Polynomials over Finite Fields (FEF, MT), pp. 38–47.
- STOC-1983-BorodinDFP #bound #branch #source code
- Bounds for Width Two Branching Programs (AB, DD, FEF, WJP), pp. 87–93.
- STOC-1983-Fich #bound #parallel
- New Bounds for Parallel Prefix Circuits (FEF), pp. 100–109.
- STOC-1981-Fich #bound #detection #problem
- Lower Bounds for the Cycle Detection Problem (FEF), pp. 96–105.
- ICALP-1979-FichB
- A Characterization of a Dot-Depth Two Analogue of Generalized Definite Languages (FEF, JAB), pp. 230–244.