Alek Vainshtein

According to our database, Alek Vainshtein authored at least 23 papers between 1994 and 2019.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2019

Clarification of Segment ID Sub-TLV Length for RFC 8287.

Nagendra Kumar Nainar, Carlos Pignataro, Faisal Iqbal, Alexander Vainshtein

RFC, December, 2019

2017

Residence Time Measurement in MPLS Networks.

Greg Mirsky, Stefano Ruffini, Eric Gray, John Drake, Stewart Bryant, Alexander Vainshtein

RFC, May, 2017

2009

Layer Two Tunneling Protocol version 3 - Setup of Time-Division Multiplexing (TDM) Pseudowires.

Alexander Vainshtein, Sharon Galtzur

RFC, August, 2009

2007

Structure-Aware Time Division Multiplexed (TDM) Circuit Emulation Service over Packet Switched Network (CESoPSN).

Alexander Vainshtein, Israel Sasson, Eduard Metz, Tim Frost, Prayson Pate

RFC, December, 2007

2006

Structure-Agnostic Time Division Multiplexing (TDM) over Packet (SAToP).

Alexander Vainshtein, Yaakov Stein

RFC, June, 2006

2005

Periodic de Bruijn triangles: exact and asymptotic results.

Boris Z. Shapiro, Michael Shapiro, Alek Vainshtein

Discret. Math., 2005

2003

Domination analysis of combinatorial optimization problems.

Gregory Z. Gutin, Alek Vainshtein, Anders Yeo

Discret. Appl. Math., 2003

On the number of connected components in the space of M-polynomials in hyperbolic functions.

Boris Z. Shapiro, Alek Vainshtein

Adv. Appl. Math., 2003

2002

Approximation algorithms for multi-parameter graph optimization problems.

Ivan Basov, Alek Vainshtein

Discret. Appl. Math., 2002

On the relation between the throughput gain with slot reuse and the number of address bits in the dual bus configuration Part 1: Maximum throughput.

Oran Sharon, Alexander Vainshtein, Anatoly Likholat

Comput. Syst. Sci. Eng., 2002

Counting Occurrences of 132 in a Permutation.

Toufik Mansour, Alek Vainshtein

Adv. Appl. Math., 2002

2001

Restricted 132-Avoiding Permutations.

Toufik Mansour, Alek Vainshtein

Adv. Appl. Math., 2001

2000

The General Structure of Edge-Connectivity of a Vertex Subset in a Graph and its Incremental Maintenance. Odd Case.

Yefim Dinitz, Alek Vainshtein

SIAM J. Comput., 2000

Avoiding maximal parabolic subgroups of S_k.

Toufik Mansour, Alek Vainshtein

Discret. Math. Theor. Comput. Sci., 2000

Restricted Permutations, Continued Fractions, and Chebyshev Polynomials.

Toufik Mansour, Alek Vainshtein

Electron. J. Comb., 2000

1998

Kazhdan-Lusztig polynomials for certain varieties of incomplete flags.

Boris Z. Shapiro, Michael Shapiro, Alek Vainshtein

Discret. Math., 1998

1996

Topology of intersections of Schubert cells and Hecke algebra.

Boris Z. Shapiro, Michael Shapiro, Alek Vainshtein

Discret. Math., 1996

Asymptotics for Morgan numbers of fractional orders.

Alexander Y. Kreinin, Alek Vainshtein

Discret. Math., 1996

1995

Locally Orientable Graphs, Cell Structures, and a New Algorithm for the Incremental Maintenance of Connectivity Carcasses.

Yefim Dinitz, Alek Vainshtein

Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 1995

Minimal Enclosing Parallelogram with Application.

Christian Schwarz, Jürgen Teich, Alek Vainshtein, Emo Welzl, Brian L. Evans

Proceedings of the Eleventh Annual Symposium on Computational Geometry, 1995

1994

Optimal Strategies for Spinning and Blocking.

Leonid B. Boguslavsky, Karim Harzallah, Alexander Y. Kreinin, Kenneth C. Sevcik, Alexander Vainshtein

J. Parallel Distributed Comput., 1994

The connectivity carcass of a vertex subset in a graph and its incremental maintenance.

Yefim Dinitz, Alek Vainshtein

Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 1994

Isolation Electromagnetically coupled DC and AC current sensor and detector.

Alek Vainshtein, Igor M. Filanovsky

Proceedings of the 1994 IEEE International Symposium on Circuits and Systems, ISCAS 1994, London, England, UK, May 30, 1994