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: Author="Vazirani, V.V."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Primal-dual approximation algorithms for integral flow and multicut in trees
N. Garg
,
V.V. Vazirani
,
M. Yannakakis
Algorithmica
18
(1), 1997, pp. 3-20
On-line algorithms for weighted bipartite matching and stable marriages
S. Khuller
,
S.G. Mitchell
,
V.V. Vazirani
Lecture Notes in Computer Science
510
, 1991, pp. 728-738
An optimal algorithm for on-line bipartite matching
R.M. Karp
,
U.V. Vazirani
,
V.V. Vazirani
Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, STOC'90 (Baltimore, Maryland, May 14--16, 1990)
, 1990, pp. 352-358
Pfaffian orientations, 0/1 permanents, and even cycles in directed graphs
V.V. Vazirani
,
M. Yannakakis
Lecture Notes in Computer Science
317
, 1988, pp. 667-681
NC algorithms for computing the number of perfect matchings in
K_{3,3}
-free graphs and related problems
V.V. Vazirani
Lecture Notes in Computer Science
318
, 1988, pp. 233-242
Global wire routing in two-dimensional arrays
R.M. Karp
,
F.T. Leighton
,
R.L. Rivest
,
C.D. Thompson
,
U.V. Vazirani
,
V.V. Vazirani
Algorithmica
2
(1), 1987, pp. 113-129
Matching is as easy as matrix inversion
K. Mulmuley
,
U.V. Vazirani
,
V.V. Vazirani
Combinatorica
7
(1), 1987, pp. 105-120
Matching is as easy as matrix inversion
K. Mulmuley
,
U.V. Vazirani
,
V.V. Vazirani
Proceedings of the 19th Annual ACM Symposium on Theory of Computing, STOC'87 (New York City, May 25--27, 1987)
, 1987, pp. 345-354
NP
is as easy as detecting unique solutions
L.G. Valiant
,
V.V. Vazirani
Theoretical Computer Science
47
(1), 1986, pp. 85-93
NP
is as easy as detecting unique solutions
L.G. Valiant
,
V.V. Vazirani
Proceedings of the 17th Annual ACM Symposium on Theory of Computing, STOC'85 (Providence, RI, May 6-8, 1985)
, 1985, pp. 458-463
Random polynomial time is equal to slightly-random polynomial time
U.V. Vazirani
,
V.V. Vazirani
Proceedings of the 26th Annual IEEE Symposium on Foundations of Computer Science, FOCS'85 (Portland, OR, October 21-23, 1985)
, 1985, pp. 417-428
The two-processor scheduling problem is in R-NC
U. Vazirani
,
V.V. Vazirani
Proceedings of the 17th Annual ACM Symposium on Theory of Computing, STOC'85 (Providence, RI, May 6-8, 1985)
, 1985, pp. 11-21
Efficient and secure pseudo-random number generation
U.V. Vazirani
,
V.V. Vazirani
Proceedings of the 25th Annual IEEE Symposium on Foundations of Computer Science, FOCS'84 (Singer Island, FL, October 24-26, 1984)
, 1984, pp. 458-463
Trapdoor pseudo-random number generators, with applications to protocol design
U.V. Vazirani
,
V.V. Vazirani
Proceedings of the 24th Annual IEEE Symposium on Foundations of Computer Science, FOCS'83 (Tucson, AZ, November 7-9, 1983)
, 1983, pp. 23-30
NP
-completeness of some generalizations of the maximum matching problem
L.J. Stockmeyer
,
V.V. Vazirani
Information Processing Letters
15
(1), 1982, August, pp. 14-19
A natural encoding scheme proved probabilistic polynomial complete
U.V. Vazirani
,
V.V. Vazirani
Proceedings of the 23rd Annual IEEE Symposium on Foundations of Computer Science, FOCS'82 (Chicago, IL, November 3-5, 1982)
, 1982, pp. 40-44
An
O(\sqrt{|V|}\cdot|E|)
algorithm for finding maximum matching in general graphs
S. Micali
,
V.V. Vazirani
Proceedings of the 21st Annual IEEE Symposium on Foundations of Computer Science, FOCS'80 (Syracuse, NY, October 13-15, 1980)
, 1980, pp. 17-27