default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlek Vainshtein
Person information
- affiliation: University of Haifa, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2005
[j14]Boris Z. Shapiro
, Michael Shapiro, Alek Vainshtein:
Periodic de Bruijn triangles: exact and asymptotic results. Discret. Math. 298(1-3): 321-333 (2005)- 2003
- [j13]Boris Z. Shapiro, Alek Vainshtein:
On the number of connected components in the space of M-polynomials in hyperbolic functions. Adv. Appl. Math. 30(1-2): 273-282 (2003) - [j12]Gregory Z. Gutin, Alek Vainshtein, Anders Yeo:
Domination analysis of combinatorial optimization problems. Discret. Appl. Math. 129(2-3): 513-520 (2003) - 2002
- [j11]Toufik Mansour, Alek Vainshtein:
Counting Occurrences of 132 in a Permutation. Adv. Appl. Math. 28(2): 185-195 (2002) - [j10]Oran Sharon, Alexander Vainshtein, Anatoly Likholat:
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. Comput. Syst. Sci. Eng. 17(4/5): 223-236 (2002) - [j9]Ivan Basov, Alek Vainshtein:
Approximation algorithms for multi-parameter graph optimization problems. Discret. Appl. Math. 119(1-2): 129-138 (2002) - 2001
- [j8]Toufik Mansour, Alek Vainshtein:
Restricted 132-Avoiding Permutations. Adv. Appl. Math. 26(3): 258-269 (2001) - 2000
- [j7]Toufik Mansour, Alek Vainshtein:
Restricted Permutations, Continued Fractions, and Chebyshev Polynomials. Electron. J. Comb. 7 (2000) - [j6]Toufik Mansour, Alek Vainshtein:
Avoiding maximal parabolic subgroups of Sk. Discret. Math. Theor. Comput. Sci. 4(1): 81-90 (2000) - [j5]Yefim Dinitz, Alek Vainshtein:
The General Structure of Edge-Connectivity of a Vertex Subset in a Graph and its Incremental Maintenance. Odd Case. SIAM J. Comput. 30(3): 753-808 (2000) - 1998
- [j4]Boris Z. Shapiro, Michael Shapiro, Alek Vainshtein:
Kazhdan-Lusztig polynomials for certain varieties of incomplete flags. Discret. Math. 180(1-3): 345-355 (1998) - 1996
- [j3]Boris Z. Shapiro, Michael Shapiro, Alek Vainshtein:
Topology of intersections of Schubert cells and Hecke algebra. Discret. Math. 153(1-3): 305-318 (1996) - [j2]Alexander Y. Kreinin, Alek Vainshtein:
Asymptotics for Morgan numbers of fractional orders. Discret. Math. 161(1-3): 301-308 (1996) - 1994
- [j1]Leonid B. Boguslavsky, Karim Harzallah, Alexander Y. Kreinin, Kenneth C. Sevcik, Alexander Vainshtein:
Optimal Strategies for Spinning and Blocking. J. Parallel Distributed Comput. 21(2): 246-254 (1994)
Conference and Workshop Papers
- 1995
- [c4]Christian Schwarz, Jürgen Teich, Alek Vainshtein, Emo Welzl, Brian L. Evans:
Minimal Enclosing Parallelogram with Application. SCG 1995: C34-C35 - [c3]Yefim Dinitz, Alek Vainshtein:
Locally Orientable Graphs, Cell Structures, and a New Algorithm for the Incremental Maintenance of Connectivity Carcasses. SODA 1995: 302-311 - 1994
- [c2]Alek Vainshtein, Igor M. Filanovsky:
Isolation Electromagnetically coupled DC and AC current sensor and detector. ISCAS 1994: 69-72 - [c1]Yefim Dinitz, Alek Vainshtein:
The connectivity carcass of a vertex subset in a graph and its incremental maintenance. STOC 1994: 716-725
Informal and Other Publications
- 2019
- [i5]Nagendra Kumar Nainar, Carlos Pignataro, Faisal Iqbal, Alexander Vainshtein:
Clarification of Segment ID Sub-TLV Length for RFC 8287. RFC 8690: 1-7 (2019) - 2017
- [i4]Greg Mirsky, Stefano Ruffini, Eric Gray, John Drake, Stewart Bryant, Alexander Vainshtein:
Residence Time Measurement in MPLS Networks. RFC 8169: 1-30 (2017) - 2009
- [i3]Alexander Vainshtein, Sharon Galtzur:
Layer Two Tunneling Protocol version 3 - Setup of Time-Division Multiplexing (TDM) Pseudowires. RFC 5611: 1-11 (2009) - 2007
- [i2]Alexander Vainshtein, Israel Sasson, Eduard Metz, Tim Frost, Prayson Pate:
Structure-Aware Time Division Multiplexed (TDM) Circuit Emulation Service over Packet Switched Network (CESoPSN). RFC 5086: 1-38 (2007) - 2006
- [i1]Alexander Vainshtein, Yaakov Stein:
Structure-Agnostic Time Division Multiplexing (TDM) over Packet (SAToP). RFC 4553: 1-27 (2006)
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
