Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Series=LNCS AND YEAR=1994
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A dynamic approach to timed behaviour
Jeremy Gunawardena
Lecture Notes in Computer Science
836
, 1994, pp. 178-193
A symbolic semantics for the
\pi
-calculus
Michele Boreale
,
Rocco De Nicola
Lecture Notes in Computer Science
836
, 1994, pp. 299-314
Trace refinement of action systems
R.J.R. Back
,
J. von Wright
Lecture Notes in Computer Science
836
, 1994, pp. 367-384
Invariants in process algebra with data
M. Bezem
,
Jan Friso Groote
Lecture Notes in Computer Science
836
, 1994, pp. 401-416
Testing-based abstractions for value-passing systems
Rance Cleaveland
,
James Riely
Lecture Notes in Computer Science
836
, 1994, pp. 417-432
Deriving complete inference systems for a class of GSOS languages generating regular behaviours
Luca Aceto
Lecture Notes in Computer Science
836
, 1994, pp. 449-464
Process algebra with partial choice
J.C.M. Baeten
,
J.A. Bergstra
Lecture Notes in Computer Science
836
, 1994, pp. 465-480
Quasi-random combinatorial structures
Ronald L. Graham
Lecture Notes in Computer Science
834
, 1994, pp. 10-10
Every set of disjoint line segments admits a binary tree
Prosenjit Bose
,
Michael E. Houle
,
Godfried Toussaint
Lecture Notes in Computer Science
834
, 1994, pp. 20-28
On determining the congruity of point sets in higher dimensions
Tatsuya Akutsu
Lecture Notes in Computer Science
834
, 1994, pp. 38-46
On random hard sets for
NP
Ronald V. Book
,
Osamu Watanabe
Lecture Notes in Computer Science
834
, 1994, pp. 47-55
Computing solutions uniquely collapses the polynomial hierarchy
Lane A. Hemaspaandra
,
Ashish V. Naik
,
Mitsunori Ogihara
,
Alan L. Selman
Lecture Notes in Computer Science
834
, 1994, pp. 56-64
On helping and interactive proof systems
V. Arvind
,
J. Köbler
,
R. Schuler
Lecture Notes in Computer Science
834
, 1994, pp. 137-145
Average time complexity of the SAT1.2 algorithm
Jun Gu
,
Qian-Ping Gu
Lecture Notes in Computer Science
834
, 1994, pp. 146-154
Average cost to produce partial orders
Jingsen Chen
Lecture Notes in Computer Science
834
, 1994, pp. 155-163
Rotation distance, triangulations of planar surfaces and hyperbolic geometry
Jin-Yi Cai
,
Michael D. Hirsch
Lecture Notes in Computer Science
834
, 1994, pp. 172-180
Finitely representable spatial objects and efficient computation
Yongmao Chen
,
Terence R. Smith
Lecture Notes in Computer Science
834
, 1994, pp. 181-189
Edge-disjoint paths in permutation graphs
C.P. Gopalakrishnan
,
C. Pandu Rangan
Lecture Notes in Computer Science
834
, 1994, pp. 208-216
Multispace search: A new optimization approach
Jun Gu
Lecture Notes in Computer Science
834
, 1994, pp. 252-260
Realizing degree sequences in parallel
Srinivasa Arikati
,
Anil Maheshwari
Lecture Notes in Computer Science
834
, 1994, pp. 261-269
Fast and efficient operations on parallel priority queues
Danny Z. Chen
,
Xiaobo Hu
Lecture Notes in Computer Science
834
, 1994, pp. 279-287
Heaps with bits
Svante Carlsson
,
Jingsen Chen
,
Christer Mattsson
Lecture Notes in Computer Science
834
, 1994, pp. 288-296
k
-pairwise cluster fault tolerant routing in hypercubes
Qian-Ping Gu
,
Shietung Peng
Lecture Notes in Computer Science
834
, 1994, pp. 342-350
Resource bounded randomness and weakly complete problems
Klaus Ambos-Spies
,
Sebastiaan A. Terwijn
,
Xizhong Zheng
Lecture Notes in Computer Science
834
, 1994, pp. 369-377
Separability and one-way functions
Lance Fortnow
,
John Rogers
Lecture Notes in Computer Science
834
, 1994, pp. 396-404
Seiten
<
1
2
3
4
5
6
7
8
9
10
11
12
>