default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndrey Nikolaev
Person information
Other persons with a similar name
- Andrey Borisovich Nikolaev
- Andrey R. Nikolaev
![[0000-0001-5126-8566]](https://dblp.dagstuhl.de/img/orcid-mark.12x12.png "0000-0001-5126-8566")
- Andrey V. Nikolaev — Stevens Institute of Technology, Hoboken, NJ, USA
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[c7]Alexei Miasnikov, Andrey Nikolaev:
On parameterized complexity of the word search problem in the Baumslag-Gersten group. ISSAC 2020: 360-363- [i11]Andrey Nikolaev, Alexander Ushakov:
On subset sum problem in branch groups. CoRR abs/2006.03470 (2020) - [i10]Langshi Chen, Jiayu Li, Ariful Azad, S. Cenk Sahinalp, Madhav V. Marathe, Anil Vullikanti, Andrey Nikolaev, Egor Smirnov, Ruslan Israfilov, Judy Qiu:
SubGraph2Vec: Highly-Vectorized Tree-likeSubgraph Counting. CoRR abs/2009.11665 (2020)
2010 – 2019
- 2019
- [c6]Langshi Chen, Jiayu Li, S. Cenk Sahinalp, Madhav V. Marathe, Anil Vullikanti, Andrey Nikolaev, Egor Smirnov, Ruslan Israfilov, Judy Qiu:
SubGraph2Vec: Highly-Vectorized Tree-like Subgraph Counting. IEEE BigData 2019: 483-492 - [c5]Bo Peng, Judy Qiu, Langshi Chen, Jiayu Li, Miao Jiang, Selahattin Akkas, Egor Smirnov, Ruslan Israfilov, Sergey Khekhnev, Andrey Nikolaev:
HarpGBDT: Optimizing Gradient Boosting Decision Tree for Parallel Efficiency. CLUSTER 2019: 1-11 - [i9]Langshi Chen, Jiayu Li, Ariful Azad, Lei Jiang, Madhav V. Marathe, Anil Vullikanti, Andrey Nikolaev, Egor Smirnov, Ruslan Israfilov, Judy Qiu:
A GraphBLAS Approach for Subgraph Counting. CoRR abs/1903.04395 (2019) - 2018
- [j6]Andrey Nikolaev, Alexander Ushakov:
Subset sum problem in polycyclic groups. J. Symb. Comput. 84: 84-94 (2018) - 2017
- [i8]Andrey Nikolaev, Alexander Ushakov:
Subset sum problem in polycyclic groups. CoRR abs/1703.07406 (2017) - 2016
- [j5]Evgeny Fiksman, Andrey Nikolaev, Ilya Burylov, Sania Salahuddin:
STAC-A2 on Intel architecture: evolving from scalar code to heterogeneous applications. Concurr. Comput. Pract. Exp. 28(3): 878-891 (2016) - [j4]Kenneth R. Blaney, Andrey Nikolaev:
A PTIME solution to the restricted conjugacy problem in generalized Heisenberg groups. Groups Complex. Cryptol. 8(1): 69-74 (2016) - [j3]Elizaveta Frenkel, Andrey Nikolaev, Alexander Ushakov:
Knapsack problems in products of groups. J. Symb. Comput. 74: 96-108 (2016) - 2015
- [j2]Alexei G. Myasnikov, Andrey Nikolaev, Alexander Ushakov:
Knapsack problems in groups. Math. Comput. 84(292): 987-1016 (2015) - [i7]Jeremy MacDonald, Alexei G. Myasnikov, Andrey Nikolaev, Svetla Vassileva:
Logspace and compressed-word computations in nilpotent groups. CoRR abs/1503.03888 (2015) - [i6]Alexei G. Myasnikov, Andrey Nikolaev, Alexander Ushakov:
Non-commutative lattice problems. CoRR abs/1508.02388 (2015) - 2014
- [j1]Alexei G. Myasnikov, Andrey Nikolaev:
Verbal subgroups of hyperbolic groups have infinite width. J. Lond. Math. Soc. 90(2): 573-591 (2014) - [c4]Vitaly A. Antonenko, Ruslan L. Smelyanskiy, Andrey Nikolaev:
Large scale network simulation based on hi-fi approach. SummerSim 2014: 4 - [i5]Elizaveta Frenkel, Andrey Nikolaev, Alexander Ushakov:
Knapsack problems in products of groups. CoRR abs/1408.6509 (2014) - 2013
- [c3]Andrey Nikolaev, Ilya Burylov, Sania Salahuddin:
Intel® version of STAC-A2 benchmark: toward better performance with less effort. WHPCF@SC 2013: 7:1-7:7 - [i4]Alexei G. Myasnikov, Andrey Nikolaev, Alexander Ushakov:
Knapsack Problems in Groups. CoRR abs/1302.5671 (2013) - [i3]Alexei G. Myasnikov, Andrey Nikolaev, Alexander Ushakov:
The Post correspondence problem in groups. CoRR abs/1310.5246 (2013) - 2012
- [c2]Mikhail Smelyanskiy, Jason Sewall, Dhiraj D. Kalamkar, Nadathur Satish, Pradeep Dubey, Nikita Astafiev, Ilya Burylov, Andrey Nikolaev, Sergey Maidanov, Shuo Li, Sunil Kulkarni, Charles H. Finan, Ekaterina Gonina:
Analysis and Optimization of Financial Analytics Benchmark on Modern Multi- and Many-core IA-Based Architectures. SC Companion 2012: 1154-1162 - [c1]Peter Lankford, Lars Ericson, Andrey Nikolaev:
End-User Driven Technology Benchmarks Based on Market-Risk Workloads. SC Companion 2012: 1171-1175 - [i2]Andrey Nikolaev:
Exploring mutexes, the Oracle RDBMS retrial spinlocks. CoRR abs/1212.6640 (2012) - 2011
- [i1]Andrey Nikolaev:
Exploring Oracle RDBMS latches using Solaris DTrace. CoRR abs/1111.0594 (2011)
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:20 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:
