Parallel Searching in Generalized Monge Arrays

Saved in:
Bibliographic Details
Published in:Algorithmica Vol. 19; no. 3; pp. 291 - 317
Main Authors: Aggarwal, A., Kravets, D., Park, J. K., Sen, S.
Format: Journal Article
Language:English
Published: New York, NY Springer 01.11.1997
Subjects:
ISSN:0178-4617
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Author Aggarwal, A.
Kravets, D.
Park, J. K.
Sen, S.
Author_xml – sequence: 1
  givenname: A.
  surname: Aggarwal
  fullname: Aggarwal, A.
– sequence: 2
  givenname: D.
  surname: Kravets
  fullname: Kravets, D.
– sequence: 3
  givenname: J. K.
  surname: Park
  fullname: Park, J. K.
– sequence: 4
  givenname: S.
  surname: Sen
  fullname: Sen, S.
BackLink http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=2841329$$DView record in Pascal Francis
BookMark eNptkEFLAzEQhXOoYFu9-Av24EnYOtlsks2xFG2FFQvqeRmzkxpZsyXZS_31rlQUxMfA4w3fzOHN2CT0gRi74LDgAPp6W8Mow7WcsClwXeWl4vqUzVJ6A-CFNmrKFluM2HXUZY-E0b76sMt8yNYUaNz7D2qz-z7sKFvGiId0xk4cdonOv33Onm9vnlabvH5Y362WdW4LBUOOgBKrUnIap2jHWGhnHHGhrCBE0Zr2xUluwDmlZYVkhBDUKiUdOQtizi6Pf_eYLHYuYrA-Nfvo3zEemqIquSjMiF0dMRv7lCK5H4JD81VC81vCCMMf2PoBB9-HIaLv_jv5BCwsYYg
CitedBy_id crossref_primary_10_1007_s00453_011_9603_5
ContentType Journal Article
Copyright 1997 INIST-CNRS
Copyright_xml – notice: 1997 INIST-CNRS
DBID AAYXX
CITATION
IQODW
DOI 10.1007/PL00009175
DatabaseName CrossRef
Pascal-Francis
DatabaseTitle CrossRef
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
Applied Sciences
EndPage 317
ExternalDocumentID 2841329
10_1007_PL00009175
GroupedDBID -Y2
-~C
-~X
.86
.DC
.VR
06D
0R~
0VY
199
1N0
1SB
203
23M
28-
2J2
2JN
2JY
2KG
2KM
2LR
2P1
2VQ
2~H
30V
4.4
406
408
409
40D
40E
5GY
5QI
5VS
67Z
6NX
78A
8TC
8UJ
95-
95.
95~
96X
AAAVM
AABHQ
AACDK
AAHNG
AAIAL
AAJBT
AAJKR
AANZL
AAOBN
AAPKM
AARHV
AARTL
AASML
AATNV
AATVU
AAUYE
AAWCG
AAYIU
AAYQN
AAYTO
AAYXX
ABAKF
ABBBX
ABBRH
ABBXA
ABDBE
ABDPE
ABDZT
ABECU
ABFSG
ABFSI
ABFTV
ABHLI
ABHQN
ABJNI
ABJOX
ABKCH
ABKTR
ABLJU
ABMNI
ABMQK
ABNWP
ABQBU
ABQSL
ABRTQ
ABSXP
ABTEG
ABTHY
ABTKH
ABTMW
ABULA
ABWNU
ABXPI
ACAOD
ACBXY
ACDTI
ACGFS
ACHSB
ACHXU
ACKNC
ACMDZ
ACMLO
ACOKC
ACOMO
ACPIV
ACSTC
ACZOJ
ADHHG
ADHIR
ADHKG
ADIMF
ADKNI
ADKPE
ADRFC
ADTPH
ADURQ
ADYFF
ADZKW
AEBTG
AEFIE
AEFQL
AEGAL
AEGNC
AEJHL
AEJRE
AEKMD
AEMSY
AENEX
AEOHA
AEPYU
AETLH
AEVLU
AEXYK
AEZWR
AFBBN
AFDZB
AFEXP
AFGCZ
AFHIU
AFLOW
AFOHR
AFQWF
AFWTZ
AFZKB
AGAYW
AGDGC
AGGDS
AGJBK
AGMZJ
AGQEE
AGQMX
AGQPQ
AGRTI
AGWIL
AGWZB
AGYKE
AHAVH
AHBYD
AHKAY
AHPBZ
AHSBF
AHWEU
AHYZX
AI.
AIAKS
AIGIU
AIIXL
AILAN
AITGF
AIXLP
AJBLW
AJRNO
AJZVZ
ALMA_UNASSIGNED_HOLDINGS
ALWAN
AMKLP
AMXSW
AMYLF
AMYQR
AOCGG
ARMRJ
ASPBG
ATHPR
AVWKF
AXYYD
AYFIA
AYJHY
AZFZN
B-.
BA0
BBWZM
BDATZ
BGNMA
BSONS
CAG
CITATION
COF
CS3
CSCUP
DDRTE
DL5
DNIVK
DPUIP
E.L
EBLON
EBS
EIOEI
EJD
ESBYG
FEDTE
FERAY
FFXSO
FIGPU
FINBP
FNLPD
FRRFC
FSGXE
FWDCC
GGCAI
GGRSB
GJIRD
GNWQR
GQ7
GQ8
GXS
H13
HF~
HG5
HG6
HMJXF
HQYDN
HRMNR
HVGLF
HZ~
H~9
I09
IHE
IJ-
IKXTQ
ITM
IWAJR
IXC
IZIGR
IZQ
I~X
I~Z
J-C
J0Z
JBSCW
JCJTX
JZLTJ
KDC
KOV
KOW
LAS
LLZTM
M4Y
MA-
N2Q
N9A
NB0
NDZJH
NPVJJ
NQJWS
NU0
O9-
O93
O9G
O9I
O9J
OAM
P19
P9O
PF-
PT4
PT5
QOK
QOS
R4E
R89
R9I
RHV
RNI
RNS
ROL
RPX
RSV
RZK
S16
S1Z
S26
S27
S28
S3B
SAP
SCJ
SCLPG
SCO
SDH
SDM
SHX
SISQX
SJYHP
SNE
SNPRN
SNX
SOHCF
SOJ
SPISZ
SRMVM
SSLCW
STPWE
SZN
T13
T16
TN5
TSG
TSK
TSV
TUC
U2A
UG4
UOJIU
UQL
UTJUX
UZXMN
VC2
VFIZW
VH1
W23
W48
WK8
YLTOR
Z45
ZMTXR
ZY4
~EX
AAYZH
AESKC
IQODW
RIG
ID FETCH-LOGICAL-c260t-a0a5a8451e51e2da0a27f9fe136c3eaa3d9dbf5190ff6758ae9333ed665fefc03
IEDL.DBID RSV
ISICitedReferencesCount 2
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=10_1007_PL00009175&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0178-4617
IngestDate Mon Jul 21 09:14:05 EDT 2025
Sat Nov 29 03:45:23 EST 2025
Tue Nov 18 19:39:34 EST 2025
IsPeerReviewed true
IsScholarly true
Issue 3
Keywords Parallel algorithm
Distributed memory multiprocessor system
Computer network
Optimal algorithm
Hypercube
Parallel computation
Time complexity
Search algorithm
Language English
License http://www.springer.com/tdm
CC BY 4.0
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c260t-a0a5a8451e51e2da0a27f9fe136c3eaa3d9dbf5190ff6758ae9333ed665fefc03
PageCount 27
ParticipantIDs pascalfrancis_primary_2841329
crossref_primary_10_1007_PL00009175
crossref_citationtrail_10_1007_PL00009175
PublicationCentury 1900
PublicationDate 1997-11-01
PublicationDateYYYYMMDD 1997-11-01
PublicationDate_xml – month: 11
  year: 1997
  text: 1997-11-01
  day: 01
PublicationDecade 1990
PublicationPlace New York, NY
PublicationPlace_xml – name: New York, NY
PublicationTitle Algorithmica
PublicationYear 1997
Publisher Springer
Publisher_xml – name: Springer
SSID ssj0012796
Score 1.4920555
SourceID pascalfrancis
crossref
SourceType Index Database
Enrichment Source
StartPage 291
SubjectTerms Algorithmics. Computability. Computer arithmetics
Applied sciences
Computer science; control theory; systems
Computer systems and distributed systems. User interface
Exact sciences and technology
Software
Theoretical computing
Title Parallel Searching in Generalized Monge Arrays
Volume 19
WOSCitedRecordID wos10_1007_PL00009175&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAVX
  databaseName: SpringerLINK Contemporary 1997-Present
  issn: 0178-4617
  databaseCode: RSV
  dateStart: 19970101
  customDbUrl:
  isFulltext: true
  dateEnd: 99991231
  titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22
  omitProxy: false
  ssIdentifier: ssj0012796
  providerName: Springer Nature
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1bS8MwFD6M4YMgzitOnQTciw_Rpul6eRRx-CBj4IW9jTQ5kcGoo9sE_fWetN0NFAZ9KZyEcpL0-w5Jvg-g7ceYBoQs3IuV5gExeK4UGi6sL6TVhPDCFGYTUa8XDwZJvwbtf3fw7_rPBY8hmKMfrQjLS1ov78utAj8qTLiczTwPCI_XNEhXTTdQZ2-ippQAWzpXrMFJt7HdhxzAfkUX2X05vodQw-wIGgsrBlatzGO47avcuaKMWXl-mACJjTJWiUqPftAwWr0fSD3l6nt6Am_dx9eHJ15ZIXBNBceMK091VBx0BNLjG3r1I5tYFDLUEpWSJjGpJTbmWetKAIWJlBJNGHYsWu3JU6hnnxmeAVPC0SrPSqocAxqSJMIIg9QhGZViUdqEm0WqhrrSCXd2FePhQuF4lYgmXC9jJ6U6xp9RrY2ML0MJGp3P_flWvVzAbiEdW9wDvIT6LJ9jC3b012w0za-KOfELyzms3g
linkProvider Springer Nature
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Parallel+searching+in+generalized+Monge+arrays&rft.jtitle=Algorithmica&rft.au=AGGARWAL%2C+A&rft.au=KRAVETS%2C+D&rft.au=PARK%2C+J.+K&rft.au=SEN%2C+S&rft.date=1997-11-01&rft.pub=Springer&rft.issn=0178-4617&rft.volume=19&rft.issue=3&rft.spage=291&rft.epage=317&rft_id=info:doi/10.1007%2FPL00009175&rft.externalDBID=n%2Fa&rft.externalDocID=2841329
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0178-4617&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0178-4617&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0178-4617&client=summon